text:
Content discovery and content transfer between mobile communications nodes is often required, for example, to synchronize maps, traffic hot spot information and the like for vehicle mounted satellite navigation devices, pedestrian hand-held personal digital assistants and other mobile communications nodes. In an embodiment, content discovery processes using data structures designed in particular ways and sent using a single packet enable nodes to identify files to be transferred whilst keeping overheads down. In an embodiment a first and a second data structure are used, each being formed from slightly different information about a subset of the files to be synchronized. In another embodiment a single tree-based data structure is used. A process for transferring data between two mobile communications nodes is also described.
1. A method comprising: at a mobile communications network node of a mobile communications network having a first memory storing a plurality of files that it is required to synchronize with at least one other communications network node in the mobile communications network based upon a proximity of the mobile communications network node to the other communications network node;
automatically generating and sending to the other communications network node a packet comprising a first data structure, that first data structure being formed using file names and public keys of the plurality of files;
automatically generating and sending to the other communications network node a second data structure formed using the file names, the public keys and version numbers of the plurality of files; and
receiving from the other communications network node a packet comprising a data structure having details of any identified files of the plurality of files which are present in a second memory at the other communications network node with different version numbers.
2. A method as claimed in
3. A method as claimed in
4. A method as claimed in
5. A method as claimed in
6. A method as claimed in
7. A method as claimed in
8. A method as claimed in
9. A method as claimed in
10. A method as claimed in
11. A method as claimed in
12. A method as claimed in
transitioning the mobile communication network node from the joined state to a quiet state when communication with the other communications network node is terminated;
and performing active scanning to discover further communications network nodes in a content distribution cloud.
13. A method as claimed in
14. A method as claimed in
15. One or more computer-readable non-transitory storage media comprising computer-executable instructions configured to implement the method as claimed in
16. A method comprising:
at a mobile destination network node of a mobile communications network having a first memory storing a plurality of files;
receiving an advert from a source network node upon entering a communication range with the source network node;
automatically generating a first data structure formed using file names and public keys of the plurality of files;
automatically generating a second data structure formed using the file names, the public keys and version numbers of the plurality of files;
sending the first data structure and the second data structure to the source network node in a first packet; and
receiving, from the source network node, a second packet comprising a data structure having details of any identified files of the plurality of files which are present in a second memory at the source network node with different version numbers compared to the version numbers of the plurality of files present in the first memory.
17. A method as claimed in
18. A method as claimed in
19. A method comprising:
at a source network node of a mobile communications network having a first memory storing a plurality of files;
broadcasting an advert announcing a presence of the source network node;
receiving, from a mobile destination network node at a proximity location within a wireless communication range, a packet including:
a first data structure including file identifiers of mobile destination network node files stored in a second memory on the mobile destination network node, the file identifiers being based on file names and public keys of each of the mobile destination network node files; and
a second data structure including instance identifiers of the mobile destination network node files, the instance identifiers being based on the file names, the public keys, and version numbers of each of the mobile destination network node files; using the packet received, identifying a subset of the plurality of files which both the mobile destination network node and the source network node share, but for which the version numbers are different.
20. A method as claimed in
checking whether the mobile destination network node file identifiers match file identifiers associated with the plurality of files stored in the first memory; and
when a match is found, checking whether a source network node instance identifier is absent from the second data structure received from the mobile destination network node to identify the subset of the plurality of files.
Mobile communications nodes such as satellite navigation devices, or Personal Navigation Devices, in vehicles, personal digital assistants carried by pedestrians and mobile telephones carried by human users who are traveling typically need to store content. For example, in the case of satellite navigation devices the content may be maps, road construction locations, safety camera locations, locations of points of interest, locations of landmarks and similar information. Depending on the type of mobile communication node and the applications involved the particular content will vary.
Typically, the content needed by such mobile communications nodes needs to be updated and distributed to the nodes themselves. One option is to arrange the mobile communications nodes to download the content from network infrastructure each time it is required rather than storing the content locally at the mobile communications node. However, such on-demand systems incur high communication costs.
Another option is to store content locally at a mobile communications device. This is practical where the mobile device has sufficient memory resources. However, there is a need to continually update the information to keep it fresh and also a need to disseminate new content to many such mobile communications devices in a simple, reliable, fast and cost effective manner which is user-friendly.
Satellite navigation devices for use in motor vehicles are known which provide BlueTooth (trade mark) connectivity to enable the device to connect to a mobile telephone also in the vehicle. In this way the satellite navigation device is able to fetch content from an Internet data center by connecting to the Internet using the data services of the cellular network of the mobile telephone. However, this approach relies on the cellular telephone network for content distribution. Different organizations control access to the cellular network infrastructure so that negotiation with those different organizations is required for access. In addition, different cellular technologies are used in different regions so that hardware customization of the mobile device may be required for use in those different regions. Different charging plans are also likely to be in place in the different geographical regions of the network so that end users may easily find they have inadvertently run up larger bills than expected.
Satellite navigation devices for use in motor vehicles are also known which receive content broadcast from network infrastructure via FM radio channels or Satellite based distribution. This approach works in geographical regions where coverage is available, although such coverage is typically limited. FM-based solutions provide low bit rates and are limited to cities and areas where licenses can be obtained and the infrastructure installed. Satellite based solutions can support much higher bit-rates but require costly infrastructure investment.
The embodiments described below are not limited to implementations which solve any or all of the disadvantages of known content discovery and transfer processes between mobile communications nodes.
The following presents a simplified summary of the disclosure in order to provide a basic understanding to the reader. This summary is not an extensive overview of the disclosure and it does not identify key/critical elements of the invention or delineate the scope of the invention. Its sole purpose is to present some concepts disclosed herein in a simplified form as a prelude to the more detailed description that is presented later.
Content discovery and content transfer between mobile communications nodes is often required, for example, to synchronize maps, traffic hot spot information and the like for vehicle mounted satellite navigation devices, pedestrian hand-held personal digital assistants and other mobile communications nodes. In an embodiment, content discovery processes using data structures designed in particular ways and sent using a single packet enable nodes to identify files to be transferred whilst keeping overheads down. In an embodiment a first and a second data structure are used, each being formed from slightly different information about a subset of the files to be synchronized. In another embodiment a single tree-based data structure is used. A process for transferring data between two mobile communications nodes is also described.
Many of the attendant features will be more readily appreciated as the same becomes better understood by reference to the following detailed description considered in connection with the accompanying drawings.
The present description will be better understood from the following detailed description read in light of the accompanying drawings, wherein:
Like reference numerals are used to designate like parts in the accompanying drawings.
The detailed description provided below in connection with the appended drawings is intended as a description of the present examples and is not intended to represent the only forms in which the present example may be constructed or utilized. The description sets forth the functions of the example and the sequence of steps for constructing and operating the example. However, the same or equivalent functions and sequences may be accomplished by different examples.
Although the present examples are described and illustrated herein as being implemented in a vehicular network consisting of satellite navigation devices mounted in vehicles, the system described is provided as an example and not a limitation. As those skilled in the art will appreciate, the present examples are suitable for application in a variety of different types of communications networks having mobile communications network nodes.
The term "packet" is used to refer to a message data structure having a header and a payload. The header is arranged to hold control information such as address details. The payload is arranged to hold one or more blocks of content. Each block is part of a piece of content such as a file or other item of information. Each block has a sequence identifier indicating an order in which the blocks are to be arranged to form the piece of content.
As mentioned above content is often stored locally at a mobile communications device. However, there is a need to continually update the information to keep it fresh and also a need to disseminate new content to many such mobile communications devices in a simple, reliable, fast and cost effective manner which is user-friendly. The content may be any type of information and may include images, lists, maps, numerical information, textual information, and also including control information such as operating system updates or other instructions for controlling the mobile communications node itself or any software applications provided on the mobile communications node. Content may be stored as files or as any other form of information.
The methods described herein are suitable for use in a peer-to-peer or epidemic content distribution system whereby mobile communications nodes are able to transfer content to one another directly (that is, without the need to send the content via a static network infrastructure node such as a base station). Many existing peer-to-peer content distribution systems are designed for use with fixed communications nodes and are unsuitable or inefficient for use where the communications nodes move. Often connection periods are short lived, on the order of a few seconds, when communications nodes are moving. For example, where the nodes are integral with satellite navigation devices mounted in motor vehicles or other vehicles or carried by pedestrians. As well as being short lived the connection quality is typically poor and existing peer-to-peer content distribution systems are not designed with this in mind. Another factor is that mobile communications nodes usually have limited processing resources as compared with fixed network infrastructure. This is another feature that existing peer-to-peer content distribution protocols have not typically considered.
The static info station 102 may be used to seed content into the content distribution cloud 100. The static info station may have access to all or only a subset of the content to be distributed through the cloud. When a mobile node 101 and a static info station 102 come into range, the mobile node is arranged to synchronize with the info station 102. For example, the static info station may be part of a home network. In that case, the mobile communications node 101 may be a PDA for example, and each time a user returns to his or her home, the PDA may be arranged to synchronize content with the static info station in the home network. Alternatively, the static info station may be provided in a communal car park to enable vehicle mounted mobile nodes to synchronize content with that static info station during use of the car park.
In an example, it is required to distribute a set of files, f, representing content to be distributed. Each file has a cryptographically signed file certificate of any suitable type. For example, the file certificate comprises an SHA1 hash of the file, a version number, a textual name for the file and an optional flag indicating a group of the file. A public key infrastructure (PKI) may be provided using an offline Certification Authority (CA) as known in the art. For example, each device may be provided with a public key for the CA. Each file may be associated with a single content provider, referred to as the file's owner, and, in general, only the owner is able to generate new versions of the file. When a file is updated a new certificate is required, with a new file hash and incremented version number. In general, version numbers are expected to be monotonically increasing, so, given two certificates for the same file, any device is able to determine which one is the newest.
Each file may have two file identifiers associated with it referred to herein as a file identifier and an instance identifier. The file identifier may be for example an SHA-1 hash of the textual filename concatenated with the public key of the content owner. The instance identifier is related to the file and version and may be an SHA-1 hash of the file certificate. Comparing the file identifiers allows nodes to determine the set of files they have in common, and comparing instance identifiers allows nodes to check if they have the same versions of files.
Each node has a set of files for content distribution and it is able to add or remove files from that set. Selection of files for the set may be as the result of user input or may be an automated process controlled in any suitable manner. This set of files may be considered as being stored in a dynamic cache on each node.
When two nodes 101, 102 meet, communication protocols at those nodes enable those nodes to synchronize, so that newer versions of specified files are transferred between the nodes, if available. The transferred content is verifiable using the file certificates and PKI infrastructure or in any other suitable manner.
As mentioned above there are particular challenges involved where the nodes are integral with satellite navigation devices mounted in motor vehicles or other vehicles or carried by pedestrians. Physical proximity between nodes is required in order to transfer content. At least two factors impact this, the fraction of vehicles that support the content distribution system and the popularity of the content required. Also, the value of a part transferred file is low, if a node is unlikely to encounter another node with the same file soon.
When two nodes 101 come into wireless communication range of one another they need to quickly and efficiently establish a connection and also to identify the one or more files that need transferring between the nodes 101. Any suitable method for establishing a connection between the nodes may be used such as the ad-hoc mode of the 802.11 protocol family. Each node is configured to broadcast a beacon message at regular intervals.
In a preferred embodiment the process of establishing a connection is based on the ad-hoc mode of the 802.11 protocol family as mentioned above. Every 100 ms, typically, one node within an 802.11 network beacons its current SSID and BSSID. When a node starts up it enters a quiet state and makes an active scan of a predefined list of channels to discover (SSID, BSSID) pairs for networks it could join. For an active scan the node transmits a probe request on each channel. When a node receives a probe request, if it believes that it was the last node to beacon, it responds with a probe response containing the SSID, BSSID pair. If the SSID used by the content distribution cloud is discovered then the node enters the joined state and this is signaled to the operating system that the node is connected.
A node remains in the joined state provided one or more beacons are received every specified number of seconds. For example, this may be every three seconds or every 1 second. If no beacons are received then the node scans using probe requests as described above. For example, the probe requests are sent every second and if no other node is discovered in 10 seconds the node enters the quite state and signals to the operating system that there is disconnection.
For mobile nodes the window of time for connectivity is very small as mentioned above. It is important to discover nodes rapidly to maximize this window. Various of the default timers and parameters of the ad-hoc mode 802.11 process may be modified to reduce the node discovery time. In addition, the ad-hoc mode process may be modified to ensure that active probing is carried out as described above, rather than passive scanning. For example, when a node transitions from a joined state to a quiet state active scanning may be performed frequently without any sleep process. Also, a node may remain in a joined state provided one or more beacons are received every 1 second with a media disconnect being triggered immediately that this fails to occur.
The ad-hoc mode of the 802.11 protocols incorporates beacon suppression processes which, it is recognized herein, may negatively impact the discovery time of nodes in communication range. Beacon suppression occurs when a node stops sending beacons as a result of overhearing another beacon for its current SSID. The methods described herein thus use an explicit advert process whereby each node in the content distribution cloud repeatedly broadcasts an advert announcing its presence. For example, the adverts are broadcast every k milliseconds where k is about 100 milliseconds or any other suitable value. In this way, after k milliseconds, all nodes in the content distribution cloud which are within communication range of one another, will have discovered each other.
As mentioned above, mobile nodes may only have a short window of opportunity, in the order of seconds, to exchange content. It is therefore desired to identify a file that needs transferring with as few communication round trips as possible. A round trip is the time required to send a message from a source node to a destination node and to receive a reply from the destination node source node. The process also needs to be robust because messages may easily be lost between mobile nodes due to the poor quality of connection between them. The term "source node" is used to refer to a node of a communications network which is arranged to transfer content stored at that node to another node in the communications network. The term "destination node" is used to refer to a node of a communications network which is arranged to accept content transferred from another node in the communications network. Individual nodes of a communications network may operate both as source and destination nodes.
A method at a source node in a communications network such as the content distribution cloud 100 of
A source node accesses (block 200
A destination node receives (block 300 of
This optional check is made in order to reduce the number of messages required to complete the negotiation as to which files are held in common between the two nodes and which node has the latest version of each of those files. The node with the smallest number of files in its dynamic cache begins the process in order to reduce this number of messages. The process is workable without the check at block 301 being made and in that case, it is not necessary for the adverts to incorporate information about the number of files held in the dynamic cache of the appropriate node.
If the destination node has fewer files in its dynamic cache than the source node, the destination node proceeds with the process as shown in
In order to decide whether to exchange files with the source node, the destination node compares its global identifier with that in the received advert (block 303). If a difference is found then the source and destination nodes have different content files. Nodes are optionally arranged to store the address of the source node and the global identifier of any source node with which they have completely exchanged their dynamic cache content (block 304). This prevents the content discovery process from being undergone unnecessarily for nodes that have already been synchronized.
A process for deciding which dynamic cache files are held in common and which node has the latest version of these is next undergone (block 305). This process is described in more detail with reference to
Because the set of files in a dynamic cache of a node may be arbitrarily large and because the amount of data that can be transferred in a payload of a packet is limited, it is difficult to achieve the content discovery process in an efficient manner. In order to address this data structures are employed to transfer data about the files in the dynamic caches between the nodes and those data structures are designed in a particular manner to enable the content discovery process to be achieved simply and efficiently.
In a particular example, the data structures are based on Bloom filters. However, it is not essential to use Bloom filters. Any suitable data structure may be used which is able to encode file set membership in a manner such that the data structure may be used to determine if a particular file was a member of the set of encoded files without providing false negatives. Bloom filters are described in detail in B. Bloom, "Space/time trade-offs in hash coding with allowable errors." Communications of the ACM, 13(7):422-426, 1970.
A Bloom filter comprises a bit array of certain length, where, for each items of a given set, the hashj(item)th bit is set, for all hash functions in a given set of j hash functions. In order to check whether an item is present in the set, each hashj(item)th is checked, and if each bit is set then the bloom filter is considered to contain the item. Bloom filters cannot yield false negatives, but they can yield false positives. In general there is a trade off between the number of items that can be encoded in a Bloom filter of a given length and the probability of false positives.
In some embodiments full Bloom filters are used where the file identifiers of all files in a dynamic cache are encoded in the Bloom filter. However, in other embodiments partial Bloom filters are used in which only a subset of the file identifiers are encoded. For example, the first 1000 or the first 500 file identifiers.
In a particular embodiment a bloom filter with array length 18288 bits is provided which is arranged to be the same as the size of a packet payload. Using the heuristics presented by Mitzenmacher (M. Mitzenmacher. Compressed bloom filters. IEEE/ACM Transactions on Networking, 10(5), 2002) 1000 file identifiers are encoded per partial Bloom filter using 12 hash functions. This yields a false positive probability of 0.0154%. However, it is not essential to use these particular Bloom filter parameters.
A negotiation scheme to determine the appropriate files for transfer between two nodes A and B is now described with reference to
Node B receives an advert 602 from node A. The advert comprises a global identifier as mentioned above and optionally details about the number of files in A's dynamic cache. Using this information B is able to establish that it has fewer files in its dynamic cache and that at least one file needs transferring between A and B.
Node B generates and sends to node A a first data structure. This first data structure is formed from the file identifiers of a specified set of files at the dynamic cache (block 400 of
Node B also generates and sends to node A a second data structure. This second data structure is formed from the instance identifiers of the same files (block 401 of
Node B creates and sends the first and second data structures to node A in message 603 (see
Device A receives the first data structure and the second data structure from B and proceeds to make the checks as described at blocks 501 and 502 of
B receives the full frame sized partial Bloom filter from A and compares the cache of files present on B to determine which of those files are represented in the full frame size partial Bloom filter. For each such file, B sends (605) a file information record containing B's file version and other file information upon which A decides whether to push or pull that file to or from B (message 606). A bulk content transfer process ensues 607 and the process repeats for the next identified file 608.
Referring to
file identifierinstance identifierThe methods of
Various modifications may be made to the methods. For example, the partial Bloom filters may be formed from a any suitable pre-specified number of local files selected at random or in any other suitable way. In another example, instead of using two partial Bloom filters, a single Bloom filter is used to encode the data for both the first and second data structures. That is, the first and second data structures may be integral.
In a particular example, each file i in a dynamic cache dd has a file name fnamei and a 16-bit version versioni as well as the public key pki of its owner associated with it. Using the SHA-1 hash function H, a node generates for each file i in dd two unique 160-bit identifiers:
A single 160-bit hash key that represents the entire content of dd is generated: Global Identifier=H(concat(InstanceIdentifier1, Instance Identifier2, . . . , Instance Identifiern)) for all n files in dd ordered on File identifier. In another embodiment the global identifier may be generated using hash chaining. The Global Identifier is generated using a consistent ordering so that two nodes with the same files and versions have the same global identifier. Any suitable ordering may be used provided it is used consistently. Each device embeds its Global Identifier in its periodic adverts. Any device can thus compare its 160-bit Global Identifier with that of another device (whose advert it has just heard), and quickly determine if the devices have the same or different content files. As a Global Identifier only takes up 20 bytes, periodic adverts remain small.
Each node in the communications network may also hold fixed content files in a fixed content cache. Fixed content is expected to be present on all nodes and examples of fixed content may be operating system files.
An example of a process for fixed content discovery is now described with reference to
For each group a group hash is generated automatically by a processor on the node (block 701). For each file an instance identifier is created by taking a hash of the file certificate. The files in each group are then ranked using their instance identifier value and a group hash is generated by hash chaining. That is, each instance identifier is recursively hashed e.g. H(IdFile4, H(IdFile3, H(IdFile2, H(IdFile1)))). Where H represents a hash function.
A Merkle tree is then created automatically using a processor at the node (block 702). Merkle-trees are described in detail in R. Merkle. A digital signature based on a conventional encryption function. In Crypto' 87, 1987. Each row of the Merkle tree is generated by taking pairs from the previous row and hashing them together. The group hash values are the leaves of the tree and are ranked according to their k-bit prefix. For empty groups, a null token is used. The root of the Merkle tree is a unique hash for the entire fixed file set, parameterized by the value of k used. Any node can determine if their fixed sets are identical by comparing the root hash for the same value of k. If the root hashes differ then the nodes have different content. The root hash and the value of k is included in a beacon (block 703) and broadcast (block 704).
If a node detects that its root hash differs from another nodes' root hash it carries out a recursive process to determine which files are different in the fixed caches at the two nodes. This is now described with reference to
Node A 800 broadcasts an advert 802 which is received by node B 801. A processor at node B 801 automatically checks whether the root hash in the advert is different from node B's local root hash (block 803). If so, the processor at node B selects a jth level of node B's Merkle tree and sends that to node A in a packet 804. The jth level is selected based on the payload size of the packets being used by the communications protocol. For example, the jth level of the Merkle tree is selected such that 2j*20<payload size. At node A a processor automatically checks 805 which hashes in the jth level of its local Merkle tree differ from those received in the packet 804. For those differing hashes node A sends an associated sub-tree level of its local Merkle tree to node B using packet 806. Node B then checks which hashes at that sub-tree level of its local Merkle tree differ from those received in packet 806. It selects an associated sub-tree level of its local Markle tree based on those differing hashes and sends that sub-tree level back to Node A using packet 808. This process repeats until the full hashes for the set of groups that may differ can be fitted into a packet. In some embodiments, two groups fit into a single packet thereby keeping the number of packets required low, and this influences the choice of the value of m.
This provides a very efficient algorithm that efficiently allows a node to detect a differing file with low overhead. For example, in an implementation which uses a payload size of 2304 bytes, it is possible to fit 115 hashes in a single packet. In this case, the likelihood that groups have more than 57 files is low when m=16. (When m=16 the probability of a single group having 56 entries or more is 10−15. Only one level of the Merkle tree needs to be exchanges in this case in order to discover a file that is different, where that the number of files in the fixed set is less than approximately 3650. Thus the process is able to efficiently identify a differing file rapidly, in a few messages.
It is possible to add and remove files from the fixed file cache. The addition of a file impacts a single group and the file is mapped into a single group. A permanent record may be kept of deleted files. The grouping of the files makes it possible to efficiently determine which groups are required in the event that one or more files are added or removed. For example, the grouping is such that a single group is impacted when a file is added. Then, if two files are added, each in a different group, it is possible to efficiently determine which two groups have been impacted. It is not necessary to repeat the content discovery process after the first differing file has been found.
Once a differing file in the fixed file cache has been detected using the methods described above any suitable content transfer process may be used to transfer that file between the two nodes. For example, TCP over IP may be used or any other suitable packet-based content transfer process.
In some embodiments the content transfer process used in conjunction with the methods described herein is as now described with reference to
The source node has an input which accesses (block 901) a file or other piece of content to be transferred to a destination node. The source node comprises a processor of any suitable type which is arranged to split the file or other piece of content into blocks (see block 902) where a block has a pre-specified size. The processor creates a send vector having one bit for each of the blocks (see block 903) and this vector is initialized, for example, so that each bit has the value zero.
When the send vector is initialized all the bits in that vector are considered to be unset. A process of sending blocks to the destination node then occurs (see block 904 of
A connection between the source node and the destination node is already established as mentioned above and the destination node monitors that connection for packets. If a block is received, the processor at the destination node is arranged to set the associated bit in the receive vector and monitor the number of set bits in that vector (block 1003 of
If the number of set bits has increased by a threshold proportion (block 1006 of
By using the receive vectors as described herein the number of acknowledgement packets that need to be sent is low. The acknowledgement packets here are those sending the receive vector. This improves efficiency and reduces pressure on communications network resources. For example, the destination node does not need to send a copy of the receive vector every n packets. It is able to send a copy of its receive bit vector based on a function of the received packets. For example, whenever the destination node sends the receive vector it is able to record the number of set bits. When the number of set bits increases by 50% (or other suitable threshold proportion) this triggers a sending of the receive vector. Also, if the destination node gets a predefined number of duplicate packets, for example, one, it triggers the sending of the receive vector. In this way the protocol generates O(log k) packets containing receive vector information (where k is the number of packets required to transfer a file). For example, to transfer a 1 MB file over a link with a 30% loss rate the number of receive vector packets sent is less than 1% of the total number of packets needed to complete the transfer. In addition, the number of duplicate packets received at the destination node will be close to zero. Also, if a file transfer is interrupted and needs to be resumed with either the same or different communications network node, the destination node is able to provide the receive vector and the transfer process starts from that point.
It is also noted that, if the connection between the source node and destination node has a high loss rate and this leads to a packet containing the receive vector being dropped, then recovery is quick. This is because another packet containing the receive vector will shortly be sent. As a result the process is robust.
The receive vector is typically of a size which is able to fit into a single packet. Where a very large file is to be transferred from the source node to the destination node it may not be possible to fit the receive vector into a single packet. In this case it is possible for the source node to decompose or split the file into one or more parts and send each of those separately using the processes described herein. Once all the parts are received the destination node can reconstruct the original large file.
In another embodiment now described with reference to
For example, in this embodiment the nodes comprise satellite-navigation devices with integral wireless network interface controllers. The nodes are arranged to carry out content discovery for files in a dynamic cache at each node using the methods of
In an evaluation a number of experiments were run on a small vehicular testbed, consisting of two cars. For all the experiments a laptop running Windows� XP SP2 with a Netgear (trademark) WAG511 PCMCIA card, which uses the Atheros (trademark) ar5212 chipset, was installed in each vehicle. Two possible configurations for the 802.11 antenna were calculated: in the baseline case the laptop was placed on the rear parcel shelf, consistent with the height that a portable SatNav device would be mounted. In the second case, the antenna was placed external to the car by mounting a laptop on the roof of each car. In order to minimize interference from other wireless networks deployed in homes 802.11a was used which operates on the 5.4 GHz band. Additionally, both laptops were equipped with a GPS receiver to record their respective location and velocity. In the experiments each laptop was configured to use the Atheros (trademark) Reference Driver, modified to ensure rapid link-level discovery. For each experiment, both laptops had the same 50 file entries in their dd. One of the laptops had a later version of each file, with each file 10 MB in size. When the two devices become connected, they determine the set of files to transfer, using the content discovery algorithms described earlier. In order to transfer the file, two configurations are considered: TCP and Broadside. TCP: In this configuration, the standard unmodified Windows� XP SP2 TCP/IP stack is used, and files are transferred using TCP configured with the standard MTU of 1500 bytes. In order to remove the overheads of assigning IP addresses to the laptops dynamically, we statically configured each with a non-conflicting IP address. Broadside: In this configuration, the TCP/IP stack is disabled and the data transfer protocol described with reference to
The computing-based device 1100 comprises one or more inputs 1108 which are of any suitable type for receiving media content, Internet Protocol (IP) input, or other input. The device also comprises a wireless antenna 1111 and a wireless network interface controller 1105.
Computing-based device 1100 also comprises one or more processors 1106 which may be microprocessors, controllers or any other suitable type of processors for processing computing executable instructions to control the operation of the device in order to communicate with another node, discover content at that node and transfer content with that node. Platform software comprising an operating system 1102 or any other suitable platform software may be provided at the computing-based device to enable application software 1110 to be executed on the device.
The computer executable instructions may be provided using any computer-readable media, such as memory 1101. The memory is of any suitable type such as random access memory (RAM), a disk storage device of any type such as a magnetic or optical storage device, a hard disk drive, or a CD, DVD or other disc drive. Flash memory, EPROM or EEPROM may also be used.
An output 1109 is also provided such as an audio and/or video output to a display 1107 integral with or in communication with the computing-based device. The display system may provide a graphical user interface, or other user interface of any suitable type although this is not essential.
The term 'computer' is used herein to refer to any device with processing capability such that it can execute instructions. Those skilled in the art will realize that such processing capabilities are incorporated into many different devices and therefore the term 'computer' includes PCs, servers, mobile telephones, personal digital assistants and many other devices.
The methods described herein may be performed by software in machine readable form on a tangible storage medium. The software can be suitable for execution on a parallel processor or a serial processor such that the method steps may be carried out in any suitable order, or simultaneously.
This acknowledges that software can be a valuable, separately tradable commodity. It is intended to encompass software, which runs on or controls "dumb" or standard hardware, to carry out the desired functions. It is also intended to encompass software which "describes" or defines the configuration of hardware, such as HDL (hardware description language) software, as is used for designing silicon chips, or for configuring universal programmable chips, to carry out desired functions.
Those skilled in the art will realize that storage devices utilized to store program instructions can be distributed across a network. For example, a remote computer may store an example of the process described as software. A local or terminal computer may access the remote computer and download a part or all of the software to run the program. Alternatively, the local computer may download pieces of the software as needed, or execute some software instructions at the local terminal and some at the remote computer (or computer network). Those skilled in the art will also realize that by utilizing conventional techniques known to those skilled in the art that all, or a portion of the software instructions may be carried out by a dedicated circuit, such as a DSP, programmable logic array, or the like.
Any range or device value given herein may be extended or altered without losing the effect sought, as will be apparent to the skilled person.
It will be understood that the benefits and advantages described above may relate to one embodiment or may relate to several embodiments. The embodiments are not limited to those that solve any or all of the stated problems or those that have any or all of the stated benefits and advantages. It will further be understood that reference to 'an' item refers to one or more of those items.
The steps of the methods described herein may be carried out in any suitable order, or simultaneously where appropriate. Additionally, individual blocks may be deleted from any of the methods without departing from the spirit and scope of the subject matter described herein. Aspects of any of the examples described above may be combined with aspects of any of the other examples described to form further examples without losing the effect sought.
The term 'comprising' is used herein to mean including the method blocks or elements identified, but that such blocks or elements do not comprise an exclusive list and a method or apparatus may contain additional blocks or elements.
It will be understood that the above description of a preferred embodiment is given by way of example only and that various modifications may be made by those skilled in the art. The above specification, examples and data provide a complete description of the structure and use of exemplary embodiments of the invention. Although various embodiments of the invention have been described above with a certain degree of particularity, or with reference to one or more individual embodiments, those skilled in the art could make numerous alterations to the disclosed embodiments without departing from the spirit or scope of this invention.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
By FnF Correspondent
PUBLISHED: Feb 05, 2011, 18:59 pm IST | UPDATED: Feb 07, 2011, 22:09 pm
Keywords: India Navy Commodore Sukhjinder Singh Sex scandal Discharge from duty
New Delhi: Commodore Sukhjinder Singh, an Indian Navy officer who was closely involved with the aircraft carrier Admiral Gorshkov deal with Russia and is facing a sex scandal probe, will be discharged from service, Defence Minister A.K. Antony said Saturday.
"He (Singh) will be discharged. He will not be in service now," Antony told reporters at a function to induct US-built C-130J aircraft into the Indian Air Force.
More in Indian Navy...
Leave a comment
Week's Top Viewed

subset: commoncrawl


text:
Long Island, Summer of 1954 — what's that hardcover book that Marilyn is reading? Daphne du Maurier's Mary Anne? Irving Stone's Love is Eternal?
Can't… quite… make it out. Can we zoom in, please?
Joshua Glenn is a Boston-based semiotic culture and brand analyst. He is editor/publisher of HILOBROW and the Radium Age science fiction imprint HILOBOOKS.
In addition, Josh is co-author of several books, including (with Mark Kingwell and the cartoonist Seth) THE IDLER'S GLOSSARY and THE WAGE SLAVE'S GLOSSARY, the object-oriented story collections TAKING THINGS SERIOUSLY and (with Rob Walker) SIGNIFICANT OBJECTS, and (with Elizabeth Foy Larsen) the family activities guides UNBORED, UNBORED GAMES, and the forthcoming UNBORED ADVENTURE.
In the '00s, Josh was an editor and columnist for the BOSTON GLOBE's IDEAS section; in the '90s, he published the high-lowbrow zine/journal HERMENAUT.
EmailNot published
HiLobrow is a p(HiLo)sophical blog. Click here for the Best of 2010; here for 2011; here for 2012; here for 2013; here for 2014; here for 1Q2015; and here for 2Q2015. Editor: Joshua Glenn
View Joshua Glenn's profile


text:
River Front Lots
All Lots
Lot 2
Lot 3
Lot 8
Lot 11
River Access Lots
Lot 26
Lot 31
Lot 34
Lot 37
Lot 42
August 4, 2015
Heartstone Subdivision Sales, LLC
Joe W. Meyer
Welcome to Heartstone Subdivision in Concan, Texas.
Located in the "Heart of the Frio", Heartstone subdivision is situated along the crystal clear waters of the Frio River and is the premier subdivision in the Texas Hill Country. The cool, spring-fed Frio River meanders through the Frio Canyon, flanked by towering bluffs and ancient Cypress and Sycamore trees. It is a recreational paradise for countless Texas families.
Heartstone - Heart of the Frio River
Quality Homesites
There are a limited number of pristine riverfront properties along this beautiful stretch of water, and Heartstone has more than a dozen of them, in addition to 30 river access homesites. The property is nestled along the picturesque Frio River with a natural bluff that allows elevated, breathtaking views. Heartstone is a community-oriented subdivision that provides the perfect backdrop for a stress free second home or weekend get-away.
Designed for Families
Designed for families who love nature, Texas friendliness, and today's conveniences, Heartstone is the cure for big city hubbub. It's an ideal vacation retreat that can also give you the perfect year-round small town lifestyle, with easy access to restaurants, shopping, water sport rentals, horseback riding, golfing, entertainment venues, hunting and other outdoor sports as well as state parks.
New Reduced Pricing for 2015. See the lots and pricing page for details.
Fifteen new homes built and/or currently under construction.
Private Tours, Open House, Tubing
Throughout the year we hold open houses and special events that are open to prospective buyers. If you would like to experience Heartstone with your family and get a better feel for the property, we invite you to be our guest at a small, private riverside gathering, complete with a picnic and tubing in the Frio River.
Contact Joe W. Meyer at 281-844-7424 or email firstname.lastname@example.com.
See Our Live Video Webcam here (opens new page)


text:
'Break Through' Event Postponed to Spring 2013
Published on October 31, 2012
10/31/12 Update:
We regret that it will be necessary to move all Break Through … to Life After Graduation activities to the spring semester. This was a difficult decision to make, but it was made with input from the Break Through committee. Due to the devastation that many of our alumni are facing following the hurricane earlier this week, we decided it would be better to wait until all who volunteered can be here with us for the event. It is unfortunate, but our thoughts are with our alumni and families who are dealing with clean-up and recovery efforts.
We have rescheduled the week to Thursday, February 14 through Wednesday, February 20, with the panels and networking events happening that weekend (Feb. 15, 16, 17).
My sincere thanks to faculty and staff who enthusiastically supported this event in many different ways, and to students who had registered to attend. We will look forward to bringing alumni and students together early in the spring semester when we can finally Break Through together!
Becky Deitrick
Director of Alumni Relations
# # #
Susquehanna University students will get a sneak peek at life beyond college at the school's Break Through … to Life After Graduation event Oct. 28 through Nov. 4. Susquehanna alumni will return to campus to advise students on everything from managing personal finances, to landing a first job, to living in a big city.
The week-long event will connect students of all class years with helpful alumni via Skype sessions, small-group lunches, panel discussions, speed networking and receptions. An informal reception on Nov. 2 from 7 to 8 p.m. in Evert Dining Room will allow personal introductions and specific questions from participants.
Any student may attend three of 20 panel discussions covering such topics as "Have Your Mid-Life Crisis Now: The Turbulent 20s Survival Guide," "Breaking Through to Business and Becoming an Entrepreneur," and "Humanities Majors and Technology." At the speed networking event, students will have a chance in short sessions with alumni to complete sentences such as "Gain experience without having any by ______________" and "My liberal arts education helped me ______________."
Among Skype sessions, participants can choose "Living and Working in the Big City" with the New York City Alumni Chapter, "Working in the Nonprofit Industry and Living in D.C." and speaking with Craig Housenick, a 1998 Susquehanna graduate and television lighting director in Los Angeles who has worked on "Jimmy Kimmel Live" and "The Voice."
Break Through … to Life After Graduation is intended to strengthen ties between current students and some of Susquehanna University's 15,000 alumni in ways that will assist students with career exploration, networking and their eventual search for employment. It is part of a comprehensive effort to enhance student success by providing students access to Susquehanna alumni who will help to guide and support them as they journey along their life paths.
Karen M. Jones


text:
Click Here To Watch This Video at Scary Fuckers
Just when you thought you had seen it all, along comes Scary Fuckers to shock and stimulate your senses.These rough and dangerous fuckers will push your limits to new extremes.
Description: Prison life isnt for everyone, but its definitely good for these two Scary Fuckers! Brantshy was washing up when Frenky decided to show him what men in prison do. There isnt time to think before Brant
Permanent link to this video:
Code to embed player in blogs and forums, etc:
Post this video in the JUB Forums with this code:
Simply copy the above code into your JUB forum post and the movie will appear.


text:
August 5, 2015
The White House says President Barack Obama and Israeli Prime Minister Benjamin Netanyahu remain in "full agreement" about keeping Iran from getting a nuclear weapon.
The Obama administration's account of Friday's phone call offered no mention of Netanyahu's dire declaration to the U.N. General Assembly. The Israeli leader on Thursday held up an image of a bomb and warned that the world only has until next summer to stop Iran from building one.
Obama has promised that the United States will do what it must to prevent Iran from getting nuclear weaponry, but faces pressure from Netanyahu to be more specific in public about what would cause Washington to intervene.
The White House account emphasized the "close cooperation" between the U.S. and Israeli governments over threats posed by Iran.
To comment, the following rules must be followed:
Comments may be monitored for inappropriate content, but the station is under no legal obligation to do so.
If you believe a comment violates the above rules, please use the Flagging Tool to alert a Moderator.
Flagging does not guarantee removal.
Multiple violations may result in account suspension.
Decisions to suspend or unsuspend accounts are made by Station Moderators.
Questions may be sent to email@example.com. Please provide detailed information.
Click Here to access the online Public Inspection File
Viewers with disabilities can get assistance accessing this station's FCC Public Inspection File by contacting the station with the information listed below. Questions or concerns relating to the accessibility of the FCC's online public file system should be directed to the FCC at 888-225-5322, 888-835-5322 (TTY), or firstname.lastname@example.com.


text:
Favorite Song You Now Dislike
Name a song, just one, that you really use to like, but now you just can't stand it.
Think hard and pick just one.
Mr Mister....Broken wings
Re: Favorite Song You Now Dislike
The nineteen eighties...
Re: Favorite Song You Now Dislike
Great topic. Yes the 1980s bore many of these songs....
First to mind is Phil Collins' "Sussudio".
Do another thread about songs you formerly hated now you love ...
Many from the 1970s on my list. Bee Gees "How Deep is Your Love", Melanie "Brand New Key", etc., etc. And a lot of the stuff my parents used to play ...
Re: Favorite Song You Now Dislike
Don't Stop Believing comes to mind....it's been so overplayed I just groan when i hear it come on now. It's almost become nothing more than a bad karaoke anthem.
Re: Favorite Song You Now Dislike
"Walk This Way" by Aerosmith, especially the DMC/Aerosmith version.
Re: Favorite Song You Now Dislike
I have to do this.................."Freebird",and "Stairway to Heaven".Makes me feel gouging out both of my eyes with a dull rusty spoon.
Steve B
Re: Favorite Song You Now Dislike
We didn't have much choice back then - wherever you looked it was all doof! shmack! doof! shmack! [pokey keys sound] doof! shmack! doof! shmack! boom boom boom! [pokey keys sound] ...
Also elevator fusion. I had tons of albums - David Sanborn, Larry Carlton, Lee Ritenour, Spiro Gyra, George Benson, Michel Colombier etc. There were pearls amongst the swine but the gem/pork ratio was pretty dire.
Just triggered a funny memory ... I joined a band in my teens after a group of friends came over to my place, tied rope around my elevator fusion record collection (despite my protests) and said "You're not listening to that sh1t any more, you're gonna play in a rock n roll band!!" lol
Re: Favorite Song You Now Dislike
My choice = Cozy Powell - Dance with the devil.
Re: Favorite Song You Now Dislike
Around pre-teens / early teens I was heavily into Slade and liked Dave Lee best *chortle* - redikuluss!
Re: Favorite Song You Now Dislike
"Another brick in the wall" Pink Floyd.
Re: Favorite Song You Now Dislike
In the late 70s I hated disco, but now I like many of the songs. While I never liked How Deep Is Your Love, I've come to like many of the other Bee Gee songs from that era. Their stuff from late 60s/early 70s is excellent. Incredible harmonies.
Re: Favorite Song You Now Dislike
Bon Jovi - Livin' on a Prayer
I thought it was really cool...I think I was mildly deaf.
Re: Favorite Song You Now Dislike
Let's just say that when I was a youngster, I didn't hate Free Bird with the passion of the Christ and the intensity of a thousand suns. The reverse is now true. Though I still like to throw on some Skynyrd on once in a while, I have deliberately not listened to that song and the first few notes of it always make me have a sour or upset look on my face. It's a physical reaction.
I am a patient person, but there is really only so many times a man can hear some drunk moron scream "FREEEEEEEEEEEEEEEEEEEEEEEEEBIRD" at the top of his lungs. Good grief, people.
Re: Favorite Song You Now Dislike
Livin' on a Prayer... I'm cringing as I type that.
Check out The Bad Plus' rendition of How Deep Is Your Love, it's one of my favorite songs. Maybe y'all could like that version instead.
Re: Favorite Song You Now Dislike
"Satisfaction", "Light my fire" and "Bohemian Rhapsody". Really great tunes by great bands but I have just listened to way too much classic rock radio.
Re: Favorite Song You Now Dislike
Worst thing is when you play lounge and some cretin shouts PLAY SOME ROAWK AN ROLLLL! I am not a violent person but ...
I am pleased to say that I never cared for Bon Jovi, despite the cute buns and magnificent mullets. Like others I was all "Death to Disco" in the 70s and 80s and now I enjoy some of those old tunes like I Will Survive, Funkytown, Don't Leave Me This Way and Never Can Say Goodbye.
Still, we DTD types were right - disco lead to dance clubs which, along with gaming machines and noise laws, devastated the live music scene.
Re: Favorite Song You Now Dislike
Steely Dan's Aja.
There. I said it.
Re: Favorite Song You Now Dislike
We can counsel you through this.
[ Actualy thinking...." e gads man ! " ]
Re: Favorite Song You Now Dislike
It's albums like these that make these young players go out and implement these overly-pretentious ideas into songs like "Mustang Sally" or "You are the Sunshine of my Life", and gets them fired, or at least distrusted on the bandstand for the next few years of their musical careers (if they get to have a few years before giving up and getting a real job). It's not just drummers. Bassists, guitarists, horn players.....they've all suffered from this album. It's a shame. If I could go back in time I'd stop my sister from ever buying that wretched album (I think albums back then were only $2.99 too) and get Kiss's Destroyer instead. I would've been much better served not having shunned Charlie Watts and Ringo, and just delved into the works of Clyde Stubblefield and Jabo Starks. That stuff never gets old and I love playing it, even 30 years later.
I'm going over to iTunes to download the latest Miranda Lambert hit now.
Re: Favorite Song You Now Dislike
Point taken.
I remember being guided towards Aja by people whose opinions I placed much higher than my own. I do still like it, but that's probably because it also occupies a time of life that, with the benefit of hindsight, was sweet, carefree, etc., etc.
And, well, I .......
Don't really need to justify, do I.
Nor question someone elses choices, come to think of it.
Re: Favorite Song You Now Dislike
About what part, I'll leave that up for debate ;)
Re: Favorite Song You Now Dislike
Yeah, no worries.
I think it hadn't occured to me until you came back with a reading of the music that, to be honest, I hadn't considered; that my affection for it was coming from someplace else completely.
You know, how things that we may have 'treasured' may not have been scrutinised in the full light of day; kind of a thing?!!!
Re: Favorite Song You Now Dislike
But my dig on the college players totally revering certain artists and works, that's true. I've done gigs with people like this, and it's horrifying. There I would be at some VFW hall with a crowd who just wants to rock and I have a bass player who won't play low notes, or a guitar player who can't play 'inside'. I've had singers who couldn't swing the phrase "I will survive", and keyboardists whose only organ sound was that thin Wurlitzer church organ sound. I've suffered alot at the hands of these pretentious artists putting out albums full of fusiony fluff. I'd like a refund for some of that!
Re: Favorite Song You Now Dislike
I feel your pain!
And, what's worse, I know I've fallen into that trap.
In fact................
O bollocks, I believe I've still got at least one foot and two hands in it!
In fact make that two hands and two feet!!!!!!!!!!!!!!
One redeeming feature?
I still use a single bass drum pedal.
OOOOpppssss. Not starting anything. I repeat: Not anything starting!
Re: Favorite Song You Now Dislike
Don't have a once favoured song that I now hate. Plenty I may tire of due to repetition or bombardment, but that doesn't extend to dislike by any measure. In the right mood, I can still find something good in anything I like.....regardless of how often I've heard it. Generally speaking, if I hate it now it's because I hated it then. Favourites have become favourites for a reason......even a bit of overkill is unlikely to change that for me.
If anything, I roll the other way. There's a bunch of stuff I once didn't like or was too willing to dismiss, that the passage of time has actually given me an appreciation for.
Re: Favorite Song You Now Dislike
I'll chime in and say Livin' on a prayer.
Liked it a whole lot 5-6 years ago, but now I can't listen to it.
Re: Favorite Song You Now Dislike
Do you know what?
I was just thinking along similar lines.
When I scored a Stanley Clarke album from the clearance bin at a favourite record shop; I remember my disappointment that he was playing double bass, and it was a jazz album.
I was a teenager, and had only known his electric work.
Yeah, I hear the groans!
But that was then.
I gave it a couple of listens, but just didn't have any way to get into it then.
Times change.
And now I can't get a laugh out of the slap-stick in "Fawlty Towers".
Do you know what? [ Part 2 ]
Maybe I should use quotes, or learn to type a whole lot faster! Please refer back a bit for relevance!
Re: Favorite Song You Now Dislike
Re: Favorite Song You Now Dislike
Hell yeah.
Slade were awesome.
Except the lead guitarists hair cut. Way too severe.
Gave me nightmares.
Re: Favorite Song You Now Dislike
Re: Favorite Song You Now Dislike
"Kan't touch that !!!!!!!!!!!!!!!!!!!!!!!!!!!!!! "
Completely other idea: ' Least hits, most impact', as in sparse but oh so tasty drumming.
Is this another thread?
Re: Favorite Song You Now Dislike
Hey Bo,
Just reviewed the posts, and was thinking back.
There are so definately ' why would you ? ' songs.
I hope I've never crossed that threshold.
Originals, perhaps is where the' note lust ' comes in. And then hopefully, taste raises it's head.
That being said; in charting the progress of favourite bands/ artists; I think that many players have perhaps pushed too hard in the name of progress.
However, if everything stays the same, nothing changes.
Another thread idea: ' Finger on the Pulse'.............who made a difference at the right time?
Take for example this: the Beatles. "Kind of Blue", Miles Davies.
I'm wondering how many songs/ tunes/ albums we remember would fit into the catergory of :
Holy shit, I was there then,when.
This underpins a part of me. Not only has that music become woven into my history, but with reflection, that moment has been acknowledged as a "Once in a lifetime"
I know I'm kind of 'slewing' sideways.
And yes,
Here comes the point.
The thing you loved that you no longer love. Or continue to love.................
Is still a part of you, or, has changed because....................
Everything that you've done/learnt since says it's dated, or, a classic.
Just kind of rambling on association.
Re: Favorite Song You Now Dislike
I think Pol mentioned all that corporate muck jazz being thrown about during the 80s, and it's true. Oddly enough you can still get new muck jazz like that today. Even better, you don't have to buy a whole album of it, thanks to iTunes, eh?
Re: Favorite Song You Now Dislike
Yeh, good point.
A good friend of mine gave me his cassette collection.
And the Yamaha unit to play it.
It's been an education.
The good and the 'bad'.
Holy shit, music moves!
Re: Favorite Song You Now Dislike
Last thing:
Music forever tainted:
Vivaldi's 'Four Seasons'
We danced it with plastic lawn mowers.
Not every season.
However, I heard Nigel do his thing on it.
Thank God/Good
Re: Favorite Song You Now Dislike
O.K. Back to topic.
And sorry if I wandered a bit, but, there are reasons why we have associations with certain music in time. Good and bad.Looking back may bring the soft moments of being there, or the cold hard reality of, holy shit, it hasn't stood the passage of time.
So endeth the lesson.
Whatever, whatever, amen.
Re: Favorite Song You Now Dislike
Frightening, (for him, at least!) but true.
Re: Favorite Song You Now Dislike
Re: Favorite Song You Now Dislike
Anything by Muse (except for the second album, which really is excellent) stirs hatred in me. When I was young and impressionable I thought they were good and now I've realised that they are just dire.
Re: Favorite Song You Now Dislike
... 2 bass drum pedals is better than none!
Not starting anything either...
|All times are GMT +2. The time now is 10:32 PM.
Powered by vBulletin® Version 3.8.0
Copyright ©2000 - 2015, Jelsoft Enterprises Ltd.
Bernhard Castiglioni's DRUMMERWORLD.com


text:
North Dakota's Board of Higher Education has approved policy changes to give more authority to the university system chancellor.
The changes put new chancellor Ham Shirvani in charge of any search for a new college president.
It specifies that North Dakota's college presidents report to the chancellor. Before, the lines of authority were blurrier.
The board approved the changes Wednesday.


text:
Petra & the Dead Sea
Enjoy a brief but memorable jaunt to Jordan. Visiting the legendary Rose City of Petra, Shobak Crusader Castle and Mt Nebo before descending to the lowest point on the earth and relaxing by the Dead Sea.
Amman - Petra. Upon arrival at Amman's Queen Alia airport you will be met and transferred directly to Petra, a 2 hour drive away. Check in to your hotel and spend the remains of the day at leisure.
Overnight: Petra
After breakfast, spend the day with your private guide exploring the ancient Nabatean Rose City of Petra - a UNESCO World Heritage Site. Access the hidden archaeological treasures of the Rose City on a walk through a narrow, deep siq, where the rocks finally give way to reveal the famous facade of Al-Khazneh (the Treasury). It's also possible to ride a horse through the Siq. Once inside the ancient city, discover tombs, temples, an impressive amphitheatre and a Roman colonnaded street. If you're feeling energetic ascend the hundreds of rock-cut steps to Ad-Deir. Better known as the Monastery, Ad-Deir has a similar facade to that of the Treasury, but is far bigger and the views from the nearby cliff-tops are incredible!
Overnight: Petra | Breakfast
Petra - Shobak Castle - Madaba - Mt Nebo - Dead Sea. This morning take a short drive to visit Little
Petra and the Baidha Neolithic village, hidden away in the
centre of a mountain, with a classical temple standing
guard outside the mini-siq. Although much smaller than
Petra, Baidha is crammed to the brim with tombs, temples
and houses.
En route to the Dead Sea journey over the Heisha mountains to tour Shobak a 12th Century Crusader Castle perched on the side of a rocky mountain, before proceeding to Madaba, to see the world's largest collection of ancient mosaics and visit the St. George Church with its famous 6th Century map of the Holy Land. Continue on to Mt. Nebo, where Moses viewed the Promised Land, here you can take in the wonderful view of the Jordan Valley, Dead Sea, Jericho and (if it's clear) Jerusalem. Finally descend to the Dead Sea - lowest point on the earth's surface, arriving at approximately 16.00hrs and check into your hotel. Take a dip in the unusually warm and incredibly buoyant mineral rich waters and smother yourself in Dead Sea mud. The Dead Sea, renowned for its curative powers and therapeutic qualities, is the world's oldest spa!
Should you wish to drive directly from Petra to the Dead Sea, foresaking some or all of the touring arrangements for the day and allowing more time to relax, this can be arranged.
Overnight: Dead Sea | Breakfast
Dead Sea - Amman. Take a final dip in the dead sea this morning. Hotel check out at noon and transfer to Amman's Queen Alia airport for your onward flight home.
Extend your stay
Consider extending your stay and spending an extra night or two exploring Petra and/or relaxing at the Dead Sea. Additional nights accommodation can be arranged upon request. Please contact our tailor-made team for further details.
Trip Highlights
Not Included
Prices shown are 'per person', based on a travelling party of at least 2 adults. The single supplement price needs to be added to the twin/double price if single rooms are required. If travelling solo, an additional '1-person' supplement will apply.
Prices are indicative and will vary depending on your chosen hotels, room availability as well as time of travel. Please bear this in mind if comparing prices as we always aim to deliver exceptional value.
Please note that discounts will apply if there are more 4 our more people in your travelling party, since fixed costs like transportation and guiding are shared across the group.


text:
Full Speed Ahead for Open Ag Data
This article is cross-posted on the USDA blog
Participants in the G-8 International Conference on Open Data for Agriculture, including US Chief Technology Todd Park, listen to opening remarks by Agriculture Secretary Tom Vilsack in Washington, D.C. on Monday, Apr. 29, 2013. (USDA photo by Bob Nichols)
The foundation for such collaboration was set by President Obama's first ever global development policy which emphasizes broad-based economic growth, innovation, and partnership; and the President's leadership on food security through the L'Aquila Food Security Initiative and Feed the Future. Then, at the 2012 G-8 Camp David Summit, the G-8 nations, African partners, the private sector and civil society launched the New Alliance for Food Security and Nutrition and committed to host a conference focused on sharing relevant data to help advance agriculture and ensure food security for people around the world. At the end of the year, the White House hosted a Global Development Data Jam—the first high-level U.S. Government event to feature the potential of Open Data to address global challenges.
Last week's G-8 "Open Ag Data" conference hosted by the USDA, built on this important groundwork by focusing on ways to ensure that Open Data about agriculture are not only available, but also put to good use. It also highlighted some excellent work that's already underway and making positive change in the Open Ag Data arena, including:
- MFarm has built a mobile application that allows farmers to receive accurate, real-time crop-price information from five major markets in Kenya, via daily text message, six days per week. The service helps farmers to make informed decisions on what to plant when, how to price produce, and where to sell to the largest profit. MFarm is currently refining their service and will soon begin integrating USAID data into their product to help deliver more accurate price information to users.
- INSEAD has introduced Toto Agriculture, a smartphone interface fueled by USAID data that provides village-specific agricultural data. Users can use this free application to access localized information on soil, pests, climate, and planting tips in over 100 languages.
- iPlant: A community driven collaborative of researchers, educators, and students working to enrich all plant sciences through the development of the cyberinfrastructure essential for modern biology. The collaborative can sequence the genome of an individual cow in 3 hours, taking the time of sequencing from months down to hours.
But this is just the beginning. At last week's conference, USDA, USAID, and a number of other entities—both domestic and international—unleashed a host of new datasets, tools, and platforms—with more to come in the weeks and months ahead. For our part, the U.S. Government:
- Launched The Food, Agriculture, and Rural "data community" on Data.gov, which offers more than 300 datasets (and growing!) that relate to the social, economic, and environmental aspects of agriculture. For example, the new community offers Quick Stats—a comprehensive tool for accessing agricultural data profiles by subject area or commodity, such as crops and plants, or livestock. Over the next few months, USDA will make these data available in a robust Application Programming Interface (API) to enable easier sharing of data by third party applications and services.
- The Millennium Challenge Corporation released an open evaluation data catalog that contains household survey metadata from food security programs in Armenia, El Salvador, Ghana, and the Philippines, and more data is coming soon.
- Launched USAID.gov/Developer, a page that curates APIs and datasets specifically for developers looking to scrub in and work with open global development data. APIs include the U.S. Overseas Loans and Grants, or Greenbook, which encompasses all international aid funding allocations. This data will help developers and researchers more dynamically parse these data, that goes all the way back to the Marshall Plan.
We can't wait to see what entrepreneurs, nonprofits, researchers, scientists and others around the world do with these new resources, and what exciting innovations emerge. We're also excited to strengthen our partnership with other countries and the private sector to further liberate data and improve global food security.
The G-8 Open Data for Agriculture Conference was a great start. We look forward to seeing the Open Ag Data movement continue—leveraging data, collaboration, and innovation to accelerate progress toward our food security goals.
There are steps you can take right now to get involved in the Open Ag Data movement:
- Visit the new Food, Agriculture, and Rural data community on Data.gov
- Join the conversation about Open Agriculture Data using the hashtag #OpenAgData on Twitter
- Check out USAID's new Developer Resource Page
- Read a blog and watch a video from the G-8 Open Agriculture Data conference.
Todd Park is the US Chief Technology Officer
Tom Vilsack is the US Secretary of Agriculture
White House Blogs
- The White House Blog
- Middle Class Task Force
- Council of Economic Advisers
- Council on Environmental Quality
- Council on Women and Girls
- Office of Intergovernmental Affairs
- Office of Management and Budget
- Office of Public Engagement
- Office of Science & Tech Policy
- Office of Urban Affairs
- Open Government
- Faith and Neighborhood Partnerships
- Social Innovation and Civic Participation
- US Trade Representative
- Office National Drug Control Policy
- AIDS Policy
- Blueprint for an America Built to Last
- Budget
- Civil Rights
- Defense
- Disabilities
- Economy
- Education
- Energy and Environment
- Equal Pay
- Ethics
- Faith Based
- Fiscal Responsibility
- Foreign Policy
- Grab Bag
- Health Care
- Homeland Security
- Immigration
- Innovation Fellows
- Inside the White House
- Middle Class Security
- Open Government
- Poverty
- Rural
- Seniors and Social Security
- Service
- Social Innovation
- State of the Union
- Taxes
- Technology
- Urban Policy
- Veterans
- Violence Prevention
- White House Internships
- Women
- Working Families
- Additional Issues


text:
Stanley Kutler: Will Netanyahu now force American Jews to choose between the stakes and interests of their own government, or his own political needs and ambitions? Who can doubt the outcome?
The Hoodie Debate: The "Shoot First" Law and Negrophobia
Why This Is Our Time
Michael Sigman: Isn't it precisely the job of political, financial and religious leaders to imagine disasters and then prepare for them? (Plausible ones, that is, as opposed to, say, anti-asteroid Republican Congressman Dana Rohrabacher's crusade for funds to combat "objects coming from space that could cause colossal loss of lives on our planet.") And if their imaginations fail them, and us, shouldn't they be held accountable — morally and, when appropriate, criminally?


text:
Facebook earnings expected to show mobile ad growth
Tracey Samuelson
Jan 30, 2013 As more users check Facebook on their smart phones, its mobile advertising strategy is critical to success.
Facebook's new search; The hunt for 'Red October'
David Brancaccio
Jan 16, 2013 Facebook's new Graph Search feature has rivals like Google and Yelp paying attention to the social media giant. And, a look at a piece of mysterious malware called "Red October" that has been secretly attacking government computer systems for five years.
Facebook takes on Google and Yelp with 'Graph Search'
Queena Kim
Jan 16, 2013 Facebook is getting into the search business. On Tuesday, the social media giant had a press event where it demonstrated its new product, Graph Search. While the feature is still in its infancy, Facebook's announcement has a lot of companies has watching their backs.
Facebook launches search for people, photos, places and interests
Queena Kim
Interview with
Jan 30, 2013 Facebook CEO Mark Zuckerberg announced the rollout of a new, seemingly obvious feature: search. With one billion users and a lot of data, Facebook has a private trove to mine.
Facebook borrows Apple's playbook to hype announcement
Bob Moon
Jan 14, 2013 A mystery invitation to 'come and see what we're building' is generating plenty of buzz for Facebook.
Getting thin with a little help from friends
Stacey Vanek Smith
Jan 9, 2013 Dieters are taking fitness-tracking devices to a new level. They are creating virtual support groups by posting their "body data" on social media networks.
On Facebook, you're for sale
David Weinberg
Dec 21, 2012 Now that it's publicly owned, Facebook needs to generate revenue, so it's looking for more ways to monetize its users.
Facebook tests new paid messaging
Queena Kim
Dec 21, 2012 Facebook started testing a new feature yesterday. For a dollar, a stranger can send you a message that'll land in your directly in your inbox.
Instagram retreats from policy changes
Queena Kim
Dec 21, 2012 The photo sharing app Instagram is retreating from its new privacy policy after users cried foul. How common are such reversals in the tech world?
Backlash against Instagram over photo policy
Queena Kim
Interview with
Dec 19, 2012 The mobile phone app Instagram rose to fame on its filters. There's the 1970s filter, Nashville and Sierra, which give photos an artistic sheen. Now it might be time to add another one: Rage.


text:
My GI doc is semi-retired and only works on Thursdays. I have an appointment with him next Thursday to find out the results of my Celiac blood work and small bowel series (for Crohn's). I'm doing the gluten challenge now, so I'm trying to push taking the blood test as close to my dr. appointment as possible. If I took the blood test Monday or Tuesday would that give the lab enough time to run the tests and report to my GI? The lab is at my local hospital, which is also where my GI practices. Thanks in advance!!
How Long Does It Take For Ema Iga And Ttg Blood Tests To Come In?
Started by KathrynL, Apr 12 2011 08:38 AM
2 replies to this topic
Posted 12 April 2011 - 08:38 AM
- 0
Posted 12 April 2011 - 01:38 PM
I had my blood taken yesterday morning and got results this afternoon. But you may want to call the hospital to be sure they can do it that fast.
- 0
gluten-free March 2011
Failed gluten challenge May 2011
Diagnosed celiac 5/25/11
gluten-free March 2011
Failed gluten challenge May 2011
Diagnosed celiac 5/25/11
Posted 13 April 2011 - 07:49 AM
Thanks so much! I'll call the hospital and ask them. My guess is it'll be close to your experience.
- 0
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users


text:
nablopomo fail?
Oh no, not a fail! I totally wrote this on Friday! Blogger was being weird and wouldn't publish. Probably because everyone else was writing their NaBloPoMo and they were all "Ugh, that Lesleygirl again? She can wait!"
My vivid yet strange dreams are continuing. And once again, I feel like sharing. Unfortunately, this time, no sexing with the Batman. I know. I'm as disappointed as you are, believe me.
Two nights ago, I dreamed I was back at Certain Graduate School (hmm... this may qualify as a nightmare!) but I was the age I am now so I guess I had quit my job and gone back there. Apparently, in my dreams I smoke crack. Anyway, I was at the library of Certain Graduate School and someone stole my very snazzy MacBook Pro laptop! I was, of course, crushed but then the former president of Certain Graduate School felt sorry for me and told me he'd buy me a new one, so off we went to the Apple Store. Let's call the former president DT, since those are his initials and all. In my dream this was at the Rosedale Mall, and when we got there we walked by a karaoke bar in the mall and DT insisted that we go in. I can't remember what we sang, but eventually we made our way to the Apple Store where my new laptop was purchased. The main thing I remember about the dream was that DT dropped a truly astonishing number of f-bombs. I never knew he had it in him, really.
Last night's dream was even more exciting because in that dream? Clementine could talk! And I kept thinking "HOLY SHIT, I HAVE A TALKING CAT!" I mean, sometimes she looks like she has something to say and she's quite conversational, but I didn't think she'd ever speak! The things she said to me in my dream were pretty much like the things I imagine she says now. Things like "Human, feed me!" and "Birds! Squirrels! On my turf!" I woke up and alas, she doesn't talk like she did in my dream, but I have to say that with all her kitty noises, it wouldn't surprise me if she figures out some English one of these days. Stay tuned for further developments.
That's all for now. I'm starting to hate the NaBloPoMo.


text:
JSMon API
JSMon is a website visitor analysis service. JSMon analyzes, tracks, and reports on who is visiting a website and their user behavior. The JSMon API allows developers to access and integrate the functionality of JSMon with other applications. Some example API methods include creating and managing accounts, retrieving user information, and offering promotions to visitors based on behavior.
JavaScript, PHP JavaScript, PHP
API Key
Followers (1)
Developers (0)
Sorry, no developers found for this API.
API Mashups (0)
Sorry, no mashups for this API.
Source Code
Sorry, no source code for this API.
Sorry, no resources found for this API.
Developers (0)
Comments (0)
Followers (1)
Sorry, no mashups for this API.


text:
Tim Cook's up to something, but he still won't say exactly what. In an interview with the Wall Street Journal, Cook says Apple is "closer than it's ever been" to entering a new product category. "You want to take the time to get it right," he said in addition to claiming the upcoming mystery product would be "really great." It could be a smartwatch, it could be a games-centric set-top box, maybe even that rumored TV itself. Whatever it is, you're probably going to want it.
The Nike FuelBand has been a hit with consumers so confusion ensued when CNET reported that Nike had laid off most of their wearable team on Monday. That began to clarify on Tuesday when Geektime reported that Nike is instead teaming with Apple to launch their own wearable, iWatch be damned. Sources familiar with the new venture said that Apple's band will use Nike tech for fitness tracking but will integrate with other devices for functions like gesture controls.
Battery troubles are nothing new for iPhone users, but now it's a problem for Apple themselves. Taiwan's Industrial and Commercial Times has reported that the new "phablet" iPhone, the 5.5-inch model being referred to as the "iPhone air," is being delayed because the company can't find a sufficient battery that fits in the device's super-thin form factor. The 4.7-inch set will reportedly still launch this fall for the annual update, without it's bigger brother.
We've discussed Amazon's 3D phone before, but that's not the only wild feature the handset will reportedly feature. Boy Genius Report reports that the phone will have tilt-activated gesture controls, with the screen displaying different information like icon labels or a Yelp rating. It's not too wild of an idea, as gyroscopes have long been featured in smartphones, but by enabling a different way to display information they also enable new types of features we haven't even thought of yet.
It's a good time to be a Netflix subscriber, but not so good for potential users. The leading streaming service the world over is going to be raising the price of new subscriptions by $1-$2 a month. CEO Reed Hastings said that the company would continue to improve the content library and their exclusive programs with the increased revenue. The streaming giant also hopes to boost growth in global markets, that currently account for around one-third of Netflix subscribers.
There's a Cold War going on between streaming media services and Amazon just fired a shot heard round the world. Beginning May 21 Amazon Prime will stream HBO content like The Sopranos, Six Feet Under and more, as well as launching HBO GO on their new Fire TV. The deal is relatively good for cord-cutters, but there's a hitch: new programs are going to be available on Prime after a three-year window. So no Silicon Valley yet, unfortunately, unless you're using HBO GO. Either way, it's a good time for a Larry Sanders Show marathon.
Users have been clamoring and by the end of the summer Windows 8 will have the classic Start menu back. Sources with knowledge of Microsoft's plans have told The Verge that the second update to Windows 8.1 will land in August with the revamped version of the favorite button. At a demo earlier this month, the company demoed the update, a melding of the old menu and Windows 8's divisive Live Tiles. It might not be the perfect option, but hey, at least they're listening.
"Roads? Where we're going we don't need roads." Just Google Maps, actually, Doc. Mountain View's Street View team has done some wild things before but a new feature announced this week will act as a trip down memory lane, or any other street. The "time machine" feature allows users to view older pictures of the same area in certain areas, a sort of "digital timeline," as Google put it. When can they get me on a hoverboard though? That's the real question.
The future of the Internet will once again be up for discussion in May as the FCC will release the newest draft of their open internet rules. Chairman Tom Wheeler said Wednesday that the new draft would contain most of the same rules, just under a different part of the law. One glaring change though is the proposal to let Internet service providers sell other companies special, pay-to-play access for a "fast-lane" to consumers. After a quick backlash, Wheeler released a statement saying that the FCC is not "gutting" the Open Internet and "the same rules will apply to all internet content." We'll see about that, Wheels.
Facebook gobbled up another app this week continuing an unprecedented run so far this year. Moves, a fitness tracker app, is joining Team Zuck and like Instagram or WhatsApp will continue to operate as a separate entity. Moves not only counts steps, but tracks where you've stopped throughout the day, which could very well be what Facebook acquired it for. We're at the point where Facebook could acquire almost any other company and it wouldn't be a surprise. Why not buy Sega?


text:
*HOT* Elf On The Shelf: Light Skin Boy Or Girl $15.99!!!
Posted by Aimee on January 3, 2013
Right now goHastings has dropped the price of Elf On The Shelf: Light Skin Boy or Girl to $15.99 with $0.96 for shipping.
The kit comes with an elf doll and a book. The book explains that Santa has sent an elf to watch over the children and the elf reports back to Santa each night.
-The children cannot touch the elf or he will lose his magic
-The elf can listen to what the children tell him, but cannot talk back, that's Santa's law.
-The elf flies back to the North Pole each night and tells Santa what he has seen – when he comes back he goes to a new spot in the house.
As your kids get more excited they will start searching for the elf immediately when they wake up and it is a ton of fun finding him in the strangest spots you can imagine!
We rarely see discounts before Christmas so I would grab this deal now if you want it for next years holiday season!


text:
Upcoming My Old Kentucky Blog Presents concert events, powered by Do317.com
Wavves has a yet-to-be titled new album that is scheduled for release this spring on his new label Mom + Pop Music. The album was recorded at Los Angeles' Sonora Studios with production handled by John Hill. You can stream the first track from the LP, "Sail to the Sun", and watch the entertaining BLACK // DOCTOR-directed video for it below.


text:
McFARLANE'S DRAGONS ONLINE FEATURE GOES LIVE
Learn All About These Figures Before They Hit Stores
Friday, January 28, 2005
The long-awaited release of McFarlane's Dragons: Quest for the Lost King action figures is nearly here. This line of six figures (five clamshells plus a deluxe boxed set) will surely change your view of Dragons -- and their origins -- forever.
To pass the time until these figures actually hit your local shelves, spawn.com has put together an online feature sure to make you shake at the wrath of the Dragons.
This special feature highlights the details of each figure, additional never-before-seen photography, packaging shots, QuickTime VR films, special downloads and another neat surprise we've never offered before. Oh, and don't forget that each Dragon features a portion of an all-new McFarlane's Dragon mythos in the package.
McFarlane's Dragons: Quest for the Lost King consists of these figures:Sorcerers Clan DragonEternal Clan DragonWater Clan DragonFire Clan DragonKomodo Clan DragonBerserker Clan Dragon, deluxe boxed setThe Dragons feature is live on spawn.com right now. Click here ... and watch out for the fire.
>> McFARLANE'S DRAGONS FEATURE


text:
Those of us in higher education celebrate the New Year in August. Today, on the eve of Winthrop's Convocation ceremony that heralds the academic New Year, I encourage my colleagues to renew our resolution to ensure that the education we deliver is valuable for our students and our society.
In recent weeks, I've been asked frequently to comment on the cost of higher education. Of course, I try to turn that conversation into a discussion about the value of higher education rather than the cost. But before I make the cost-value flip, I take advantage of the opportunity to explain that there is a direct, inverse relationship between the cost of tuition and fees at public colleges within a state and the funding that state provides to its public colleges and universities.
Consider this: Data from the U.S. Department of Education reveal that South Carolina has the 7th-highest average annual tuition and fees for public higher education and ranks 48th in percentage of institutional revenue provided by state funding. In contrast, Florida has the lowest average tuition costs and the 8th-highest percentage of college revenue that comes from state budgets.


text:
Arup SenGupta, recipient of many honors for his efforts to remove arsenic from drinking water, has added a major award for his more recent fight against fluoride contamination.
On Nov. 15, at the Santa Clara Convention Center in California, SenGupta won a prize from TechAwards, a nonprofit organization founded by multinational corporations in Silicon Valley. The awards ceremony was attended by 1,400 people.
SenGupta, the P.C. Rossin Professor of civil and environmental engineering and also of chemical engineering, won the Intel Environmental Award, one of six 2012 Tech Laureate grand prizes awarded by TechAwards. The award carries a cash prize of $75,000.
TechAwards recognized SenGupta for using technology to transform a water crisis into an economic enterprise. Nearly 500 million people in Africa and Asia drink groundwater with excessive amounts of fluoride. Such contamination has been associated with dental problems, joint pain, limb deformities and other ills.
Tech Awards annually honors entrepreneurs and innovators who apply technology to solve global problems. Awards are given in six categories: Education, Environment, Health, Energy, Economic Development and Young Innovators. More than 700 nominations from over 60 countries were submitted this year.
SenGupta has donated his prize money to the Tagore-SenGupta Foundation (T-S), an organization he started with his students, which supports community projects related to clean water, sanitation and education.
In 2011, T-S won the 2011 Reed Elsevier Environmental Challenge, an international contest that aims to improve people's access to safe and sustainable water.
Reed Elsevier cited SenGupta and his group for their efforts to install in Cambodian villages and schools a system that removes arsenic from groundwater. Developed by SenGupta and his students over the past 16 years, the system—the world's first reusable arsenic-selective adsorbent—is now being used in seven different countries.
Through the Tagore-SenGupta Foundation, SenGupta and his students will use the TechAwards prize to conduct field tests of fluoride mitigation technology that the group developed at Lehigh.
Earlier this year, with the support of a Fulbright Environmental Leadership Award, SenGupta spent six months at the Indian Institute of Science in Bangalore, India.
SenGupta and Surapol Padungthon, a Ph.D. candidate in environmental engineering, have developed an adsorbent that is capable of removing both arsenic and fluoride.
The Fulbright award, titled the Fulbright-Nehru Grant, enabled SenGupta to work with scientists and engineers in India to streamline the development of the adsorbent through laboratory and field work in areas of India whose groundwater is contaminated with fluoride or arsenic.


text:
Laura Ryan
Jan. 31, 2013
ATHENS, Ga. --- Georgia's Laura Ryan has been chosen as one of the 26 divers named to the Olympic Performance Squad, according to an announcement by USA Diving.
The Olympic Performance Squad is made up of divers with the skill and potential to advance to the 2016 Games in Brazil. A review of the OPS is conducted at the end of each year, during which divers are evaluated on their overall competition performance and their dedication to their daily training. OPS members were selected based on performances the last two years or those who have been deemed as synchronized specialists by the High Performance Director.
Ryan, a junior from Elk River, Minn., won gold medals in synchro platform at the USA Diving Winter Nationals in 2010 and 2012 and the AT&T National Championships in 2010 as well as in 3-meter synchro at the 2012 National Championships. She also medaled at the 2011 Winter Nationals and the 2012 USA Diving Grand Prix in synchro events and the 2012 National Championships on 3-meter springboard.
Ryan has Georgia's top efforts this season on both springboards and on platform, with NCAA Zone qualifying scores on all three boards. Ryan boasts the SEC's top score on platform this year and she is the only diver in the league in the top four on each board.
Ryan and the Georgia squads will take on Alabama and South Carolina in Tuscaloosa on Saturday at noon.


text:
- Willamette
- News
- News Archive
- 2002
- March
- PaCE Program at Willamette Helps Area Non-Profits for 4th Year
Current News
PaCE Program at Willamette Helps Area Non-Profits for 4th Year
What do Habitat for Humanity, coloring books, antennae balls and greeting cards have in common? For a brief time anyway, they were all the focus of the PaCE Project at the Atkinson Graduate School of Management at Willamette University.
PaCE stands for the Private, Public and Community Enterprise Project organized by teams of Atkinson graduate students who develop both a business plan and a plan for community service in cooperation with a local non-profit organization. The students create and market a product or service in cooperation with a non-profit agency and then donate the proceeds and substantial volunteer hours to their non-profit partner.
PaCE has a history of returning substantial profits to non-profit partners. In 1999-00, three enterprises contributed net revenues totaling more than $17,000 to the YMCA, the Garten Foundation and Shangri-La. In 2000-01, three enterprises contributed net revenues in excess of $5,800 and 1,100 hours of volunteer work to Habitat for Humanity, Easter Seals Children's Guild and the YMCA. Commercial ventures included an Oregon-based recipe book, a jazz music compact disc and a service that taught seniors to use the web.
The four teams all had to apply for capital start-up loans through Marion and Polk Schools Credit Union, which offer loans to the PaCE program of up to $6,000. PaCE students also enroll concurrently in year-long courses that cover those issues likely to surface during their PaCE partnerships like organization theory and behavior, human resource management, and negotiation, marketing, government-business relationships, and international management.
This year the teams were The Phoenix Group, which provided consulting services and volunteered hours to the Salem Area Habitat for Humanity; Mill Stream Publishing created a bilingual activity/coloring book and partnered with the Salem Outreach Shelter where they helped tutor, developed a business plan and provided manual labor at the shelter.
AB Promotions marketed antennae balls to organizations that displayed that organization's logo. They partnered with the YMCA and helped with Teen Center activities, fundraising, event planning and facilitation. Finally, Oregon Inspirations created greeting cards with photos of Oregon scenery. This team partnered with MedAssist and helped offices in Salem Hospital with brochure development and market analysis.
This year's final PaCE presentations are scheduled for April 1. During these 20-minute presentations, the graduate students will share the results of their respective projects and will present participating non-profit organizations with checks and a final count for the volunteer hours generated by the teams.
The theory behind PaCE is that direct experience is the best teacher. "Student understanding of management concepts improves because their projects show them how disciplinary skills fit together," said Alison Hohengarten, Atkinson assistant dean. "Trial-and-error problem solving improves their retention and the reality of the problems helps students see the applications of new ideas and approaches to other settings."
She added, "Students also develop better interpersonal and team skills because they must coordinate the efforts of up to 25 people. They gain confidence and insight into alternative career paths in management, and on occasion, continue their profitable enterprises."
For more information, contact Hohengarten at firstname.lastname@example.com or visit the Atkinson Graduate School of Management.