text:
An electronic system comprises a plurality of components each having at least one communication node and being coupled together by communication links through the respective communication nodes so that the plurality of communication links and communication nodes form a bus which resembles an acyclic directed graph having established hierarchical parent-child relationships between adjacent nodes and a root node. Token passing style arbitration is implemented on the system, in one embodiment, in response to the root node sending out an unrequested bus grant, so that the node with the token has access to the bus.
1. In an electronic system comprising a plurality of components interconnected by a plurality of communication links, said plurality of components each having at least a first communications node wherein said communications nodes interface their associated component with a communications link through a node port, said nodes being capable of having a plurality of ports to which communications links to adjacent nodes couple, each node having a predetermined selection criteria established for selecting adjacent nodes coupled through its ports, said configuration of nodes and communications links comprising a directed acyclic graph wherein one node is designated a root node, all nodes coupled to only one adjacent node are designated leaf nodes, all other nodes in the graph being designated branch nodes, said acyclic directed graph having established hierarchical parent-child relationships between all adjacent nodes proceeding from the root node down to any leaf nodes wherein a leaf node has only one parent node and all nodes adjacent to the root node are child nodes with respect to the root node but parent nodes with respect to other adjacent nodes, the root node being defined as having no parent node, a method of token passing bus arbitration wherein a metaphorical token comprising an unrequested bus grant signal is passed from node to node in a cycle through the graph, the node having the token being the node with bus access, said method comprising the step of passing the token through the acyclic directed graph in an order determined by the predetermined selection criterion each node has established for selecting adjacent nodes, said method further comprising a step of returning the token by transmitting a token-refusal signal.
2. A method of token passing bus arbitration as in claim 1 wherein at least one of said plurality of communications links comprises a twisted pair.
3. A method of token passing bus arbitration as in claim 1 wherein at least one of said plurality of communication links comprises an optical fiber.
4. A method of token passing bus arbitration as in claim 1 wherein at least one of said plurality of communication links comprises a wireless coupling.
5. A method of token passing bus arbitration as in claim 1 wherein at least one of said plurality of communication links comprises a cable, the cable carrying two signal pairs and signal ground.
6. A method of token passing bus arbitration as in claim 5 wherein the cable further carries a power pair.
7. A method of token passing bus arbitration as in claim 1 wherein:
the node end the data transmission by transmitting a data end signal, the data ends signal comprises a penultimate bit and an ultimate bit, wherein the penultimate bit is encoded to indicate whether a metaphorical token is being passed by the node such that when the penultimate bit is set by the node the token is passed and the node relinquishes control of the bus.
8. A data communication system comprising:
a plurality of communication nodes, each of the communication nodes having at least one communication port, at least two of the communication nodes being capable of operating in a token passing bus arbitration mode;
a plurality of communication links interconnecting logically adjacent communication nodes through associated communication ports so as to form a configuration of communication nodes and communication links, the configuration of communication nodes and communication links comprising a serial bus;
wherein each of the communication nodes having a predetermined selection criterion established for selecting logically adjacent nodes coupled through its communication ports via one of the communication links so that the configuration of communication nodes and communication links comprise an acyclic directed graph wherein one of the communication nodes is designated a root node and one of the communication nodes is designated a token master node, all communication nodes coupled to only one adjacent communication node being designated leaf nodes, all other communication nodes being designated branch nodes, the acyclic directed graph having established parent-child relationships between all logically adjacent coupled communication nodes proceeding from the root node down to any leaf node;
wherein said token master node generates a token which is passed between the communication nodes having the capability of operating in the token passing bus arbitration mode such that the communication node in possession of the token has access to the bus; and
wherein said token comprises an unrequested bus grant signal which may be returned by transmitting a token refusal signal.
9. A data communication system as in claim 8 wherein the communication node with access to the bus transmits information on the bus in the form of data packets and indicates that it has completed transmitting information by sending a data end signal.
10. A data communication system as in claim 9 wherein the node with access to the bus passes the token by transmitting a token-passing bit pattern as part of the data end signal.
11. A data communication system as in claim 10 wherein the token-passing bit pattern comprises penultimate bit encoding where the penultimate bit of the dribble bits is set so as to indicate that the token is being passed.
12. A data communication system as in claim 11 wherein when the penultimate bit of the dribble bits is set to a logical one the token is passed.
13. A data communication system as in claim 8 wherein said communications links comprising six conductor cables, said six conductors being arranged as two signal pairs and a power pair.
14. A data communication system as in claim 8 wherein each of said communications ports of said communications nodes are arranged as an A pair and a B pair and wherein said communications links are arranged between said communications nodes so as to couple the A pair of a child node's communication port to the B pair of the child node's parent node's communication port and to couple the B pair of the child node's communication port to the A pair of the child node's parent node's communication port.
15. A data communication system as in claim 8 wherein said communication links comprising twisted pairs.
16. A data communication system as in claim 8 wherein said communications links comprising optical fibers.
17. A data communication system as in claim 8 wherein said communication links comprising wireless coupling.
18. A data communication system as in claim 8 wherein the token master is the root node.
19. A data communication system comprising:
a plurality of communication nodes, each of the communication nodes having at least one communication port, at least two of the communication nodes being capable of operating in a token passing bus arbitration mode;
a plurality of communication links interconnecting logically adjacent communication nodes through associated communication ports so as to form a configuration of communication nodes and communication links, the configuration of communication nodes and communication links comprising a serial bus;
wherein each of the communication nodes having a predetermined selection criterion established for selecting logically adjacent nodes coupled through its communication ports via one of the communication links so that the configuration of communication nodes and communication links comprising an acyclic directed graph, the graph comprising a plurality of local clusters of said plurality of communication nodes, each of said plurality of local clusters of nodes having at least one of said communication nodes capable of operating in token passing bus arbitration mode, wherein one of the communication nodes is designated a root node and one of the communication nodes is designated a token master node, all communication nodes coupled to only one adjacent communication node being designated leaf nodes, all other communication nodes being designated branch nodes, the acyclic directed graph having established parent-child relationships between all logically adjacent coupled communication nodes proceeding from the root node down to any leaf node; and
wherein said token master node generates a token which is passed between the communication nodes having the capability of operating in the token passing bus arbitration mode such that the communication node in possession of the token operates as a local root node for an associated one of said local clusters of nodes, the local root node receiving bus access requests from nodes within said associated local cluster of nodes and generating bus grant signals in response thereto.
The present invention relates generally to data communications and, more particularly, to a method of arbitration among nodes coupled together via a common interconnect.
Digital electronic systems such as computer systems often use a common interconnect to share information between components of the system. For computer systems, the interconnect is typically the computer bus.
One type of system interconnect is described by IEEE standards document P1394, draft 8.0v3, entitled P1394 Standard for a High Performance Serial Bus (hereinafter the "P1394 Serial Bus Standard"). A typical serial bus having a P1394 standard architecture is comprised of a multiplicity of nodes that are interconnected via point to point links, such as cables, that each connect a single node of the serial bus to another node of the serial bus. The nodes themselves are associated with respective components of the computer system and serve as interfaces between the component and the communication link.
Data packets are propagated throughout the serial bus using a number of point-to-point transactions, wherein a node that receives a packet from another node via a first point-to-point link retransmits the received packet via other point-to-point links. A tree network configuration and associated packet handling protocol insures that each node receives every packet once.
The P1394 Serial Bus Standard provides for an arbitrary bus topology wherein the hierarchical relationship between nodes of the serial bus is determined by the manner in which the nodes are connected to one another. A P1394 serial bus is configured in three phases: bus initialization, tree identification, and node self identification.
During bus initialization, the general topology information of the serial bus is identified according to a tree metaphor. For example, each node is identified as being either a "branch" having more than one directly connected neighbor nodes or a "leaf" having only one neighbor node. During tree identification, hierarchical relationships are established between the nodes. For example, one node is designated a "root" node, and the hierarchy of the remaining nodes is established with respect to the relative nearness of a node to the root node. Given two nodes that are connected to one another, the node connected closer to the root is the"parent" node, and the node connected farther from the root is the"child." Nodes connected to the root are the children of the root. The root is defined as not having any parent nodes. During self identification, each node is assigned a bus address and a topology map may be built for the serial bus.
The usual 1394 bus arbitration emulates the "look and feel" of typical bus arbitration. Any node wishing to transmit a data packet posts a request. In turn, the node receives back either a bus grant or bus denial. This method of arbitration is carried out by state machines embodied in all the physical layer ICs which are associated with the nodes. During the self identification process, however, the bus arbitration resembles a token style arbitration. At the outset of the self-identification process, the root node issues an unrequested bus grant. This grant passes down through the network to the target node which sends its self-identification packet in response. Then, as self-identification progresses, the root node issues a new grant which falls to the next target node, and so on. The process continues until all nodes, including the root node, have received a grant and sent their self-identification packets. In this self-identification process, the unrequested grant acts like a metaphorical token. One distinction, however, is that the grant (or token) must be regenerated by the root node (and not by the transmitting node) after each self-identification packet transmission. This differs from other token arbitration schemes (for example, token ring arbitration schemes) where the transmitting node also regenerates the token at the completion of its transmission.
As indicated, the normal P1394 serial bus arbitration resembles other serial bus arbitration in that nodes must first seek access to the bus before transmitting their data packets. It would be desirable to enhance the functionality of a communication system utilizing an P1394 serial bus architecture by implementing a token based arbitration method on such a bus at times other than node self-identification.
It is an object of the present invention to enhance the functionality of a computer system bus in which the nodes of the bus have been resolved into an acyclic directed graph.
This and other objects of the present invention are implemented in a computer system in which the various components of the system are interconnected via nodes on a communications bus. In one embodiment, once the topology of the nodes has been resolved into an acyclic directed graph, and the nodes have gone through an initialization process, the nodes are allowed to arbitrate for control of the bus in accordance with a token passing method. During the arbitration, a metaphorical token is passed through the acyclic directed graph in an order determined by predetermined selection criterion each node has established for selecting adjacent nodes. Provisions can be made for other arbitration methods, such as fair bus access arbitration.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
FIG. 1 shows a node having a number of port connections and coupled to a local host;
FIG. 2 shows a serial bus according to one embodiment;
FIG. 3 shows two nodes connected by a pair of differential signal lines;
FIG. 4 shows a typical bus arbitration scheme for a parallel bus of the prior art;
FIGS. 5a and 5b show typical data packet propagation on a serial bus;
FIG. 5c shows a typical AB line state during transmission;
FIGS. 6a and 6b show the logic states transmitted and received on a node's A pair and B pair for the cases of an arbitration win and an arbitration loss, respectively.
FIG. 7a shows four nodes of a serial bus interconnected to form part of an acyclic directed graph;
FIG. 7b shows the portion of the serial bus from FIG. 7a wherein an arbitration request is propagating through the network;
FIG. 7c shows the completion of the arbitration request begun in FIG. 7b and the beginning of a data transmission through the network;
FIG. 8a shows a typical bus configuration arranged as a daisy chain;
FIG. 8b shows an idealized representation of asynchronous bus traffic;
FIG. 8c shows an idealized representation of isochronous bus traffic;
FIG. 9a shows one serial bus arrangement of token arbitration enabled nodes;
FIG. 9b shows an alternative serial bus arrangement of token arbitration enabled nodes; and
FIGS. 10a-10i show the steps involved in token passing arbitration on a serial bus in one embodiment.
A method and apparatus for implementing token style arbitration on an P1394 serial bus are described. In the following description, many specific details are set forth, such as various computer components, in order to provide a thorough understanding of the present invention. It will be appreciated, however, by those skilled in the art, that the present invention may be practiced without such specific details. In other instances, well known control structures and coding techniques have not been described in detail in order not to unnecessarily obscure the present invention.
Throughout this detailed description, numerous descriptive terms are introduced to provide metaphorical clarity to the description. For example, frequent references will be made to parent-child relationships between nodes in a given topology. The purpose of this is to provide the concept of "direction" to the finally resolved graph. As will be described, once an arbitrary topology has been reduced to an acyclic directed graph, there will be one node identified as the root node. The root node will not have a parent node. All nodes logically immediately adjacent to the root node are the child nodes of the root. The"tree" metaphor is completed by the inclusion of nodes referred to as "branches" and "leaves".
The bus architecture described herein, though described with reference to components for a single computer, in general has a broader scope, and could include test and measurement systems, positioning and robotic systems, and audio and video components, for example. The present invention may be applied to any arbitrarily assembled collection of nodes linked together as in a network of devices. It must also be noted that it is necessary to distinguish a node from a physical computer component. Each component to reside on the bus will have associated with it at least one node physical layer controller. In certain circumstance, a given component may be associated with multiple nodes. Usually, however, there will be a one-to-one correspondence between devices or components on the bus and nodes.
Referring now to FIG. 1, a block diagram of a node 10 is illustrated. The physical implementation of a node is somewhat arbitrary. In the preferred embodiment, the nodes are designed to comply with the IEEE P1394 high performance serial bus communications protocol. The node 10 includes arbitration state machine logic 11. This arbitration state machine logic incorporates all the logic circuitry for carrying out the methodologies and algorithms to be described herein. The circuitry may comprise a programmable logical array (PLA) or be uniquely designed to carry out the functions described herein. Those skilled in the art, once described the functions to be carried out by the node logic, will be able to implement the present invention without undo experimentation. The node, by means of its logic, shall implement the minimum arbitration protocol including the bus initialization, tree identification, and self-identification described above and the bus arbitration functions described in detail below.
The node 10 shown in FIG. 1 also includes transmission multiplexors 12 and 13 and data transmitter, receiver and resynchronizer 14. The node illustrated in FIG. 1 is coupled to local host 15. Local host 15 may, as discussed above, be any device one wishes to attach to the bus, such as a disk drive, CPU, keyboard, or any other component which needs to communicate with other components in the system. The node 10 communicates with other nodes through communications links. A link is a connection between two ports and in immediate practical terms is a cable segment but in general it may be implemented as any physical communication channel. At a minimum, the link is able to provide a half duplex communication channel between the two ports which it connects. A port is the interface between a node and a link. In accordance with the present invention, a port must have the ability to transmit and receive data and arbitration signaling. A port needs to be able to determine whether or not it is connected to another port through a link. One method of facilitating this is by having connected ports apply a biasing voltage through the link which is detectable by the port at the other end of the link. Thus, if a port has a link attached which is not connected to a port at the other end, a so-called naked link, the port will determine that it is not a connected port. In FIG. 1, the illustrated node 10 has three external ports 21, 22 and 23 with connecting links 17, 18 and 19, respectively.
It will be appreciated from above that an individual node may have more than one port. In addition, each node is able to transmit and receive data on any one of its ports. A node is also able to receive and transmit signaling messages through all of its ports. This may occur simultaneously and independently. Separate signaling transceivers, encoders and decoders are thus required for each port of a node. It is conceivable that a node may not have an associated local host device. In such cases, the node may function as a cable repeater. In the discussion which follows, devices and local hosts will, for the most part, be omitted and all references to bus topology will refer to nodes and node connections through various ports.
FIG. 2 shows a typical 1394 bus topology. Eight nodes 10 labeled 0 through 7, are shown interconnected. It will be appreciated by those skilled in the art that the tree structure depicted in FIG. 2 resembles an acyclic directed graph. That is, the bus topology is such that there are no loops, hence the term acyclic. A hierarchical relationship between nodes 0-7 has been established as indicated by the labels "p" and "c" at the ports of the nodes, hence the graph is said to be directed. A "p" at the port of a node 10 indicates that the bus connection is pointing towards the parent of that node. Similarly, a "c" at the port of a node 10 indicates that the bus connection is pointing towards the child of the node. For example, port 2 of node 0 is labeled with a "p". This indicates that the bus connection at port 2 of node 0 points towards the parent of node 0, that is, node 7. Likewise, port 1 of node 7 is labeled with "c", indicating that the bus connection points towards the child of node 7, i.e., node 0. It will further be appreciated that node 7 has become the root node of the graph. This is apparent because node 7 has no parent node. The root node in a 1394 bus is defined as the node with no parent. Node 7 and node 0 are connected through communication link 25. Although all communication links 25 between nodes 0-7 are similarly labeled, it will be appreciated that different physical components, such as cables, optical fibers, wireless couplings, etc., could be used and, therefore, the similarity of labeling reflects the fact that the links carry out similar functions and are not necessarily physically identical.
FIG. 3 more clearly indicates the anatomy of communication link 25. It will be appreciated that the same type of communication link exits between any two nodes, parent and child. Communication link 25 is comprised of two twisted pairs, 27 and 28, although other physical media could be used as discussed above. Each cable carries at least these two pairs, as well as signal ground and, optionally, power. It will be appreciated that communication link 25 could be a single cable comprising six conductors, that is, the two signal pairs and one power pair. As shown in FIG. 3, each port of each node 10 has an A pair and a B pair. Every cable 27 or 28 swaps the A pair and B pair of a parent and child node. By applying a bias voltage to the A pair, and detecting the bias voltage on the B pair, port connect status is sensed. In operation, the A pair of a child node port is coupled via a cable 27 to the B pair of its parent node port. The B pair of a child node port is coupled by a cable 28 to the A pair of its parent node port.
The usual 1394 bus arbitration (so-called fair access bus arbitration) emulates the "look and feel" of typical bus arbitration. FIG. 4 shows a typical non-1394 serial bus arrangement. Nodes 30 are connected to the bus 31. Any node 1 through 6 wishing to transmit a data packet must first request access to the bus. For the example shown in FIG. 4, bus access is controlled by bus arbiter 32. Bus access is typically achieved by a node 30 sending a request signal to bus arbiter 32 on a request line 33. The bus arbiter operates according to an arbitration protocol and will grant access to the bus by sending a grant signal on line 34 to the requesting node. Once the node 30 has received the grant signal, it transmits its data on bus 31.
As indicated above, for the case of a 1394 bus, bus access requests are handled by the arbitration state machine logic of the nodes on the bus. The bus request and grant procedure involves line state signaling which is best understood with reference to the manner in which data packets propagate on a 1394 bus.
FIGS. 5a and 5b show typical data packet propagation. Every data packet on the bus is preceded by a special AB line state: "data prefix". Similarly, data packets are followed by an AB line state which can either be "data end" or another "data prefix". As shown in FIG. 5b, the ending "data prefix" is used when multiple data packets are chained together. Any time a node sees "data prefix" arriving on a port, it forwards the "data prefix" line state out its other ports and readies its receiver circuitry 14. When the data arrives, it is repeated through to the other ports, as is the following line state signal ("data end" or another "data prefix"). It will be appreciated that the "data prefix" must propagate through the nodes as fast or faster than a data packet.
As indicated above, each port for each node has an A pair and B pair. When the bus is idle, both A and B pairs are in high impedance state. During active states, nodes send data out on the B pair and send a strobe signal out on the A pair. As shown in FIG. 5c, the strobe signal is the same as the data signal for even numbered bit times and is the opposite of the data signal for odd numbered bit times. Exclusive ORing the data signal and the strobe signal together generates a receive clock signal.
Before a node can transmit data, however, it must first gain access to the bus. In ordinary operation, a node requests bus access by setting its parent's B pair to a logic 0. To grant access to the bus, the parent replies by setting its child B pair to logic 0. To deny the request, the parent sets its child B pair to a logic 1. This is further described with reference to FIGS. 6a and 6b.
As shown in FIG. 6a, a child node initiates a bus request by setting its parent port B pair to a logic 0. The node's A pair remains in a high impedance state (Z). For the case where the node which has asserted the bus request wins access to the bus, the child's parent node will assert a logic 0 on its B pair. As seen by the child node, however, the 0 will be returned on the child node's A pair. This is because the A and B pairs are swapped in the cable. Recognizing that it has received access to the bus, as indicated by the logic 0 state on its parent port A pair, the child node now sends a data prefix signal by bringing its parent port A pair to a logic 0 and its parent port B pair to a logic 1. Then, the data packet is sent on the B pair and the strobe is sent on the A pair. When the packet has been completed, the child node sends a data end signal by bringing its B pair to logic 0 and A pair to logic 1.
FIG. 6b is a similar line state diagram for the case where the child node loses its attempt to gain access to the bus. The child initiates the bus request by bringing its B pair on the parent port low while the A pair remains in high impedance state. However, this time instead of receiving a logic 0 on its A pair, which would have indicated an arbitration win, the child receives a logic 1 on its A pair. This indicates that the child node is receiving a data prefix which is being transmitted by its parent node. This tells the child node that it has lost its arbitration bid and it configures its receive circuitry 14 to await the data packet. That data packet is then transmitted from the node's parent, followed by the data end signal.
FIGS. 7a, 7b and 7c further illustrate this arbitration process.
In FIG. 7a, four nodes 10, 0-3 are shown. Node 0 is the child of node 1. Nodes 1 and 2 are the children of node 3. Node 3 is the child of a parent node (not shown). In accordance with the above arbitration rules, and as discussed with reference to FIG. 7b and 7c, a bus request is transmitted up through a node's parents towards the root. At the same time, the parent node will assert data prefix on its other child ports so that those nodes will not be able to request bus access.
As shown in FIG. 7b, node 1 has asserted a bus request by sending a logic 0 on its parent port B pair. At the same time, node 1 has sent data prefix (AB=01) out its child port. In response to the data prefix signal, node 0 has configured its receive circuitry accordingly.
The bus request signal from node 1 has been transmitted by node 3 up through its parent port. At the same time, node 3 has asserted data prefix on its child port 3 and node 2 has configured itself accordingly and is ready to receive. In response to the request signal from node 3, a root node (not shown) has sent a bus grant signal which has been transmitted down through node 3's child port 2 to node 1.
In FIG. 7c, node 1 has received the bus grant signal and is now asserting data prefix by setting its parent port B pair to a logic 1. In response, node 3 configures its receive circuitry accordingly and transmits the data prefix signal on up through its parent port. In response to this data prefix signal, other nodes along the bus will prepare their receive circuitry and the data packet to be transmitted by node 1 will be propagated on through the bus. After sending its data, node 1 will send data end and, finally, will set its ports to high impedance. The data prefix (to be followed by the data packet and the data end) is also being sent out by node 1 on its child port.
FIGS. 8a, 8b and 8c provide another illustration of bus traffic on a 1394 bus. This time, as shown in FIG. 8a, the bus has been redrawn in a daisy chain configuration. It will be appreciated that this illustration is being used simply to aid in the understanding of the present discussion and that the daisy chain represents a worst case scenario for transmission of data between the two nodes having the longest communication path between them on the bus. Node A arbitrates for the bus, wins, and then sends a data packet to node B. Node B seizes the bus immediately after receiving the packet and returns an acknowledgment signal ("ack") to node A. It will be appreciated that the transit time for the packet from node A to node B, plus the transit time for the ack signal from node B back to node A is the worse case round trip delay for the network. The 1394 Serial Bus Standard defines a time (TSA) for the network as the sub-action gap. This time is slightly longer than the worse case round trip delay. During normal asynchronous arbitration, nodes may arbitrate for the bus after TSA until they send one data packet. After sending a packet, they cannot arbitrate for the bus again until a longer period of bus idle is detected. This insures arbitration fairness. The longer period of bus idle is called an arbitration reset gap and is roughly twice as long as a sub-action gap.
FIG. 8b shows an idealized representation of bus traffic. A period of bus arbitration is followed by a data packet transmission from one node. Almost immediately following the data packet transmission, an ack packet is sent from the receiving node. This is followed by a sub-action gap after which another arbitration round occurs. The arbitration reset gap is shown as a longer period of time.
In addition to normal asynchronous traffic, 1394 buses can operate in a special mode: isochronous operation. Isochronous mode begins upon receipt of a cycle start packet, typically generated by the root. Importantly, isochronous packets are never acknowledged and bus arbitration may begin as soon as packet transmission is over. When a sub-action gap is detected, this indicates to the nodes on the bus that the isochronous mode is over. That is, it indicates that all nodes with isochronous traffic have completed transmission and ordinary asynchronous operation may resume.
In a typical implementation, a cycle start message is transmitted once every 125 microseconds. This may be delayed as there may be an asynchronous data packet transmission in progress when the time comes for another cycle start message to be transmitted. The cycle start packet includes a field which indicates by how much its transmission was delayed. This allows all nodes in the bus to keep their isochronous timing in sync. In this manner, isochronous and asynchronous operation can coexist on the network without interference.
As an alternative to the fair bus access arbitration scheme found in normal 1394 bus operation, a token passing bus arbitration scheme can be implemented. Metaphorically speaking, token passing bus access refers to the notion that a node may communicate on a bus when it is in possession of token that is passed between nodes (as opposed to having to request bus access and then waiting for a bus grant). The token is passed from node to node in a cyclic fashion so that each node receives the bus in a predetermined point in the cycle. Token passing is implemented for one embodiment following the same manner as physical address bus assignment is carried out when the network is initialized. Each node, when it is assigned a token will propagate its information packet on the bus while the remaining nodes listen. The node will then pass the token to the next logical node based on the predetermined sequencing method. Of course, other methods of token passing could be used and, as further discussed below, not all nodes on the bus need necessarily be token capable.
In order for token passing arbitration operation to occur, a "token master" must be designated. This could be the root node, or it could be some other designated node. The token master will initiate the bus grant to begin token arbitration operation. That is, the metaphorical token to be used will be an unrequested bus grant generated by the token master. The bus grant is propagated through the bus in accordance with the methods described below. Token arbitration will occur until all nodes, or certain designated nodes on a portion of the serial bus, have had a chance to transmit one or more data packets. Then, normal 1394 bus activity could resume until the token master generates another grant. In a non-1394 bus, this token-grant mechanism might be used as the sole means of bus arbitration.
During token arbitration operation, when a node acquires a grant it should take one of the following actions: First, the node could pass the grant down to a child port. For one embodiment, a mechanism is provided to enable or disable passing the grant down on a port-by-port basis, thus delimiting a particular serial bus topology into sections which use token style arbitration and other sections which do not. Second, the node could decline the grant and return it to its parent port. Third, the node could use the grant to transmit one or more data packets. The last data packet transmitted preferably carries with it some encoding to indicate that the grant is being sent back up to the parent node. If the parent node wishes to use the returned grant to transmit a data packet itself, it should delete this encoding as it retransmits the data packet sent by the child node. Details of the encoding for a preferred embodiment will be discussed in detail below.
In token style arbitration, a serial bus node may be able to acquire a grant by one of three mechanisms: First, it could receive a grant on its parent port. For 1394 buses, the grant will be a line state signal, as in the self-id process. Second, it could receive a declined grant back from a child port. Third, after passing a grant down to a child port, it could receive a data packet back from that port with a signal encoded in the data packet indicating that the grant is now being passed back up.
FIGS. 9a and 9b show two possible applications for token arbitration on a 1394 bus. In the example shown in FIG. 9a, an isochronous network subsystem consisting of nodes 6-9 is coupled to the network. The isochronous subsystem could represent a video server, consisting of an array of disc drives. It will be apparent to those skilled in the art, however, that other possible isochronous subsystems could be used.
For the example shown in FIG. 9a, the operational sequence might resemble the following: The network could operate using normal 1394 bus arbitration and asynchronous traffic as described above. When the root node wins an arbitration round, it sends a cycle start message indicating that isochronous operation should commence. The other nodes on the bus would configure their circuitry accordingly. Then, the root, which also happens to be the token master for this example, initiates token operation by sending an unrequested grant down its child port to node 8. At the same time, the root sends a data prefix (bus denial) down its other child ports, which in this example are not enabled for token operation.
The bus grant (or token) drops all the way down to node 6. During this time, nodes 0-5 are prevented from arbitrating for the bus by the presence of the data prefix line signaling state. As a result, nodes 0-5 all go to a receive state and wait for incoming data packets.
With the grant having arrived at node 6, node 6 begins transmitting one or more isochronous packets. These packets are relayed to all nodes on the bus in typical 1394 fashion. The last data packet sent by node 6 will contain token passing encoding, indicating that the grant is being passed up to node 7.
When it receives the packet with token passing encoding, node 7 first removes the encoding from the packet and then retransmits the packet in typical fashion. Then, node 7 begins transmitting one or more of its own isochronous packets. Again, these packets are relayed to all nodes on the bus in normal 1394 fashion. When node 7 transmits its last data packet, the packet contains token passing encoding.
This continues for node 8 and node 9. Since no other nodes are enabled for token arbitration, once node 9 completes transmission of its isochronous packets, token operation for this cycle will end. At that time, node 9 deasserts the data prefix which it has been transmitting to its other child ports and normal isochronous operation continues. Now, nodes 0-5 can perform usual isochronous arbitration until all are done and a sub-action gap finally opens up. As indicated above, when a sub-action gap has been detected, the bus returns to "normal" asynchronous arbitration.
The above described form of arbitration has several advantages. First, it results in minimal isochronous arbitration time for nodes 6, 7, 8, and 9. Second, isochronous data streams from nodes 6-9 will always come in the same order. Also, there would be no timing penalty for a two-port versus a three-port node in token mode. This is because the daisy chain configuration for the token arbitration subsection is just as fast as a multibranching configuration. Further, if node 9 acted as a master node for nodes 6, 7, and 8, so that nodes 6, 7 and 8 never send or receive asynchronous traffic to the network at large, then nodes 6, 7 and 8 would not figure into gap count calculations. From a timing standpoint, they would be "free" and would not count towards the 16 hop maximum for ordinary 1394 operation.
It will be apparent to those skilled in the art that the above scheme will generally still work even if the "token master" is not the root node. In that case, the token master would arbitrate for the bus normally. When it wins the bus, the token master would then pass the grant on down to its token enabled child ports.
The above arbitration scheme could also be made to work for asynchronous transmissions. In a 1394 bus, a node would be able to transmit its packet in token style operation if it had the grant and the last packet was an ack or sub-action gap was detected. For a non-1394 bus, this might be viable general arbitration mechanism, particularly if immediate ack packets were not used.
FIG. 9b illustrates another possible network configuration. In FIG. 9b, the 1394 network consists of two separate clusters of nodes 37 and 38, separated by a long link 35. This long link 35 could be specialized transceivers with a very long cable or a standard 1394 hardware consisting of multiple repeaters and cable segments. An example might be a home theater environment, where one cluster 37 is composed of entertainment equipment such as a television, VCR, audio equipment, etc., and the other cluster 38 is composed of home office equipment such as a personal computer, printer, etc. Although only two clusters are illustrated, the principal could be extended to add additional clusters (say in other areas of the house). This arrangement would operate as follows:
The network begins in normal asynchronous operation. Nodes 4, 5, 6 and 7 arbitrate normally for the bus and send asynchronous packets. Nodes 0, 1, 2 and 3 try to arbitrate for the bus, but the node 3 phy (in token mode on its parent port) never sends the bus requests up.
When node 7 (the root node) detects an arbitration reset gap (i.e., the end of a fair arbitration interval), it drops a token grant down to node 3. Nodes 4, 5, 6 and 7 may now try to arbitrate for the bus, but the node 7 phy will ignore their requests until the grant comes back. Node 3 now acts like a local root for nodes 0, 1, 2 and 3. It grants access to the bus in response to bus requests from its child ports (and from its link IC).
Nodes 0, 1, 2 and 3 arbitrate normally for the bus (with node 3 acting like the root) and send asynchronous packets. When node 3 detects a sub-action gap, which indicates that nodes 0, 1, 2 and 3 have sent all their normal asynchronous traffic for the current fairness interval, it passes the grant back up to node 7. Nodes 0, 1 and 2 do not need to be aware of the token arbitration being used by nodes 7 and 3. This assumes the implementation includes ack accelerated arbitration--where nodes may begin asynchronous arbitration immediately after detecting an ack packet. This eliminates unnecessary subaction gaps.
When it receives the grant back from node 3, node 7 resumes its "rootship". Now, nodes 4, 5, 6 and 7 arbitrate normally for the bus and send asynchronous packets.
In the above example, mixed asynchronous and isochronous operation could occur. In such a case, node 7 (acting as the root) will send a cycle start message, shifting the entire bus into isochronous mode. Nodes 4, 5, 6 and 7 arbitrate for the bus and send isochronous packets. Nodes 0, 1, 2 and 3 may try to arbitrate for the bus, but the node 3 phy will not pass their requests up.
When node 7 detects a "local" sub-action gap, indicating that all nodes in the local cluster 37 have completed their isochronous transmissions, node 7 drops a token grant down to node 3. It should be noted that the local sub-action gap is based on timing considerations of the local cluster 37 only (i.e., the timing requirements of the long link 35 and the nodes which make up cluster 38 need not be considered). This shorter time-out can be used for isochronous mode because there are no ack packets.
When node 3 receives the token grant, nodes 0, 1, 2 and 3 now arbitrate normally for the bus with node 3 acting as a local root. These nodes send their isochronous traffic in the fashion described above. Eventually, node 3 detects its own "local" sub-action gap. It now checks the status of an asynchronous root bit. If set, node 3 retains rootship and nodes 0, 1, 2 and 3 begin asynchronous arbitration. If the asynchronous root bit is clear, node 3 returns the grant to node 7. The asynchronous root bit provides an indication of "who was root" before the isochronous traffic interrupted the asynchronous operation.
For the case where the asynchronous root bit is set, asynchronous arbitration with node 3 acting as root proceeds. If node 3 detects a sub-action gap, indicating that all asynchronous traffic has been sent from its local nodes 0-3 for this fairness interval, then it clears its asynchronous root bit and returns the grant to node 7. Alternatively, if node 3 detects a cycle start time, it returns the grant to node 7, without clearing its asynchronous root bit. This means that node 3, the acting root, must also keep track of the cycle start time. Node 7 then resumes rootship and its local cluster 37 resumes normal asynchronous arbitration until node 7 sends another cycle start message.
For the case where the asynchronous root bit is not set, node 3 would return the token grant to node 7. Then, nodes 4, 5, 6 and 7 would arbitrate for the bus normally, with node 7 as the root, and send asynchronous packets. If node 7 detects an arbitration reset gap, it drops the token grant down to node 3. This causes node 3 to set its asynchronous root bit, and node 0, 1, 2 and 3 begin asynchronous arbitration. Alternatively, node 7 may send out a new cycle start message, which restarts this whole process.
One advantage of this "root sharing" token arbitration is bandwidth. For the case where the long link 35 adds a delay on the order of a few microseconds or more (one microsecond being roughly 200 meters of cable or 6 repeaters for a 1394 bus), then the arbitration time for nodes in distant clusters begins to get significant. This problem is solved through the use of token arbitration.
Details of the bit encoding for 1394 bus token arbitration are now provided. It will be appreciated that similar encoding details can be implemented for token arbitration on a non-1394 serial bus. Ending a data transmission on the 1394 bus requires sending extra bits. These extra bits are known as "dribble bits". In short, there are two extra bits tacked on the end of a 100 Mbit packet, 4 for a 200 Mbit packet and 8 for a 400 Mbit packet. Of these dribble bits, the last two are specified to be both zeros for a "data end" (normal packet termination), or both ones for a "data prefix" (used to concatenate additional packets). The other dribble bits in the case of a 200 and 400 Mbit packet are always ones.
The last (or ultimate) dribble bit must be exactly as specified by the P1394 standard. Changing it to the opposite state would add one extra receive clock edge, as well as miscuing the hardware on whether data end or data prefix is intended. Such an error would be detrimental to operation of the bus.
The penultimate (or next to last) dribble bit has no such constraint. Advantageously, it is not simply relayed from phy to phy; it must be regenerated by each phy.
The penultimate bit, then, can be used for token passing. In one embodiment, for a child node passing a token up to its parent, if the last bit is a 1 (i.e., a data prefix, implying a concatenated packet will follow), then the penultimate bit is ignored. If the last bit is a zero (data end), the penultimate bit will indicate whether or not the token is being passed. In a preferred embodiment, the penultimate bit will be set to a 1 to indicate that the token is being passed up. Having the penultimate bit set to 0 indicates that the token is not being passed up. The reverse implementation could also be used.
Token passing downward from a parent to a child in a preferred embodiment is done with the line state signal token grant AB=Z0. Token passing upward from a child to a parent may be done with a line state signal token return AB=Z0 or by penultimate bit encoding. For systems where the token is being passed up a daisy chain of nodes (e.g., nodes 6-9 in FIG. 9a), the penultimate bit encoding is particularly efficient. When a parent node receives a packet from a child node with the last two bits set to 10 (token being passed, data end), then it can relay the packet on through the network with the last two bits set to:
00 (no token, data end) if it wants to send its own isochronous packets;
10 (token passed, data end) if it has no isochronous packets to send; or
01 (no token, data prefix) if it wants to concatenate its isochronous packets
onto the preceding one. This re-encoding of the last two data bits can be done on-the-fly.
FIGS. 10a-10i further illustrate the token passing arbitration. For the example shown, only isochronous data transmission is discussed and it is assumed that the root node also acts as the token master. Upon review of these details, however, it will be apparent to those skilled in the art that similar implementation can be used for other cases.
FIG. 10a shows the initial state. As indicated, each port of each node has a new status bit: te (token enable), which enables token operation on that port. All nodes also have a TPA bit (token protocol active), which is set when the cycle start packet is transmitted (in the case of the root) or received (in the case of all other nodes). A node clears its TPA bit when it returns the token grant. If a node has no ports with te set, then it never sets its TPA bit.
At start up, for the example shown in FIGS. 10a-10i, the root has te set for one child port only. It will be appreciated that these te bits could be set by software, by hardware jumpers, etc., techniques well known in the art.
The root node is indicated by the numeral 40. The other nodes 42-46 in this token arbitration branch have their te bits set on all ports. The "Other Nodes" (not shown) have their te bits all cleared. These nodes may be normal 1394 nodes without token arbitration cognizance.
In operation, the nodes could use standard 1394 arbitration for asynchronous traffic. The switch to token arbitration would come when the root 40 sends out the cycle start packet, which causes all token enabled nodes 42, 44 and 46, to set their TPA bits.
FIG. 10b shows what happens next. The cycle start packet has been sent and nodes 40-46 have set their respective TPA bits accordingly. The root 40 drops a token grant (AB=Z0) to its lowest numbered token enabled port and sends data prefix (AB=01) out its other ports.
Then, as shown in FIG. 10c, node 2 (42) passes the grant on down to its lowest numbered token enabled child port (i.e., to node 0 (44)).
FIG. 10d shows that node 0 (44), which has isochronous packets ready to send, detects the grant transmitted by node 2 (42) and begins packet transmission by sending data prefix (AB=01) out its parent port. This data prefix will be retransmitted by node 2 (42) in the typical fashion. Node 0 (44) then sends data packets in the normal 1394 transmission fashion.
If multiple isochronous packets are transmitted by node 0, bandwidth will be conserved if they are concatenated together. The last packet terminates normally with data end (AB=10). The token is then passed back up from node 0 (44) to node 2 (42) using penultimate bit token passing as discussed above. As shown in FIG. 10e, node 0 (44) then clears its TPA bit.
In response to receiving the token grant back from node 0 (44), node 2 (42) now drops the token grant to node 1 (46), as shown in FIG. 10e. All this time, the root 40 continues to output data prefix (AB=01) to ports not enabled for token arbitration. This insures that other nodes cannot possibly detect a sub-action gap while the token protocol plays out.
As shown in FIG. 10f, node 1 (46) has detected the grant from node 2 (42), however, node 1 (46) has no isochronous packets to send. Node 1 (46) therefore wishes to return the grant. One possible implementation for this would be to have node 1 (46) send a null packet, i.e., data prefix-data end. Although this would work, the null packet would propagate throughout the bus and simply waste bandwidth. A more efficient mechanism is for node 1 (46) to return the grant with the grant return signal AB=Z0 as shown in FIG. 10f. While token grant and grant return are both present on the interface, both nodes 1 (46) and 2 (42) detect AB=00. When a node returns the grant, either by penultimate bit signaling, or by this grant return, it clears its TPA bit as shown.
As shown in FIG. 10g, node 2 (42) detects the grant return and now transmits its own isochronous packets, starting with data prefix (AB=01). Node 1 (46) can detect data prefix even if it is still sending grant return as shown.
Referring now to FIG. 10h, node 2 (42) sends its isochronous packets in the normal fashion. Note that if node 2 (42) had no isochronous packets to send, it could send grant return (AB=Z0) on its parent port. In FIG. 10h, node 2 (42) has sent its last packet, passed the token back up with penultimate bit token passing, and has cleared its TPA bit. The root 40 has already recognized the return of the token, and has started putting out data prefix. It will next transmit its isochronous packets in the typical fashion.
Referring now to FIG. 10i, when the root 40 has completed its isochronous transmission, it clears its TPA bit and returns to standard 1394 arbitration.
Thus, a novel method of token arbitration operation on the 1394 bus has been described. Although the present invention has been described in terms of preferred embodiments, it will be appreciated that various modifications and alterations might be made by those skilled in the art without departing from the spirit and scope of the invention. The invention should, therefore, be measured only in terms of the claims which follow.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
FMLY Fest assembles dozens of musicians for DIY weekend
By Emily Eveland
Hollow Boys embrace the dark on third album
By Sarah Stanley-Ayre
10 Thousand Sounds 2014: Behind the bands
By CP Staff
Black Market Brass delivers hip-shaking funk rhythms
By Zach McCormick
For the Love brings hip-hop festivities to Lowertown
By Jack Spencer
Kitty Cat Klub hosts Tourniquet Noise series
By Sarah Stanley-Ayre
Max Gremillion steps into the spotlight
By Rob van Alstyne
The world of Howler's sophomore album
By Zach McCormick
Genre be damned: Whitesand/Badlands are a rock back with a solid core. With a drum intro that segues into a near-post-rock ambience, Whitesand/Badlands kick off their first official release. By the time Andy Larson takes the microphone, "Blank Czech" has already solidified itself as a piece of spacey rock too focused for shoegaze and too eerie for post-punk; think what might happen if Fugazi shifted attention away from the guitar. "Blank Czech" progresses and expands, hitting its grooves only to shift away before settling on a melody in the final minute. Sure, there are vocals, but they're far from the central point of the song. On "Humans #1," the three guitarists play off one another while Larson offers a steady harmony to keep the song moving forward. When Casey Holmgren's bass kicks off the chord progression, the song builds like waves on an ocean. Instead of a final crash, though, the waves rebound, retaining the wall of guitars but with Katie Grillaert commandeering the microphone as the song deconstructs in a noisy climax.
The members of this band have changed, and their first release is an adequate reflection of this, with the A-side featuring Holly Habstritt's piano and voice, and Ryan Parsons on drums. Side B represents the current incarnation with the addition of Grillaert and Steve Earnest on guitars and Adam Patterson taking over behind the kit, while Holmgren and Larson hold down the lineup throughout. Regardless of the musicians, the band maintains a consistent sound that makes for a surprisingly cohesive and promising debut.
501 Washington Ave. S.
Minneapolis, MN 55415
Category: Bars and Clubs
Region: Minneapolis (Downtown)
Blank Czech/Humans, #1
WHITESAND/BADLANDS play a 7-inch release show with Tips 4 Twat and Blackcloud Stallionheart on FRIDAY, APRIL 16, at the 501 CLUB; 612.338.3848
Sponsor Content

subset: commoncrawl


text:
- 800.878.7323
This item may be
Check for Availability
This title in other editions
Being Generous: The Art of Right Livingby Lucinda Vardey
Synopses & Reviews
Publisher Comments:
This extraordinary little book has the power to heal and foster relationships, console and empower individuals, create community and help save the world by providing a spiritual ecology for our daily lives.
Think that's a bold claim? It is, but it's also true. We can all be generous with our money when an occasion like Christmas rolls around, or when disaster strikes as it did with the Boxing Day tsunami of 2004. But Lucinda Vardey and John Dalla Costa say that this kind of giving segregates generosity, and makes it a special activity only for special times. If we're truly going to help this troubled world, as individuals we must investigate other possibilities for being generous as well, by helping those we interact with every day: our children, colleagues, parents, friends and the homeless men and women we encounter when out and about in our cities. We learn that the four most generous words in the English language are "I'm sorry" and "Thank you." We learn that if we ask, "What do you need?" we may be surprised how readily we can provide assistance, and how a single generous act may turn into something that circulates to include many.
Lucinda and John are a married couple who have committed–they say "humbly and imperfectly"–to making generosity a central practice in their daily lives. What they refer to as their art of right living, within family, work and community, is both a mode of being and a value that infiltrates all others. Generosity inspires and guides them, and continually tests and teaches them. This book is filled with true stories they've collected about generosity in action. Being Generous is their gift to readers, written to enable and encourage us to follow the generous way.
She was famous for her work with the poor in the streets of Calcutta. One day a beggar by the road ran up to her with a small coin–financially worthless to anyone but him. It was his day's take on a long, hot and humid day, and he wanted to give it to her. She pondered what to do. If she took the money then he would have nothing at all, but if she rejected him, it would not only hurt him but insult his generosity. She stretched out her hand–he, who never had the chance to give, could give to Mother Teresa. The joy on his face said everything to her.
The Lesson: Saying no to another's offer denies them the joy of giving. Accepting what they wish to give–even if you don't need it–is what practising true generosity is about.
—from Being Generous
From the Hardcover edition.
About the Author
Lucinda Vardey is the author/editor of God in All Worlds: An Anthology of Contemporary Spiritual Writing; The Flowering of the Soul: A Book of Prayers by Women; Traveling with the Saints in Italy: Contemporary Pilgrimages on Ancient Paths; and the New York Times bestseller A Simple Path with Mother Teresa of Calcutta. She divides her time between Toronto and Tuscany, where she runs a spiritual retreat.
John Dalla Costa is an author, consultant and speaker, and the founding director of the Centre for Ethical Orientation (CEO) in Toronto. He is the author of four books, including most recently Magnificence at Work: Living Faith in Business. He is also the author of The Ethical Imperative, which was published internationally, and the bestselling Working Wisdom.
From the Hardcover edition.
What Our Readers Are Saying
Be the first to add a comment for a chance to win!
Product Details
Related Subjects
Health and Self-Help » Psychology » General


text:
Autism and Communication Center - Olney, MD
Olney Developmental-Behavioral Pediatrician Doctors for Autism and Communication
Type of Physician: Developmental-Behavioral Pediatrician
What is a Developmental-Behavioral Pediatrician?
A subspecialty certification by the Board of Pediatrics; practitioners have a special interest in the developmental, learning, and behavioral problems of children, and in the support of parents and children during normal development and illness.
Specialty: Developmental-Behavioral Pediatrics
Common Name:
Developmental-Behavioral Pediatrician Doctors in Olney *
Children First Pediatrics
Daniel G Shapiro MD
Pediatric Care Center
Benjamin E Bronheim MD PC
Children's National Med Cen PED
Michael E Sherlock MD
Olney, Maryland
Autism Spectrum Disorder (In Children and Adults)
Autism facts
Read the Autism Spectrum Disorder (In Children and Adults) article »
Other Related Autism and Communication Articles
Emergency Contact for Olney
Nearby Olney Hospitals *
Montgomery General Hospital
Adventist Behavioral Health
Adventist Rehab Of Maryland
Shady Grove Adventist Hospital
Holy Cross Hospital
NIH Clinical Center
Walter Reed Ntnl Mltry Med Ctr
Howard County General Hospital
Suburban Hospital
Laurel Regional Hospital
Saint Luke Institute
Washington Adventist Hospital
King Health Center
Psychiatric Institute
Clifton T Perkins Center
Providence Hospital
Sibley Memorial Hospital
The HSC Pediatric Center
Seton House Providence Hospital
Medstar National Rehab Hospital
Washington DC VA Medical Center
Washington Hospital Center
Children's National Medical Ctr
Doctors Community Hospital
Howard University Hospital
Georgetown University Hospital
Sheppard Pratt Ellicott City
Prince George's Hospital Center
George Washington Univ Hosp
Springfield Hospital Center
Halquist Memorial Inpatient Ctr
Specialty Hospital Washington
Virginia Hospital Center
Dominion Hospital
Spring Grove Hospital Center
Reston Hospital Center
Northwest Hospital Center
Regional Institute For Children
Saint Elizabeths Hospital
Inova Fairfax Hospital
Northern Virginia Mental Health
Kernan Hospital
United Medical Center
Inova Loudoun Hospital
Inova Alexandria Hospital
Mountain Manor Treatment Center
Speciality Hosp Of WA-Hadley
Saint Agnes Hospital
Baltimore Washington Med Center
Bon Secours Baltimore Hlth Sys
Inova Fair Oaks Hospital
Malcolm Grow Med Ctr 79Th
Medstar Harbor Hospital
Baltimore VA Medical Center
North Spring Behavioral Hlthcar
University Maryland Medical Ctr
Levindale Hebrew Hospital
Sinai Hospital Of Baltimore
Maryland General Hospital
Kimmel Cancer Ctr Johns Hopkins
Mercy Medical Center
Frederick Memorial Hospital
Mt Washington Pediatric Hosp
Metropolitan Transition Center
Kennedy Krieger Institute
Medstar Union Memorial Hospital
John Hopkins Hospital
Grafton Intergrated Health Net
Inova Mount Vernon Hospital
Carroll Hospital Center
Sheppard Pratt Hospital
Greater Baltimore Medical Ctr
Johns Hopkins Bayview Med Ctr
Fort Washington Medical Center
Good Samaritan Hospital
*Provider Directory Terms of Use:
The WebMD 'Provider Directory' is provided by WebMD for use by the general public as a quick reference of information about Providers. The Provider Directory is not intended as a tool for verifying the credentials, qualifications, or abilities of any Provider contained therein. Inclusion in the Provider Directory does not imply recommendation or endorsement nor does omission in the Provider Directory imply WebMD disapproval.


text:
Meet Dave, the Hockey-Watching Cat
What can you say about a cat who watches TV? Meet Dave. Dave likes watching hockey. That's better than my cat Lily, who likes Downton Abbey.
What can you say about a cat who watches TV? Meet Dave. Dave likes watching hockey. That's better than my cat Lily, who likes Downton Abbey.
The public has spoken and Monopoly will cast away the boring old iron token, a symbol of domestic housework from a simpler time (it's not even an electric iron), which has been included in the board game for almost 80 years.
In its place will be a cat. Hey, are you really that surprised? The internet loves cats.
There's no sense in denying cats can be a little sassy from time to time, simply because they're not afraid to make it totally obvious they hate something. Costumes? Check. Reindeer antlers? Double check. Their 'tude doesn't make them any less adorable, though! It's sort of charming, actually.
We first introduced you to the phenomenon that is dogs with eyebrows a few weeks back. It's hilarious stuff for the simple reason that animals just don't belong with human 'brows. But while they might not belong together, animals sporting little forehead caterpillars is straight up hysterical.
Cat videos are the best. There's certainly no shortage of them on the web, and that means hours fun wasting valuable company time. Here's a cat that likes to go for a ride on a sheep, and a sheep the apparently could care less.
Usually by mid-January we're all sick of snow, but it's magically fun again after seeing it through the eyes of a critter who's never set foot in snow before.
Let's just admit the internet exists for cats. Not scientific research. Cats. Fortunately for us, 13 of the internet's most famous cats are teaming up ... to raise money for charity. We know -- we were a little concerned it might be a "kill all the humans"-style takeover of Earth too. We're getting off easy this time -- all they want us to do is buy a deck of cards!
All good things must come to an end, and so it is with the 2012 TheFW Awards. Reigning supreme in Best Cat Video, the most important category (according to some) is Henri the Existential Cat. Once you watch the video it's pretty obvious why.
Cats are obviously cute, but kitties can also be feisty little buggers. Truthfully, we can't really blame them given the fact that they're forced to dress up in chic couture and submit themselves to our crazy holiday antics. Come on, it's all in good fun! But now those felines are ready to fight back with-- wait for it-- karate.
In his book 'A Random Walk Through Wall Street,' economist Burton Malkiel famously declared that "a blindfolded monkey throwing darts" would able to pick stocks just as well as the professionals.
His theory has been tested over the years, with mixed results. But new evidence out of England suggests that it is cats, not monkeys, that all money managers should be measured against.
Technology can be really confusing sometimes. Take the Roomba, for example. It's a vacuum that basically does all the work on its own, cleaning the floor at the click of a button. While we're not entirely sure how the whole thing works, there is one hilarious thing that comes out of the invention-- babies and cats love riding them.


text:
- Introduction
- Key Events from the Beijing 2008 Olympic Games
- 2008 Olympic Games Final Medal Rankings
- China and the Olympics
- History of the Olympic Games
- Backstories
- IOC Country Codes
- Picture Gallery
Věra Čáslavská: Out of Hiding, 1968 Olympic Games
Prior to the 1968 Olympic Games in Mexico City, Věra Čáslavská of Czechoslovakia had already established a reputation as one of the most graceful and accomplished gymnasts the world has ever known. At the 1964 Tokyo Games she swept up three gold medals, including the all-around title, and at the 1965 and 1967 gymnastics European championships she won every event.
Čáslavská will be best remembered, however, for her performance in Mexico City and the courage she showed in the months leading up to the Games. In June 1968 she signed the "
Two Thousand Words," a document that called for more rapid progress toward real democracy in Czechoslovakia. After Soviet tanks entered Prague in August of that year, Čáslavská, facing possible arrest for her political stance, fled to the mountain village of Šumperk. There she had only the open fields and dense forests in which to train. She was granted permission to rejoin the Olympic team only a few weeks before the Games. Her patriotic devotion won the admiration of her fellow Czechoslovakians but also ensured that these Games would be the last time she would ever compete in gymnastics.
Čáslavská dominated the gymnastics competition in Mexico City, winning gold medals in the individual all-around, the vault, the uneven bars, and floor exercises and silver medals in the balance beam and team competition. The crowd went wild when she performed her floor exercises to the tune of "
The Mexican Hat Dance." There were rumors of suspicious judging when Soviet gymnast Larissa Petrik tied with Čáslavská for first place in that competition, and during the medal ceremony Čáslavská reportedly lowered her head and turned away when the Soviet anthem was played.
The day after winning her last gold medal, Čáslavská capped her glorious Olympic career by marrying Josef Odložil, a Czechoslovakian middle-distance runner who had won a silver medal in the 1,500-metre race at the 1964 Olympics (he also competed in the 1968 Olympics).
Upon her return to Prague, Čáslavská was refused employment, and her autobiography was deemed unprintable by the authorities (a heavily edited version was later published in Japan). She was eventually allowed to coach the national gymnastics team. After the collapse of communist rule in 1989, Čáslavská became president of the Czechoslovakian Olympic Committee. She was named president of the Czech Olympic Committee in 1993 and became a member of the IOC in 1995.
Kip Keino: A Father of Kenya, 1968 Olympic Games
Kipchoge (Kip) Keino's superhuman efforts and determination at the 1968 Olympic Games in Mexico City were far more inspiring than the gold and silver medals he won. Keino, now one of Kenya's most beloved national heroes, was suffering from severe abdominal pains (later attributed to gallbladder problems) when he arrived in Mexico City. Doctors warned him of the dangers of running with his condition, but Keino was not to be deterred. He competed in six distance races in eight days, tough for any healthy athlete let alone one suffering from stomach ailments.
Keino, a goatherd and policeman, had been running competitively since age 13 without any substantial support or formal training. Yet he loved to run, and he was able to establish himself as one of the medal favorites heading into Mexico City. In his first final—the 10,000 metres—the Kenyan's stomach pains became unbearable, and he collapsed on the infield with just two laps to go. In the 5,000-metre final, Keino earned a silver medal, finishing just 0.2 second behind Tunisian Mohammed Gammoudi.
On the day of the 1,500-metre race, the doctors had ordered Keino not to run. At first he agreed to stay in the Olympic Village but changed his mind as the start time grew near. Adding to his troubles, Keino became stuck in a traffic jam and had to jog the last mile to the track. In the 1,500 Keino faced race favorite Jim Ryun of the United States. Despite his stomach pains, Keino set a furious pace over the last laps of the race, negating Ryun's powerful finishing kick. Keino won the race by 20 metres.
On that same day, back in Kenya, Keino's wife gave birth to their third daughter, Milka Olympia Chelagat, named in tribute to her father's wondrous Olympic performance. Over the years, Keino and his wife have taken in more than 100 children, and they have seven of their own. Many Kenyans have named their offspring after this beloved hero and father of so many orphaned children. Keino is currently president of the Kenyan national Olympic committee.


text:
Affluent Lifestyle Guide
You might like Best Runway Models >
Zagato and Maserati have enjoyed a fruitful relationship for a long time and at this year's Concorso d'Eleganza Villa d'Este, they will be celebrating with the preview of their new Mostro. Paying tribute to the 1957 Maserati 450 S Coupé—as well as Masterati's 100-year anniversary—the gorgeous Mostro looks like a dream come true.
In the coolest real estate news of the week, Regina George's $14.8 million home has hit the market courtesy of Sotheby's International Realty. Located in Toronto, the 20,000-square-foot property was infamously home to the Mean Girls Queen Bee—you know, the girl John Stamos thought was pretty. You may remember spotting the mansion when Regina (played by Rachel McAdams) invited new girl Cady Heron (Lindsay Lohan) over after school—it's also when we met Amy Poehler as the eternal "cool mom."
There may be a large gender divide in many workplaces, but in the realm of wine, women have been steadily rising to the top. Not only do female consumers outweigh that of men, the number of female winemakers and sommeliers continue to rise every year. There are probably countless reasons as to why women are reigning supreme on the vineyard, but we'll leave reasoning to the 10 talented ladies we recently spoke with. From California to Italy, from winemakers to sommeliers, these women's stories are funny, touching, kismet, and inspirational. Plus, their favorite wines make a pretty amazing shopping list.
The Alfa Romeo 4C Spider has been getting some pretty positive reviews and we aren't really surprised. Starting at £59,500 ($93,177), the luxury two-seater is a definite improvement from the coupé, with its pumped up sound system and bespoke perks—not to mention the removable roof and sculpted lines. Similar to the coupé, the Italian Spider boasts a turbocharged 1.7-liter, four-cylinder engine that offers 237hp and 258 lb-ft of torque. The power under the hood rockets the stylish car from zero to 62mph in just 4.5 seconds, reaching a top speed of 155mph.
The 68th Cannes Film Festival is well underway and aside from the bizarre high heel controversy, it's been going pretty well. The famed festival that has been known to debut some of the most beloved films has a pretty impressive list of contenders this year that are all hoping to come out on top, including Cate Blanchett's Carol, and Macbeth starring Michael Fassbender and Marion Cotillard. As much as the festival has the ability to launch films to stardom, it also has the ability to tear it into little confetti-sized pieces of ridicule.
Beneteau's new Sense line of cruising sailboats are sounding pretty tempting in the above video, which focuses specifically on the Sense 50'. Ranging from 43 to 55 feet, the vessel collection seems ideal for family outings, promising that only a small crew is needed to handle them.
If you have someone in your life who has led a life beyond compare, gifting them their very own autobiography is a pretty brilliant idea. Whether it's your parents, your siblings, a friend or even yourself, we all have so many amazing stories to share and with Lifebook's ghost-written autobiographies, they won't be forgotten.
After a recent, mind-blowing meal at Napa gastropub newbie, Atlas Social (the latest offering from local restaurateur tag team, Michael Gyetvan and his wife, Christina), I knew I had to score an interview with Chef Nick Ritchie. Ritchie totally knocked my Manolo Blahniks off with his innovative menu that offers many "they may be small, but they're packing humongous flavor" plates.
Stories popularized by Disney have always been trendy, but in recent years they have taken hold of the public due to a slew of Hollywood adaptations and remakes. Television has Once Upon a Time, while the big screen has seen way too many to list, with Cinderella and Into the Woods (okay, so this is a musical in of itself, but people are most familiar with some of the characters thanks to Walt) being the most recent.
If you've been holding off on investing in a Miami Beach property until you found the perfect one, L'Atelier Residences may be your answer. Planned to include 20 luxury homes that will be priced from $4.3 to $33 million, the building is being created on the lot of the former Golden Sands Hotel in a joint venture between Roy E. Disney, SMG Management, and W Capital Ground.
Rolls-Royce has done it again, this time customizing a bespoke Phantom into a tranquil Japanese tea garden. Called Serenity, the $1 million auto's exterior is painted a specially-mixed Mother of Pearl color that was polished for 12 hours, while the interior is swathed in a gorgeous handwoven upholstery that was made from 33 feet of hand-dyed silk.
As a reminder that iPhones aren't the only smartphone options out there, the Harman Kardon One is an adorably tiny Bluetooth speaker designed for Sprint's HTC One M9. As you can see in the above video, the £129 ($203) H/K One is pretty compact and has HTC Connect tech inside, which enables the gadget to sync up easily with an HTC phone.
Finding the best in luxury can be a daunting task, which is why we've taken it on for you.
Meet Some of the Top Minds in the Affluent World


text:
536 comments found
This theme appears to be incompatible with the new CSS styles in WooCommerce 2.1.X. There are significant differences between the demo content and my live website at the product level. Compare buttons, accordions, and tabs here:http://themeforest.net/item/vintagestyle-responsive-ecommerce-theme/full_screen_preview/3187020
And here:http://candlemakersbg.com/shop/black-leather-berry/
Any help in resolving these discrepancies would be greatly appreciated.
Hi. That's why it is stated that the theme is compatible with woocommerce 2.0.x. Right now, we're working with the update and trying to solve this compatibility issue. Will let you know once the update is done. Regards.
Thank you, for your reply. I am looking forward to seeing your updates!
Sure. Thank you.
Also having the problem with CSS styles using WooCommerce 2.1.2. Buttons and tabs are not working properly.
I installed a test site using demo info to try and debug it to no avail. http://www.splendidiris.com/vin/product/contrast-sole-suede-derby-shoes/
When you import demo info, was it all successful?
Yup. Did not report any errors. I went ahead and created another installation on the same website (different directory) to reinstall the theme and WooCommerce 2.0.2 and everything works fine. Something with the theme not working correctly with WooCommerce 2.1.2
OK, so it's obviously the compatibility issue with Woocommerce 2.1.x. I'll let you know once the update is done. Thanks.
5months. Any updates yet?!
Great theme! Just a quick question…
In the Recent News shortcode…
Is it possible to exclude a specific category from being displayed in this section? I'd like to exclude specific posts from being listed in the Recent News section.
Following on from this, are you also able to advise how I sign up to the Support forum? It doesn't look like there's a Sign Up functionality on the Hanathemes site… Thank you.
Hi, This is the second time I have had a go at purchasing this theme, I got a refund last time because it took too long to get support- please don't let my trust be dashed again.
On the site I'm building http://www.oshi.co.nz the flex carousel products are not displaying correctly. The photos are showing in two rows instead of changing on hover.
I am using the updated vintage2 download. Can you please help ASAP, as I need this website operational yesterday, so to speak.
Any word on when the theme will be compatible with the current version of WooCommerce?
When will the theme be updated to be compatible with WooCommerce 2.0.20? Thank you.
Hello, I have purchased the theme and have had a problem with the shop for some time,when will the theme be compatible with the current version of WooCommerce? I cannot figure out how to solve the problem myself. Please reply as soon as possible as it this is a urgent problem of me now. Thanks
I am having trouble with coupons in WooCommerce. I am trying to set-up a 15% off sale on all products but can't get it to work.
I am running:
WordPress v. 3.5.1
WooCommerce v. 1.6.6
WordPress Theme VintageStyle v. 1.0.2
I have clicked the box to enable coupons and set-up a 15% off coupon but it's not taking a discount off the products or the cart. I see where I can add the coupon code field but there is no place to configure a coupon code. Please help as soon as possible!!!
Thank you!
I've a problem on my website homepage http://www.neckplusultra.fr : the product grid is not centered properly. Do you know how to fix this ?
Thanks a lot
we gonna update the theme. you can get it after and we can fully help you. many thanks.
Hi, The pop-up cart preview that is suppose to show up when i add an item to the cart isn't showing. Can you please help?
Thank you. The website is TheConcreteRunway.com.
yes, we can help you. but we gonna update the theme. maybe you can get a new theme and we can help you after it. Thanks.
I have been using this theme for a while, and have found that the issue with the media uploader/link editor is not resolved. If I set 2012 as the theme, it resolves, going back to VintageStyle, it breaks again.
I've just uploaded the latest theme version, and am wondering if this issue was ever addressed?
Hi Can I check on your site?give me access details on pm. Thanks.
7 Months later?! Do we have an update yet to work with the current version of WooCommerece?!


text:
In vitro Anti-Toxoplasma gondii Activity of Root Extract/Fractions of Eurycoma longifolia Jack
1 Institute for Research in Molecular Medicine (INFORMM), Universiti Sains Malaysia, 11800 USM, Pulau Pinang, Malaysia
2 School of Pharmaceutical Sciences, Universiti Sains Malaysia, USM 11800, Pulau Pinang, Malaysia
BMC Complementary and Alternative Medicine 2012, 12:91 doi:10.1186/1472-6882-12-91Published: 10 July 2012
Toxoplasma gondii infection causes toxoplasmosis, an infectious disease with worldwide prevalence. The limited efficiency of drugs against this infection, their side effects and the potential appearance of resistant strains make the search of novel drugs an essential need. We examined Eurycoma longifolia root extract and fractions as potential sources of new compounds with high activity and low toxicity. The main goal of this study was to investigate the anti-T. gondii activity of crude extract (TACME) and four fractions (TAF 273, TAF 355, TAF 191 and TAF 401) from E. longifolia, with clindamycin as the positive control.
In vitro toxoplasmacidal evaluation was performed using Vero cells as host for T. gondii. Light microscopy technique was used to study in situ antiparasitic activity.
Significant anti-T. gondii activity was observed with clindamycin (EC50 = 0.016 μg/ml), follow by TAF 355 (EC50 = 0.369 μg/ml) and TAF 401 (EC50 = 0.882 μg/ml). Light microscopy revealed that most Vero cells were infected after 3 h of exposure to T. gondii. After 36 h of exposure to the E. longifolia fraction, the host Vero cells showed no visible intracellular parasite and no remarkable morphological changes.
Our study demonstrated that TAF 355 and TAF401 fractions may be the sources of new anti-T. gondii compounds.


text:
Your email has been sent.
Restoring Parenting Sanity
While Colbert and Stewart face off in D.C., parents, too, hover between sanity and fear
This weekend, Jon Stewart and Stephen Colbert will hold dual rallies in Washington. Stewart's is billed as the Rally to Restore Sanity; Colbert's as the March to Keep Fear Alive.
Parents, I think, face these two dueling forces every day. Sometimes these voices come from inside us; sometimes they come from the media and the parents around us.
Any parent who's visited a playground recently has met a Keep Fear Alive parent. She's the one who'll sidle up to us, narrow her eyes, and say, "Are you sure you want to eat that? No, I'm just asking. I definitely don't want you to second-guess yourself or be anxious in any way! Because stress can cause headaches, lack of focus, short temper, back pain, menstrual problems, acne, obesity, and forgetfulness. And if you're stressed you might be unable to calculate the digits of pi past the first 23 places, which would really screw up your next homeschool math session! Wait, you don't homeschool? Wow. Um, wow. Well, I'm sure your children go to the top-of-the-line private school in your—oh. OK. Well, that's great that you're toughening them up for the real world! I bet they could fight a bear!
"Anyway, it's great that you're allowing yourself to Keep Fear Alive this way, luxuriating in the Fear and rolling around in it like it's poop and you're a golden retriever. Because that shows you really care about your kids. Fear is love! Our rabbis have told us you can't have ahava, love, without yira, fear! Yes, I know they were supposedly talking about God, but I think they misspoke. What they meant was that it's impossible to be a good parent without quaking in terror at all times. And there's so much to fear! For instance, if you vaccinate your children they will get autistic and also cry, which means that you have betrayed their trust by letting someone stick them with a needle. And sure, chelation therapy is an option—ignore the stuff from 'experts' like the 'board certified' 'pediatricians' at the 'Mayo Clinic' who say it can cause fatal liver damage, because they're all in the pockets of the pharmaco/rationality lobby—but it's expensive. Fortunately it won't be a problem if you skip vaccines completely. Sure, your kid will have to rely on herd immunity from other kids to avoid measles and whooping cough—the death rates of which are highly exaggerated by the mainstream media and 'American history'—but kids today need to toughen up. If they can't survive measles, they can't survive competition with China. And this is one more reason to hate illegal immigrants, because they probably aren't vaccinated, thus diluting the pool of vaccinated kids who give our unvaccinated kids herd immunity."
The "Keep Fear Alive" parent has plenty to say about shards of glass in frozen peas, hormones in nonorganic milk that will give your 7-year-old son breasts, kids getting high on nutmeg. Which your teen is probably doing right now.
But for every Colbert there's a Stewart, urging us to restore sanity.
"Dude," the sanity-prone parent will say, "losing sleep over an unknowable future isn't doing us or our spawn any favors. Blaming others—immigrants, gay people, poor people—for our troubles and our children's troubles is foolish. Take a deep breath. Enjoy the actual process of parenting your actual child. Be present. Don't let guilt paralyze you. And let's try to encourage everybody else to simmer down, use inside voices, stop being hyperbolic and reactionary—and let's do that without name-calling."
Stewart put it best. In his invitation to the rally, he said that we need more of the sort of people "who think shouting is annoying, counterproductive, and terrible for your throat; who feel that the loudest voices shouldn't be the only ones that get heard; and who believe that the only time it's appropriate to draw a Hitler mustache on someone is when that person is actually Hitler. Or Charlie Chaplin in certain roles."
Can we stand in solidarity about this, please?
Click here for access to comments
Daily rate: $2
Monthly rate: $18
Yearly rate: $180
Tablet is committed to bringing you the best, smartest, most enlightening and entertaining reporting and writing on Jewish life, all free of charge. We take pride in our community of readers, and are thrilled that you choose to engage with us in a way that is both thoughtful and thought-provoking. But the Internet, for all of its wonders, poses challenges to civilized and constructive discussion, allowing vocal—and, often, anonymous—minorities to drag it down with invective (and worse). Starting today, then, we are asking people who'd like to post comments on the site to pay a nominal fee—less a paywall than a gesture of your own commitment to the cause of great conversation. All proceeds go to helping us bring you the ambitious journalism that brought you here in the first place.
Readers can still interact with us free of charge via Facebook, Twitter, and our other social media channels, or write to us at email@example.com. Each week, we'll select the best letters and publish them in a new letters to the editor feature on the Scroll.
We hope this new largely symbolic measure will help us create a more pleasant and cultivated environment for all of our readers, and, as always, we thank you deeply for your support.


text:
Pune: Shridhar Shrikrishna Kulkarni (30), was a happy man. Back in Mumbai after a ten-day trip to London on Sunday morning, the software professional hired a cab and headed home to Pune. He wanted to keep it a surprise for his parents. But his family members were in for a rude shock — they were informed of his death in an accident on the Mumbai-Pune expressway.
According to the Talegaon police, the car Kulkarni was travelling in, was hit from the rear by a speeding truck. The incident occurred around 7am when the cabbie parked his vehicle (MH-12-GZ-4944) on the extreme left lane near Somatane Phata to fix a flat tyre. A truck (KA-29-A-5969), which was heading towards Pune, rammed into the car.
An officer from Talegoan police station said, "Just as the cabbie was done fixing the flat tyre, the truck hit the car. The truck driver had lost control of his vehicle because one of its tyres burst."
Kulkarni, a resident of Sangvi, was rushed to Lokmanya Hospital in Nigdi, where he was declared dead on arrival. The driver of the taxi is critically injured and admitted in the same hospital. An employee of Tech Mahindra, Kulkarni was supposed to get engaged on June 10.
Kulkarni's uncle Vijay Ramkrishna Kulkarni said, "We were shocked to receive the news. When his parents last spoke to him, he had told them about having bought surprise gifts for everyone, including his would be wife. But he never told us when was returning to Pune."
Apart from his parents, Kulkarni leaves behind a younger brother who is pursuing his studies. "He was the brightest child of the family. We were all preparing for his engagement," his bereaved uncle added.


text:
Breaking Into The 'Department Of Mad Scientists'
What happens when scientific research borders on science fiction? Michael Belfiore, author of the new book The Department of Mad Scientists, talks about the bizarre projects happening behind the scenes at DARPA — the secretive research arm of the Department of Defense. This interview was originally broadcast on Jan. 1, 2010.
You must be signed in to leave a comment. Sign In / Register
Please keep your community civil. All comments must follow the NPR.org Community rules and terms of use, and will be moderated prior to posting. NPR reserves the right to use the comments we receive, in whole or in part, and to use the commenter's name and location, in any medium. See also the Terms of Use, Privacy Policy and Community FAQ.


text:
Brighton weather map
- Recent locations
Your chosen location:
City of London
An error has occurred.
Weather type
Forecast summary
Regional forecast for London & South East England
Dry with some pleasant sunny periods.
It will be dry, although with cloud increasing at times. Some cloud breaks are likely with some pleasant sunny spells expected. Winds will be mainly light northwesterly. Maximum Temperature 20C.
It will be a dry and cool night with clear spells and variable cloud. Some mist patches may form later. Light winds. Minimum Temperature 3C.
A dry day with variable cloud and some warm sunny periods. Outbreaks of rain are expected later in the evening and overnight with freshening winds. Maximum Temperature 20C.
Outlook for Thursday to Saturday:
Becoming brighter and cooler on Thursday with showers. Brisk winds with some sharp, locally thundery, showers on Friday. Some sunshine, feeling cool. Bright to start Saturday, then rain later.
Updated at: 0215 on Tue 26 May 2015
UK forecast for the next 5 days
Mostly fine at first this week. More unsettled later.
Northern and western Scotland will be mostly cloudy and breezy with showers. Elsewhere, after a generally cloudy morning, there will be increasing amounts of sunshine through the day, Feeling pleasantly warm in the sunshine.
Staying breezy and showery across western Scotland. Rather cloudy elsewhere but with some breaks and lighter winds, particularly in the south, bringing the risk of fog patches. Chilly for many.
Mostly dry through the morning with some sunshine, mainly in the south. Thickening cloud and strengthening winds by afternoon, with rain, locally heavy, developing across many central and western areas.
Outlook for Thursday to Saturday:
Rain clearing on Thursday with blustery showers following and strong winds in the north. Breezy and showery on Friday. Scotland showers, rain in the southwest on Saturday. Rather cool throughout.
Updated at: 0244 on Tue 26 May 2015
Outlook for the UK over the next 6-30 days
UK Outlook for Saturday 30 May 2015 to Monday 8 Jun 2015:
The transition from May into June is expected to be unsettled, with spells of rain interspersed by drier, brighter and more showery interludes. It may be rather windy, particularly in the northwest, with the bulk of the rainfall also here. Southern and eastern areas look best placed for the driest, brightest weather. Temperatures are likely to be below average in the northwest, but near average further south and east. Into the first week of June unsettled conditions are considered likely to continue in the northwest, with slightly below average temperatures, but more settled, warmer, conditions may start to dominate in the southeast. Towards the weekend these warmer more settled conditions look likely to spread to most of the country although perhaps with a risk of showers in the south.
UK Outlook for Tuesday 9 Jun 2015 to Tuesday 23 Jun 2015:
There still remains some uncertainty in the likely weather type through this period. There is, however, a signal for higher pressure to become established to the north of the UK until the middle of June. This would lead to drier, warmer conditions for many, these perhaps most prolonged in the north, but it may also allow some more unsettled, perhaps thundery, weather to move up from continental Europe and affect the south of the country. As we head into the third week of June there is a chance that similar conditions may persist with drier than average conditions in the north, however some unsettled spells are also likely at times.
Updated at: 1236 on Mon 25 May 2015
Location Details
Location: 50.822, -0.1356
Altitude: 8m above mean sea level


text:
How to Succeed in Business Using Linkedin: Making Connections and Capturing OpportunitiesPaperback
List price $20.02
You save $4.82 24% off
Free delivery worldwide
Dispatched in 2 business days
When will my order arrive?
- Publisher: Amacom
- Format: Paperback | 256 pages
- Dimensions: 185mm x 234mm x 18mm | 522g
- Publication date: 1 September 2008
- Publication City/Country: New York
- Sales rank: 660,200
Product description
Hailed as the "MySpace" for professionals, LinkedIn has taken the Internet by storm. It is now estimated that 19 million business professionals log in to this site every day to look for job opportunities, search for potential clients, get recommendations from colleagues, and reconnect with former coworkers. LinkedIn allows users to create a profile detailing their professional experience and accomplishments, which will help them connect with literally thousands of qualified professionals in their field." How to Succeed in Business Using LinkedIn" takes users through every aspect of the site, from getting registered and building their network to posing questions and creating groups. Readers will learn how to: create their home page so other users can find them - give and receive references - search for experts in their field - find leads - market their business - look for and become a service provider - find and recruit for jobs - conduct business research - discover people outside their networks Unique and practical, this is the only book available that shows users how to make the most of LinkedIn and the powerful networking opportunities it offers.
Add item to wishlist
Other people who viewed this bought:
My Samsung Galaxy Tab 4
USD$19.07 - Save $5.58 22% off - RRP $24.65
Amp Your MySpace Page
My Samsung Galaxy Tab
How to Do Everything
USD$19.53 - Save $5.12 20% off - RRP $24.65
My Samsung Galaxy Tab 2
USD$18.20 - Save $6.45 26% off - RRP $24.65
My Samsung Galaxy Tab 3
USD$18.73 - Save $5.92 24% off - RRP $24.65
- Categories:
Author information
Eric Butow is the CEO of Butow Communications Group, a technical writing and Web design firm, and is the author of Amp Your MySpace Page. Kathleen Taylor is cofounder of TalentPlanet, an executive talent firm.
Review quote
"If you are looking to exapnd your network of contacts, seeking a speaker or expert on a topic, searching for a job, or trying to find a qualified candidates for a position, LinkedIn may help you do it better, and this book weill help you use LinkedIn better." --"Online Magazine"
Table of contents
Contents Chapter 1: About LinkedIn and Using It to Your Advantage Chapter 2: Signing In and Changing Your Account Settings Chapter 3: Creating Your Profile Chapter 4: Searching for People Chapter 5: Adding and Managing Contacts Chapter 6: Finding and Recruiting for Jobs Chapter 7: Looking for and Becoming a Service Provider Chapter 8: Recommendations on Your LinkedIn Profile Chapter 9: Searching for Answers Chapter 10: Contacting Other Members Chapter 11: Managing the Non-Responding LinkedIn Member Chapter 12: Other Business Networking Web Sites Index