text:
A peer-to-peer method and system for performing and managing backups in a network of nodes exploit excess disk capacity to perform peer-to-peer backup with no administrative costs. Each node minimizes storage overhead by selecting peer nodes that share substantial amounts of data. Common installations find suitable peer nodes and peer nodes with high overlap are identified. The method and system also provide mechanisms for confidentiality, integrity, and detection of failed or malicious peer nodes.
1. A peer-to-peer method for performing and managing backups in a network of nodes which form a cooperative collection of machines having excess storage capacity, the method comprising:
(a) determining a plurality of peer nodes from the network of nodes for a first node of the network based on an amount of stored data common to both the first node and each of the plurality of peer nodes; and
(b) storing a backup copy of data unique to the first node on each of the plurality of peer nodes so that each of the plurality of peer nodes stores a substantially complete backup of the first node.
2. The method as claimed in
3. The method as claimed in
4. The method as claimed in
5. The method as claimed in
6. The method as claimed in
7. The method as claimed in
8. The method as claimed in
9. The method as claimed in
10. The method as claimed in
11. The method as claimed in
12. The method as claimed in
13. The method as claimed in
14. The method as claimed in
15. The method as claimed in
16. The method as claimed in
17. A peer-to-peer system for performing and managing backups in a network of nodes which form a cooperative collection of machines having excess storage capacity, the system comprising:
means for determining a plurality of peer nodes from the network of nodes for a first node of the network based on an amount of stored data common to both the first node and each of the plurality of peer nodes; and
means for storing a backup copy of data unique to the first node on each of the plurality of peer nodes so that each of the plurality of peer nodes stores a substantially complete backup of the first node.
18. The system as claimed in
19. The system as claimed in
20. The system as claimed in
21. The system as claimed in
22. The system as claimed in
23. The method as claimed in
24. The system as claimed in
25. The system as claimed in
26. The system as claimed in
27. The system as claimed in
28. The system as claimed in
29. The system as claimed in
30. The system as claimed in
31. The system as claimed in
32. The system as claimed in
[0001] This application claims the benefit of U.S. Provisional Patent Application Serial No. 60/424,831, filed Nov. 8, 2002.
[0002] 1. Field of the Invention
[0003] This invention relates to a peer-to-peer methods and systems for performing and managing backups in a network of nodes.
[0004] 2. Background Art
[0005] Backup is cumbersome and expensive in time and equipment. Machines are backed up rarely, if at all. Most users believe that backup is more trouble than it is worth. Internet backup services exist, but are costly. For example, Connected TLM offers individual users backup of up to 4 GB—but covers neither applications nor the operating system—for $15 per month. Machines within an organization can be backed up centrally, but at significant cost. For example, the computer support arm of the University of Michigan's College of Engineering provides backup service for up to 8 GB on a single machine for $30 per month.
[0006] Such cost and inconvenience are unavoidable. Small-scale solutions require significant administrative efforts. Large-scale solutions require aggregation of substantial demand to justify the capital costs of a large, centralized repository.
[0007] There is increasing recognition that disks better serve the needs of near-line archival storage. The purchasing cost of disk subsystems has caught up with tape, and disks provide better access and restore time. At the same time, the conventional wisdom that data expands to fill storage is proving to be untrue. Furthermore, the amount of newly written data per client per day is a small fraction of the total file system. Several systems take advantage of low write traffic in the presence of excess storage capacity.
[0008] Backup is critical to fault tolerance and recovery in practical systems, yet there is a surprisingly small amount of literature on the topic. Current commercial systems focus on large, centrally-managed repositories.
[0009] Several projects have suggested the use of peer-to-peer routing and object storage systems as a substrate for backup, including Chord, Freenet, and Pastry, as described in the following respective articles:
[0010] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," in Proceedings of the ACM SIGCOMM 2001 Conference, pages. 149-160, San Diego, Calif., August 2001;
[0011] I. Clarke, S. G. Miller, T. W. Hong, O. Sandberg, and B. Wiley, "Protecting Fee Expression Online with Freenet," IEEE Internet Computing, 6(1):40-49, 2002; and
[0012] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems," in IFIP/ACM International Conference on Distributed Systems Platforms, pages 329-350, Heidelberg, Germany, November 2001.
[0013] File systems built on them provide protection against machine failure. However, they do not protect against human error, nor do they provide the ability to retrieve prior versions of files once replaced. OceanStore, a global storage utility, does provide these benefits, but the decision of which versions to retire rests with the utility, not its clients, as described in S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon, and J. Kubiatowicz, "Maintenance-Free Global Data Storage," IEEE Internet Computing, 5(5):40-49, September 2001.
[0014] The pStore cooperative backup system, built on top of Chord, uses a variant of a fine-grained scheme, as described in C. Batten, K. Barr, A. Saraf, and S. Trepetin, "pStore: A Secure Peer-to-Peer Backup System," unpublished report, MIT Laboratory for Computer Science, December 2001. However, it does not exploit inter-host sharing, nor does it address the problem of hosts falsely claiming to store data.
[0015] A cooperative backup scheme that requests random blocks from partners, but assumes that partners either drop all or none of the archived state is described in S. Elnikety, M. Lillibridge,. M. Burrows, and W. Zwaenepoel, "Cooperative Backup System," in The USEINIX Conference on File and Storage Technologies, Monterey, Calif., January 2002, work-in-progress report.
[0016] A number of systems exploit duplicate data across files and machines to minimize the costs of archival storage. The Single Instance Store detects and coalesces duplicate files, while Venti divides files into fixed-size blocks and hashes those to find duplicate data, as described in W. J. Bolosky, S. Corbin, D. Goebel, and J. R. Douceur, "Single Instance Storage in Windows 2000," in Proceedings of the 4th USENIX Windows Systems Symposium, pages 13-24, Seattle, Wash., August 2000, and S. Quinlan and S. Dorward, "Venti: A New Approach to Archival Storage," in Proceedings of the USENIX Conference on File and Storage Technologies, pages 89-102, Monterey, Calif., January 2002, respectively. Neither of these approaches can take advantage of small edits that move data within a file, as content-based indexing does. Other sophisticated techniques for detecting such changes exist, but must be run on pairs of files that are assumed to have overlap.
[0017] Rather than exploit redundancy, one can instead turn to the use of erasure codes to stripe data across several replicas. Such codes allow for low-overhead replication, and are tolerant of the failure of one or more replicas. Their main shortcoming is that they require the participation of more than one node for restore.
[0018] A snapshot primitive may be exposed for a variety of purposes, including backup. Typically, snapshots are used to stage data to archival media other than disk. A snapshot mechanism may be leveraged to provide fine-grained, remote disk mirroring with low overhead.
[0019] Pastry, a peer-to-peer network, provides scalable, self-administered routing and node location. As previously described, content-based indexing provides flexible discovery of redundant data, as described in A. Muthitacharoen, B. Chen, and D. Mazi�res, "A Low-Bandwidth Network File System," in Proceedings of the 18th ACM Symposium on Operating Systems Principles, pages 174-187, Banff, Canada, October 2001.
[0020] Convergent encryption allows two hosts to share the same physical storage of a common block in the presence of separate encryption keys, as described in W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer, "Feasibility of a Serverless Distributed File System Deployed on an Existing Set of Desktop PCs," in Proceedings of the International Conference on Measurement and Modeling of Computer Systems, pages 34-43, Santa Clara, Calif., June 2000.
[0021] An object of the present invention is to provide a peer-to-peer method and system for performing and managing backups in a network of nodes in an easy and relatively inexpensive fashion.
[0022] In carrying out the above object and other objects of the present invention, a peer-to-peer method for performing and managing backups in a network of nodes which form a cooperative collection of machines having excess storage capacity is provided. The method includes: (a) determining a plurality of peer nodes from the network of nodes for a first node of the network based on an amount of stored data common to both the first node and each of the plurality of peer nodes, and (b) storing a backup copy of data unique to the first node on each of the plurality of peer nodes so that each of the plurality of peer nodes stores a substantially complete backup of the first node.
[0023] The method may further include repeating steps (a) and (b) above for each of the other nodes of the network so that a plurality of substantially complete backups are stored on a plurality of peer nodes for each of the nodes of the network.
[0024] The step of determining may be based on network distance that each of the plurality of peer nodes is from the first node.
[0025] At least one of the plurality of peer nodes may be a local peer node to reduce network load and improve restore performance.
[0026] At least one of the plurality of peer nodes may be a remote peer node to provide geographic diversity.
[0027] Data may be stored in the first and peer nodes as chunks of data.
[0028] The method may further include monitoring the plurality of peer nodes to determine if a peer node is no longer capable of providing a backup to the first node and repeating steps (a) and (b) to determine a replacement peer node from the network of nodes and to store a backup copy of data unique to the first node on the replacement peer node.
[0029] The step of monitoring may be performed statistically.
[0030] The method may further include preventing a forged request to drop a backup copy from one of the peer nodes.
[0031] The data may be stored in the peer nodes as encrypted chunks.
[0032] The data may be encrypted by a key derived from the data stored in the peer nodes. The key may be encrypted. The key may be encrypted by a key-encrypting key stored with the data.
[0033] The data may be stored in the peer nodes as chunks of encrypted data wherein each of the encrypted chunks includes data which represents a set of nodes having an interest in the encrypted chunk.
[0034] The method may further include determining when the first node is decommissioned and reclaiming storage space on the peer nodes associated with the decommissioned node.
[0035] The method may further include determining whether a node of the network claiming to be a peer node is a peer node.
[0036] Further in carrying out the above object and other objects of the present invention, a peer-to-peer system for performing and managing backups in a network of nodes which form a cooperative collection of machines having excess storage capacity is provided. The system includes means for determining a plurality of peer nodes from the network of nodes for a first node of the network based on an amount of stored data common to both the first node and each of the plurality of peer nodes. The system further includes means for storing a backup copy of data unique to the first node on each of the plurality of peer nodes so that each of the plurality of peer nodes stores a substantially complete backup of the first node.
[0037] The means for determining may determine a plurality of peer nodes from the network for each of the nodes of the network and the means for storing may store a backup copy of data unique to each of the nodes of the network on each of its plurality of peer nodes so that a plurality of substantially complete backups are stored on a plurality of peer nodes for each of the nodes of the network.
[0038] The means for determining may determine the plurality of peer nodes based on network distance that each of the plurality of peer nodes is from the first node.
[0039] The method may further include means for monitoring the plurality of peer nodes to determine if a peer node is no longer capable of providing a backup to the first node, wherein the means for determining determines a replacement peer node from the network of nodes and wherein the means for storing stores a backup copy of data unique to the first node on the replacement peer node.
[0040] The means for monitoring may monitor the plurality of peer nodes statistically.
[0041] The system may further include means for preventing a forged request to drop a backup copy from one of the peer nodes.
[0042] The system may further include means for determining when the first node is decommissioned and means for reclaiming storage space on the peer nodes associated with the decommissioned node.
[0043] The system may further include means for determining whether a node of the network claiming to be a peer node is a peer node.
[0044] The above object and other objects, features, and advantages of the present invention are readily apparent from the following detailed description of the best mode for carrying out the invention when taken in connection with the accompanying drawings.
[0045]FIG. 1 is a schematic block diagram of a network of nodes or machines such as computers to which the present invention is applicable;
[0046]FIG. 2 is a schematic block diagram which illustrates how chunks are stored and named; a cleartext chunk is hashed, producing its handle; the handle is used for key generation, and hashed again to produce the chunkId; the chunk is stored encrypted by the key and named by the chunkId; and
[0047]FIG. 3 is a block diagram flow chart illustrating one embodiment of the method of the present invention.
[0048] By way of introduction, the method and system of the present invention typically uses excess disk capacity within a network of machines or nodes such as computers for efficient, effective, and administration-free backup, as shown in FIG. 1. The nodes form a cooperative collection of machines that provide mutual backup services. Because individual machines may come and go, each node replicates its archival data on more than one peer. Most of these replicas are placed nearby to ease network overhead and minimize restore time, though at least one replica should be elsewhere to guard against catastrophe.
[0049] Much of the data on a given machine is not unique, and is generated at install time. For most machines, common data will be shared widely. For example, the default installation of Office 2000 Professional requires 217 MB; it is nearly ubiquitous and different installations are largely the same. Randomly grouping disparate file systems and coalescing duplicate files products substantial savings. The present invention identifies systems with substantial overlap to increase this savings.
[0050] The data of the present invention is stored in a chunkstore file system, enabling sharing of common data without undue performance penalties. An individual node preferably uses two Pastry overlays to find backup buddies or peers that have substantial data in common and have desirable locations. When a backup snapshot is taken, the node ships only unique data to its buddies. The present invention also prevents forged requests to drop snapshots, but buddies are free to drop them in the event of a local space crisis. The invention typically employs probabilistic mechanisms to detect unfaithful buddies and to reclaim backup space belonging to decommissioned nodes.
[0051] An evaluation of a prototype of the invention shows that it induces a low percentage overhead on a modified Andrew Benchmark, despite storing files in chunks. An examination of file system data shows that tens of chunks can discriminate between backup buddies with good and poor overlap. Simulations show that nodes of the present invention with common installations can easily find desirable buddies. Analytical results show that such a node can detect corrupted backup state with high probability by checking a very low percentage of all chunks.
[0052] Enabling Technologies
[0053] One embodiment of the present invention preferably depends on three enabling technologies. The first is Pastry, a scalable, self-organizing, peer-to-peer routing and object location infrastructure. The second is content-based indexing, a technique that finds common data across different files. The third is convergent encryption, which enables sharing without compromising privacy. The three technologies are described in the articles noted above.
[0054] Peer-to-Peer Routing
[0055] The present invention eschews the use of a centralized authority to manage backup sites. Such an authority would act as a single point of control, limiting scalability and increasing expense. Instead, one embodiment of the present invention relies on Pastry, a scalable, self-organizing, routing and object location infrastructure for peer-to-peer applications.
[0056] Each Pastry node is given a nodeId; the set of all nodeId's are expected to be uniformly distributed in the nodeId space. Any two Pastry nodes have some way of measuring their proximity to one another. Typically, this metric captures some notion of network costs.
[0057] Each node N maintains three sets of state: a leaf set, a neighborhood set, and a routing table. The leaf set consists of L nodes; L/2 are those with the closest but numerically smaller nodeIds, and L/2 are the closest but larger ones. The neighborhood set of M-nodes contains those closest to N according to the proximity metric.
[0058] The routing table supports prefix routing. There is one row per digit in the nodeId space.
[0059] Pastry nodeIds are not necessarily decimal numbers; the base used is a configuration parameter of the Pastry network. Pastry's recommendation is followed and hexadecimal digits are used.
[0060] The first row contains a list of nodes whose nodeIds differ from this one's in the first digit; there is one entry for each possible digit value. The second row holds a list of nodes whose first digit is the same as this one's, but whose second digit differs. To route to an arbitrary destination, a packet is forwarded to the node with a matching prefix that is at least one digit longer than that of the current node. If such a node is not known, the packet is forwarded to a node with an identical prefix, but that is numerically closer to the designation in nodeId space. This process proceeds until the destination node appears in the leaf set, after which it is delivered directly. The expected number of routing steps is log N, where N is the number of nodes.
[0061] Many positions in the routing table can be satisfied by more than one node. When given a choice, Pastry records the closest node according to the proximity metric. As a result, the nodes in a routing table sharing a shorter prefix will tend to be nearby because there are many such nodes. However, any particular node is likely to be far away.
[0062] Pastry is self-organizing; nodes can come and go at will. To maintain Pastry's locality properties, a new node must join with one that is nearby according to the proximity metric. Pastry provides a seed discovery protocol that finds such a node given an arbitrary starting point.
[0063] Content-Based Indexing
[0064] To minimize storage overhead, the present invention finds redundant data across versions of files, files in a system, and files on distinct machines. Rsync and Tivoli employ schemes for finding common subsets in two versions of (presumably) the same file. However, these techniques cannot easily capture general sharing. In contrast, LBFS uses content-based indexing to find common data in arbitrary files efficiently.
[0065] The challenge is to find sharing—and hence structure—across seemingly unrelated files without knowing the underlying structure. Content-based indexing accomplishes this by identifying boundary regions, called breakpoints, using Rabin fingerprints. A fingerprint is computed for each overlapping 48-byte substring in a file. If the low-order bits of a fingerprint match a predetermined value, that offset is marked as a boundary. Boundaries divide files into chunks. Since boundaries are purely content-driven, editing operations change only the chunks they touch, even if they change offsets.
[0066] Each chunk is named by taking a SHA-1 hash of its contents. The probability that two different chunks will hash to the same value is much lower than the probability of hardware errors. It is therefore customary to assume that chunks that hash to the same value are in fact the same chunk, and the present invention adopts this custom.
[0067] Sharing With Confidentiality
[0068] A well-chosen backup buddy already has much of a node's data, even before the first backup. However, the present invention should guarantee the confidentiality and integrity of its participants' data. If clients are free to choose their own cryptographic keys, chunks with identical content will be represented differently, precluding sharing.
[0069] The Farsite file system solves this problem with convergent encryption. Under convergent encryption, each file is encrypted by a key derived from the file's contents. Farsite then encrypts the file key with a key-encrypting key, known only to the client; this key is stored with the file. As a file is shared by more clients, it gains new encrypted keys; each client shares the single encrypted file.
[0070] If a node backs up a new chunk not already stored on a backup buddy, the buddy cannot discover its contents after shipment. However, if the buddy has that chunk, it knows that the node also stores that data. The invention allows this small information leak in exchange for increased storage efficiency.
[0071] Design
[0072] The data of the present invention is stored on disk as encrypted chunks. Chunks carry owner lists, which name the set of owners with an interest in this chunk. Chunks may be stored on a node's disk for the node itself, a backup client, or both. Chunks are immutable, and each chunk persists until no node holds a reference to it. The invention ensures that only rightful owners are capable of removing a reference to (and possibly deleting) a chunk.
[0073] When a newly written file is closed, its data is indexed to discover its chunk boundaries. Each chunk.c is hashed; the result is called the chunk's handle, Hc. Each handle is used to generate a symmetric encryption key, Kc, for its chunk. The handle is hashed again to determine the public chunkId, Ic, of the chunk. Each chunk is stored on disk encrypted by Kc and named by its chunkId. This process is illustrated in FIG. 2.
[0074] After creating the list of chunkIds representing a new file, the invention checks to see if any of those chunks already exist. If so, the local host is added to the owner list if necessary, and the local reference count is incremented. Otherwise, the chunk is encrypted, a message authentication code is appended, and the chunk is written out to disk, with a reference count of one for the local owner. This process is deferred to avoid needless overhead for files with short lifetimes, at the cost of slightly weaker persistence guarantees. The list of chunkIds that describes a node's current file system is called its signature.
[0075] Data chunks are immutable. When a file is overwritten, its set of constituent chunks may change. Any chunks no longer part of the file have their local owner's reference count decremented; if the reference count drops to zero, the local owner is removed. If the owner list becomes empty, the chunk's storage is reclaimed. File deletion is handled similarly.
[0076] The meta-data for a file contains the list of handles for the chunks comprising that file, plus the usual contents: ownership, permissions, creation and modification times, etc. The handles in this list are used to derive the decryption key and chunkId for each constituent chunk. Meta-data objects are encrypted to protect the handle values and hence cryptographic keys. Meta-data objects include the nodeId of the node on which they were created plus a sequence number, ensuring that logically distinct meta-data objects will not hash to the same value.
[0077] Unlike data, meta-data is not chunked and it is mutable. The present invention does not chunk meta-data because it is typically small and unlikely to be widely shared. Meta-data is mutable to avoid cascading writes. Each write to a file changes its constituent chunkIds. If meta-data were immutable, the present invention would have to create a new meta-data object for this file with a new name. This new name would have to be added to the enclosing directory, which would also change, and so on to the file system root. Instead, the Hc, Kc, and Ic for a file's meta-data are computed only at file creation time, and are re-used thereafter.
[0078] The meta-data object corresponding to a file system root is treated specially: its Hc is generated by a host-specific passphrase. As explained hereinbelow, this passphrase plus the machine's name is all that is required to restore a machine from scratch.
[0079] Chunks that are part of some node's backup state include that host in their owner list. Remote hosts supply a public key with their backup storage requests. Requests to remove references must be signed by the corresponding secret key, otherwise those requests are rejected.
[0080] Fingerprints: Finding Redundancy
[0081] Much of the long-lived data on a machine is written once and then never overwritten. Observations of file type and volume ownership suggest that the amount of data written thereafter will be small. In other words, the signature of a node is not likely to change much over time. Therefore, if all data had to be shipped to a backup site, the initial backup of a freshly installed machine would likely be the most expensive.
[0082] An ideal backup buddy for a newly-installed node is one that holds a superset of the new machine's data; machines with more complete coverage are preferred to those with less. One simple way to find such nodes is to ship the full signature of the new node to candidate buddies, and have them report degree of overlap.
[0083] Unfortunately, signatures are large: 20 bytes per chunk. Since expected chunk size is 16 KB, signatures are expected to cost about 1.3 MB per GB of stored data. If this cost were paid only once, it might be acceptable. However, a node's buddy set can change over time as buddies are found to be unreliable or as the degree of overlap changes.
[0084] Rather than send a full signature, nodes of the present invention typically send a small, random subset of their signatures called a fingerprint. This is motivated by the following observation. Most data on disk belongs to files that are part of a much larger logical entity. For example, a Linux hacker with the kernel source tree has largely the same source tree as others working on the same version. Any machine holding even a small number of random chunks in common with this source tree is likely to hold many of them. Preliminary experiments show that tens of chunkIds are enough to distinguish good matches from bad ones.
[0085] Overlays: Finding a Set of Biddies
[0086] All of a node's buddies or peers should have substantial overlap with that node to reduce storage overhead. In addition, most buddies should be nearby to reduce global network load and improve restore performance. However, at least one buddy should be located elsewhere to provide geographic diversity. The present invention uses two Pastry overlays to facilitate buddy discovery. One is organized by network proximity, the other by file system overlap.
[0087] Every node of the present invention typically joins a Pastry overlay organized by network distance. Its nodeId is a hash of the machine's fully-qualified domain name. Once it has joined, the new node picks a random nodeId and routes a discovery request to that node. The discovery request contains the new node's fingerprint. Each node encountered on the route computes its coverage, the fraction of chunks in the fingerprint stored locally, and returns it.
[0088] Due to Pastry's route maintenance mechanisms, a probe is expected to generate log N potential candidates. The first candidates encountered are likely to be nearby, while the last few discovered are likely to be far away. If the initial probe does not generate a sufficient candidate set, the probe process is repeated. Subsequent probes are not generated by random nodeId selection. Instead, these probes vary the first digit of the original nodeId. Since Pastry uses prefix routing, each subsequent probe will generate sets of candidates disjoint from those already examined. This rotating probe is called a "lighthouse sweep." Nodes with common installations should easily find others with high coverage rates and can choose among them to generate a balance between local and remote nodes. Rare installations will have more difficulty. Nodes that do not find an adequate set during a lighthouse sweep join a second overlay, called the coverage-rate overlay. This overlay uses fingerprint coverage rather than network hops as the distance metric.
[0089] When a node joins the coverage-rate overlay, a seed discovery algorithm finds a candidate node with good overlap. The new node then chooses backup buddies from its Pastry neighbor set. Recall that the neighbor set of a node consists of the M nodes closest to this node according to the distance metric. Since these nodes are chosen for their degree of fingerprint coverage, they will have the best overlap available. On the other hand, the nodes are not likely to be near the newly joined one.
[0090] The use of coverage rate as a distance metric has interesting applications for Pastry. Like network distance, coverage rate does not obey the triangle inequality. However, the present invention typically only considers nodes in the neighbor set, restricting searches to single hops. Unlike network distance, coverage rate is not symmetric; if A holds all of B's files, the converse is probably not true. This means that an individual node must build its routing state based on the correct perspective. Likewise, the seeding algorithm should be supplied with the new node's fingerprint, so that it can compute coverage from the correct point of view.
[0091] It is possible for a malicious node to habitually under- or over-report its coverage. If it under-reports, it can avoid being selected as a buddy. If it over-reports, it can attract unsuspecting clients only to discard their backup state. Unfortunately, this is possible no matter who computes coverage rates. An honest node can be given a random list of chunkIds as a fingerprint; such a fingerprint is unlikely to match anything. Likewise, a malicious node can cache and report fingerprints sent by others with commonly-appearing chunkIds, hoping for a false match.
[0092] Backup Protocol
[0093] A node of the present invention typically has full control over what, when, and how often to back up. Each discrete backup event is viewed as a single snapshot. Nodes can subscribe to a calendar-based cycle, a landmark-based scheme, or any other schedule. Because a machine is responsible for its own archival plan, it also keeps a meta-data skeleton for each retained snapshot. A file that is not part of the local machine's current file system but is part of one or more archived snapshot has a corresponding meta-data entry stored on the local machine. The skeleton for all retained snapshots is stored as a collection of per-file logs, similar to WAFL's snapshot mechanism.
[0094] The state necessary to establish a new snapshot consists of three things: the chunks to be added to the backup store, the list of chunks to be removed, and the meta-data objects that change in the skeleton as a result. These are called the add set, delete set, and meta-data list.
[0095] The snapshot process begins by shipping the host's public key. This key will be associated with any new chunks to validate later requests to delete or replace them. The snapshot node then forwards the chunkIds for elements of the add set. If any of those chunks are not already stored on the buddy, the buddy fetches the chunks from the node.
[0096] Next, the node sends the delete list. The snapshot host adds a chunkId to the delete list only if it does not belong to any snapshot the client wishes to retain. The delete list should be signed, and this signature is checked to ensure it matches the public key associated with any chunks scheduled for deletion. Deletion is not effected immediately. It is deferred to the end of the snapshot process.
[0097] Finally, the snapshot node sends any changed meta-data chunks. Since they may overwrite old meta-data chunks, their chunkIds must also be signed. When all state has been transferred, the checkpoint host requests a commit of the checkpoint. Before responding, the buddy should ensure that all added chunks, changed meta-data objects, and deleted chunkIds are stored persistently. Once that is complete, the buddy can respond, and later apply the new snapshot by performing deletions and overwrites.
[0098] The performance of snapshots is not crucial, since they are largely asynchronous. The only exception is marking the chunkstore copy-on-write, which should be done synchronously. However, as with AFS's volume clone operation, this is inexpensive. The load induced on a buddy by the backup protocol can be regulated explicitly with resource containers or implicitly with progress-based mechanisms.
[0099] If either party fails during the snapshot process, it can be restarted. The most expensive phase—shipping new data chunks—makes progress even in the presence of failures, since new chunks are stored as they arrive. After the new snapshot is applied, a faithful buddy will have a complete copy of the meta-data skeleton, plus all data chunks the skeleton names.
[0100] Restoration
[0101] A node of the present invention typically retains its archive skeleton, so performing partial restores is straightforward. The node identifies which chunks correspond to the restore request, and obtains them from the nearest of its buddies.
[0102] Recovering from disaster requires a way to boot-strap the skeleton. To do so, a node of the present invention keeps a copy of its root meta-data object on each member of its network-distance leaf set. When a machine recovers from disaster, it rejoins the distance-based overlay with the same nodeId, which is computed from its host name. It then obtains its root node from one of its leaves, and decrypts it with the key generated from the host's passphrase. Since the root block contains the set of buddies in effect when it was replicated, the node can recover all other state.
[0103] Failure, Malice, and Greed
[0104] A buddy is expected to retain backup snapshots, but is not absolutely required to do so. When faced with a sudden disk space crisis or a widespread OS and application upgrade, a buddy is free to reclaim space. Furthermore, a buddy may fail or be connected intermittently, leaving its ability to serve future restore requests in doubt. Finally, a malicious buddy may claim to store chunks without actually doing so.
[0105] The present invention preferably employs a probabilistic mechanism to detect all of these situations. Each node periodically asks buddies for a random subset of chunks from the node's archive. By requesting a modest number of chunks, clients can bound the probability that compromised backup state goes undetected. Savvy users of traditional backup schemes already employ this technique as an end-to-end confirmation of correctness.
[0106] This technique assumes that malicious hosts cannot directly collude. This is reasonable, since only the host knows who its buddies are. However, a malicious party can register a large number of nodes in the nodeId space to increase its chances of serving as more than one replica. Defending against such Sybil attacks in practice requires some centralized agency to certify identities.
[0107] If a buddy cannot produce data it claims to hold, the client removes it from its buddy list. If a buddy has not responded for a significant period of time, the client likewise removes it. When a node loses a buddy, it searches for a new one, as previously described and instantiates a replica of its archive there.
[0108] One embodiment of the method and system of the present invention which is shown in FIG. 3 in block diagram form, leverages this mechanism to detect snapshots belonging to decommissioned machines. Each buddy knows that its corresponding host does not fully trust it to store chunks. So, the buddy expects to be probed periodically. If a buddy does not hear from its corresponding host for an exceptionally long period, it can assume that the host has either been decommissioned or re-installed. This decision should be made conservatively, or a long-lived failure could be mistaken for a voluntary removal.
[0109] Conclusion
[0110] The method and system of the present invention enables automatic backup with no administrative costs, using only excess disk capacity among a set of cooperating peers. Since the invention matches nodes with substantial data in common, this excess capacity can be relatively modest. These peers may be selected through the use of complimentary peer-to-peer overlay networks, one organized by network distance, the other by degree of data held in common. The self-organizing nature of these overlays, combined with mechanisms to detect failed or malicious peers, provides backup without user or administrator intervention.
[0111] Evaluation of the prototype of the invention demonstrates that this service is provided without penalizing file system performance. Simulations confirm the effectiveness of node discovery, while analysis shows that detecting malicious hosts requires only modest resources. The present invention lowers the barriers to backup so that all data can be protected, not just that judged to be worthy of the expense and burden of current schemes.
[0112] While embodiments of the invention have been illustrated and described, it is not intended that these embodiments illustrate and describe all possible forms of the invention. Rather, the words used in the specification are words of description rather than limitation, and it is understood that various changes may be made without departing from the spirit and scope of the invention.
Referenced by
Legal Events
Original Image


text:
Staff Reporter
BANGALORE: The Cyber Crime Police Wing of the Corps of Detectives (CoD) in Bangalore has arrested an employee of a BPO (business process outsourcing) firm who allegedly misappropriated huge sums from the bank accounts of customers in the U.K. by using confidential data.
Sources in the CoD told The Hindu that after arresting Nadeem Hameed Kashmiri, a police team took him to certain places to recover cash and property.
In a complaint to the Cyber Police Station on June 22, HSBC Electronic Data Processing India Pvt. Ltd. on Bannerghatta Road, said that Nadeem allegedly accessed personal details and debit card information of a few of its customers in the U.K.
The company alleged that he passed on the information to "accomplices" for conducting fraudulent transactions through ATM, debit cards and telephone banking services at Nadeem's behest. The bank estimated that the accused misappropriated over £ 2,33,000.
A case was registered under Sections 66 and 72 of the IT Act read with Sections 408, 468 and 420 of the IPC.
The alleged fraud surfaced when over 20 bank customers in the U.K. complained to the bank about transfer of money from their accounts without their knowledge. When the bank conducted an investigation, Nadeem was found to be the "main culprit". The company alleged that Nadeem helped his accomplices to impersonate customers to enable them to cheat the company and HSBC customers.
It found that when Nadeem joined the company on December 12, 2005, he allegedly provided false records. The company said he did not mention his earlier employment with Accenture, and provided "false" references.

subset: commoncrawl


text:
Welcome To Spirit HalloweenX
Thank you for signing up to receive Spirit Halloween emails!
You will now be eligible to receive special email offers and discounts.
So Much Fun It's Scary!® - Only Days Until HALLOWEEN!
Halloween Costumes / DECORATIONS / PUMPKIN CARVING / Carving Kits & Tools / Pumpkin Gutter Tool
Pumpkin Gutter Tool
Online Only
In Stock & Ready to Ship
Enter Zip Code to check In-Store Availability
Zip Code is Required
Zip Code can contains only 5 numeric characters.
Enter a New Zip Code
Due to the large size of some of the items on our site, additional shipping fees are assessed by the carrier delivering these products.
You will see an additional shipping charge added to your order of either $10, $20 or $25.
The fee assessed is based upon the size of the product. Oversize items are excluded from shipping promotions.
You will see an additional shipping charge added to your order of either $10, $20 or $25.
The fee assessed is based upon the size of the product. Oversize items are excluded from shipping promotions.
Complete the Look!
Slip this Pumpkin Gutter Tool on to your electric drill, and watch as you can easily gut your pumpkin's seeds and pulp. This stainless steel tool will help your pumpkin carving process carry on smoothly.
- Pumpkin Gutter Tool
- Materials:
- Stainless Steel
- Compatible with all electric drills
- Dimensions:
- 12"
Additional Product Information:
All Reviews
Already own it? Write a Review
Review Snapshot® by PowerReviews
Displaying Review 1 of 1Back to Top
It's about time!
Lots of Fun, Unique, Works great
Clean It Before It Drys
Best Uses:
Carving Contest, Real Pumpkins
Describe Yourself:
Was this a gift?:
Bottom Line:
Yes, I would recommend this to a friend
This is the best tool to clean out the pumpkins fast. Can damage pumpkin if you over do it. This tool will have you wanting to carve real pumpkins again!
Was this review helpful to you? Yes / No- Is this review inappropriate?.
Displaying Review 1 of 1Back to Top
- All deliveries are pending approval and merchandise availability.
- Delivery time includes 24-48 business hours for processing.
- Orders are processed Monday-Friday.
- Our carriers DO NOT require a signature… If you are not home, the package will be left at your address.
- Orders are NOT processed or shipped on Saturdays, Sundays, or holidays.
- Second Day and Overnight orders must be in before 12 PM EST to ship out same business day.
- Second Day and Overnight orders placed after 12 PM EST will ship the following business day.
- Second Day and Overnight orders are delivered Monday-Friday. They are NOT delivered Saturday or Sunday.
- Watch for e-mails from us. Check your spam folder, as our e-mails do sometimes end up there! We may need additional information to process your order.
- We will gladly accept products for returns within 14 days from when you received your purchase. We accept returns that don't appear to be worn, are in new condition, and are in their original packaging. Read More >>
Sign Up Today & Receive Discounts, Exclusive Offers & Breaking News!
I agree to receive Spirit Halloween Superstores LLC's newsletter containing news, updates and promotions regarding Spirit Halloween Superstores LLC's products. You can withdraw your consent at any time. Please refer to our Privacy Policy or Contact Us for more details


text:
Press release from Business Wire
General Moly Announces Receipt of Water Permits for Mt. Hope
Monday, December 19, 2011
General Moly Announces Receipt of Water Permits for Mt. Hope08:30 EST Monday, December 19, 2011 LAKEWOOD, Colo. (Business Wire) -- General Moly, Inc. (the "Company") (NYSE Amex: GMO) (TSX: GMO) announced that as of December 14, 2011, the Nevada State Engineer issued the Company, through a subsidiary, all of its water permits - allowing the Mt. Hope project to utilize approximately 7,000 gallons per minute (gpm) of groundwater for mining purposes. The permits follow the Nevada State Engineer's July 2011 ruling granting the Company's water right applications for the use of 11,300 acre-feet annually (afa) of water for mining purposes. The water will become available for consumptive use following the State Engineer's approval of the Company's Monitoring, Management and Mitigation Plan (3M Plan) that was developed in cooperation with Eureka County and submitted to the State Engineer for approval in October 2011. The Company continues to work with the State Engineer and Eureka County to finalize the 3M Plan and we anticipate the State Engineer to approve the 3M Plan in the first quarter of 2012. The State Engineer's approval of the Company's water right applications remains under appeal by Eureka County and two other parties. The Nevada District Court has now set a briefing schedule that includes an April 3, 2012 hearing date on the appeal. A decision on the appeal is expected in mid-2012, although the District Court is not required to act under any specified timeline. Bruce D. Hansen, Chief Executive Officer, said, "I am pleased that the Nevada State Engineer's office continues to diligently process the Mt. Hope project's water permits. Having active water permits and an approved 3M Plan will allow us to initiate construction activities shortly following the BLM's Record of Decision and the availability of financing through Hanlong and POSCO. We remain extremely confident that the State Engineer's ruling and processes will be affirmed in District Court and are disappointed with the elected officials of Eureka County for going forward with the appeal of the State Engineer's ruling, as are a growing number of Eureka residents, especially in light of the overwhelming public support that the Mt. Hope project has in Eureka and surrounding communities." General Moly is a U.S.-based molybdenum mineral development, exploration and mining company listed on the NYSE Amex (formerly the American Stock Exchange) and the Toronto Stock Exchange under the symbol GMO. Our primary asset, our interest in the Mt. Hope project located in central Nevada, is considered one of the world's largest and highest grade molybdenum deposits. Combined with our second molybdenum property, the Liberty project that is also located in central Nevada, our goal is to become the largest primary molybdenum producer by the middle of the decade. For more information on the Company, please visit our website at http://www.generalmoly.com. Forward-Looking Statements Statements herein that are not historical facts are "forward-looking statements" within the meaning of Section 27A of the Securities Act, as amended and Section 21E of the Securities Exchange Act of 1934, as amended and are intended to be covered by the safe harbor created by such sections. Such forward-looking statements involve a number of risks and uncertainties that could cause actual results to differ materially from those projected, anticipated, expected, or implied by the Company. These risks and uncertainties include, but are not limited to, metals price and production volatility, global economic conditions, currency fluctuations, increased production costs and variances in ore grade or recovery rates from those assumed in mining plans, exploration risks and results, political, operational and project development risks, including the Company's ability to obtain required permits to commence production and its ability to raise required financing, adverse governmental regulation and judicial outcomes. The closing of the Hanlong transaction and obtaining bank financing are subject to a number of conditions precedent that may not be fulfilled. For a detailed discussion of risks and other factors that may impact these forward looking statements, please refer to the Risk Factors and other discussion contained in the Company's quarterly and annual periodic reports on Forms 10-Q and 10-K, on file with the SEC. The Company undertakes no obligation to update forward-looking statements. General Moly:Investors and Business DevelopmentSeth Foreman, (303) email@example.com Spencer, (775) email@example.com@generalmoly.comWebsite: http://www.generalmoly.com


text:
by Amc Beauty
WFor Women
Item #
- Design House: Amc Beauty
- Fragrance Notes: Flowery fragrance
- Recommended Use: casual
No reviews written for this product
I have used Enchantment since the day it came out on All My Children. Its a beautiful fragrance that many men have asked "What is the name of your perfume? I truly love the fragrance as both men and women always say "you sure do smell great". I leave my car and people can smell me coming. Thanks so much for carrying Enchantment because I haven't used any other fragrance in years. I usually buy at least a dozen at a time. I cannot stop using Enchantment.
Written by Mary Ann on October 07, 2014Read Review details ►
I ordered Enchantment on a whim because it was inexpensive and I thought I'd give it a try. Little did I know that Amc Beauty stood for the Soap Opera "All My Children", so when I found that out upon opening the package and reading the box, I was surprised. I'm 20 and in college so I thought "great, this is gonna smell like old lady perfume". To my surprise it smelled great! I think it's a bit of an oriental spicy smell...no clue why it's classefied under smelling as flowery. I do love this, & I will re-order again once I run out.
Written by Kayla Marie on September 09, 2013Read Review details ►
Love Enchantment. Have been wearing this fragrance for years and will continue to use as long as I can find it. Lots of compliments.
Written by Anonymous on February 19, 2013Read Review details ►
Enchantment is the best ever!
Written by Anonymous on November 26, 2012Read Review details ►
This has been my favorite for several years now. My loved ones identify it as my scent and strangers often comment about how good I smell. It is a subtle yet distinct scent and I have yet to find an acceptable substitute for it. Although I enjoy several other scented lotions/perfumes/etc., Enchantment is the perfect perfume for me and accents my chemistry.
Written by BPifer on October 01, 2012Read Review details ►


text:
Discover a selection of top forums engineers ullal on the internet. Come to share your passion on forums engineers ullal and meet other fans of engineers ullal. Then, why don't you create your own forum of engineers ullal ?
Discussing all ongoing engineering work and issues on the Treves UK site
treves, #engineers, discussing, ongoing, engineering, work, issues, site
Forum for ex boy soldiers. Army Apprentice Soldiers
army, apprentices, reme, royal, signals, #engineers, artillary, roac


text:
The Best free open source software for Linux?
Please tell me the best and leading open source freeware for the following purposes:
1. CAD/CAM modeling software. Program should be possible to export as IGES and it should be proper for industrial design purposes - solidmodeler and surface modeler.
2. Rendering software
3. 2D vector grafics program...something which replaces the Adope illustrator
4. Scanner software
5. CD burning software
6. Program to test vehicle aerodynamics
7. Winrar replacement for Linux
I know that GIMP should be best image manipulator...are there any better or lesser attemps?
Many thanks,
for CAD/CAM, Rendering, fluid dynamics, vector graphics, and
One great place to look for graphics apps (at least half of your list) is at SAL-Scientific Applications for Linux. http://sal.kachinatech.com/sal1.shtml
scanner software:gimp-sane, kooka, many more
CD burning sofware:
try xcdroast, kreatecd, gtoaster(or is it gnometoaster), and k3b (off of the top of my head).
for winrar replacement: do you just want a utility to un-rar rar's, or do you want a do-it-all suite?
for the former, I don't know of any open source programs that can extract rar archives, but you can use unrar http://www.linux.org/apps/AppId_488.html
thanks! :-)
you could also try http://apps.kde.org(if you're looking for KDE apps or http://www.freshmeat.net might have something that you are looking for
you could also try http://apps.kde.org(if you're looking for KDE apps or http://www.freshmeat.net might have something that you are looking for
thanks...I have found lots of usefull programs...
I am thinking to start as a freelancer industrial designer and I wouldnt like to spend money on programs because I do not have any extra money. :-)
But with open source this seems to be possible...:-)
I use varicad, its OK, but costs money
VariCAD is something which I have seen sometimes...I need to download the trial. Its not that expensive anway. :-)
|All times are GMT -5. The time now is 01:35 PM.
Powered by vBulletin® Version 3.7.1
Copyright ©2000 - 2015, Jelsoft Enterprises Ltd.
Copyright ©1998 - 2014, nV News.


text:
Charles River
Firefighters rescue dog from frigid Boston-area river
Police in Wellesley, Mass., about 16 miles west of downtown Boston, got a call from a frantic owners that their dog, Crosby, had fallen through the ice while walking on the frozen Charles River.
RecommendedRecent Facebook Activity
Only On 7
ABC7 News at 4 Now Weekdays!ABC7 is giving you MORE news in your afternoons with an extra hour, an hour earlier! Join ABC7's Leon Harris and Alison Starling for what's trending in your community and world. Every weekday afternoon at 4pm right after back to back "Hot Bench" shows at 3pm on ABC7.


text:
Even with a poor network connection?
Specifically, I've written code which launches a separate thread (from the UI) that attempts to upload a file via HTTP POST. I've found, however, that if the connection is bad, the processor gets stuck on outputstream.close() or httpconnection.getheaderfield() or any read/write which forces data over the network. This causes not only the thread to get stuck, but steals the entire processor, so even the user interface becomes unresponsive.
I've tried lowering the priority of the thread, to no avail.
My theory is that there is no easy way of avoiding this behavior, which is why all the j2me tutorial instruct developers to create a 'sending data over the network…' screen, instead of just sending everything in a background thread. If someone can prove me wrong, that would be fantastic.


text:
Special Correspondent
CHENNAI: Chairman of the Tamil Nadu Palmyra Workers Welfare Board (TNPWWB) Kumari Ananthan on Thursday urged the Government to merge the board with the Palm Products Development Board.
Mr. Ananthan said in a statement here that the TNPWWB had adopted a resolution pointing out that merger of the two boards was necessary as the welfare of the workers and development of palm products were inter-related.
Through another resolution, the board said the Government should come forward to implement the Rs. 80-crore proposal for providing four lakh jobs before the end of the current palmyra sap season. The project would yield revenue to the tune of Rs.5000 crore a year, it added.
The meeting also decided to highlight the need for introducing an equipment for increasing the shelf-life of the palmyra sap.


text:
E-Mail Address:
Forgot your password?
Log in
Not a member? Register now!
Common Conditions
Related Tools
Find & Review Drugs
Popular Topics
Advice & Support
The most common sign of
craniosynostosis is an irregularly shaped head. You
may also be able to feel a ridge along the skull where the
suture has closed. There may be no other symptoms when
craniosynostosis affects only a single suture.
Although most
cases of craniosynostosis are diagnosed based on an irregularly shaped head,
illness may also be a sign. Craniosynostosis is usually more severe when more
than one suture closes too early. This significantly restricts the skull's
ability to expand as the brain grows. As pressure builds on the brain, your
baby may:
When the pressure is very severe, it may cause brain damage
and other problems, including seizures, blindness, and developmental delays.
Untreated craniosynostosis may cause lasting disabilities.
Last Revised:
October 5, 2010
Healthwise Staff
Medical Review:
John Pope, MD - Pediatrics & Adam Husney, MD - Family Medicine
This information does not replace the advice of a doctor. Healthwise disclaims any warranty or liability for your use of this information. Your use of this information means that you agree to the Terms of Use.
How this information was developed to help you make better health decisions
To learn more visit Healthwise.org
© 1995-2013 Healthwise, Incorporated. Healthwise, Healthwise for every health decision, and the Healthwise logo are trademarks of Healthwise, Incorporated.
Subscribe to Living With Rheumatoid ArthritisOur free rheumatoid arthritis newsletter delivers useful news, inspiring stories, and healthy recipes to your in-box every week. Preview the newsletter.
This Site and third parties who place advertisements on this Site may collect and use information about
your visits to this Site and other websites in order to provide advertisements about goods and services of
interest to you. If you would like to obtain more information about these advertising practices and to make
choices about online behavioral advertising, please click here.


text:
Large villa great views Almunecar, Andalucia Spain
from £179 /night help Price for guests, Nights
from £179 /night help Price for guests, Nights
Estimated nightly price based on a weekly stay. Excludes fees (if applicable). Enter your dates to see the total cost.
View across Cotobro bay, the beach and to the Marina del Este
Villa / 6 bedrooms / sleeps 15
Availability Your dates are available
Villa / 6 bedrooms / sleeps 15
|Key Info
This 6 bed villa for rent in Cotobro, Almunecar is fully loaded for a great family holiday. Amazing views overlooking Cotobro bay, the beach and the Marina del Este. Free WIFI boosted around the villa. Large private AstroTurf play court and equipment. Less than 5 minute walk to the beach and quality restaurants. From this point you are on the promenade! DISCOUNTS FOR SMALLER GROUPS.
On entering the villa, there is a large open plan area with hallway, large lounge, dining area with Italian marble floor. The first thing to hit you is the beautiful panoramic view. The lounge is fully equipped with TV, dvd player, wii console, tv ( English, Spanish, German, Dutch French etc) and music system with aux facility so you can play your ipod music. Music system in the gym. The lounge has an open fireplace. Off the lounge there are two bedrooms, one with a king size bed which has a large 5 piece en suite and direct access onto the outside dining balcony. The second bedroom of the lounge is a twin bedroom. There is also a separate shower room with WC on this level.
There is a fully fitted kitchen on this floor, complete with two fridges, two freezers, dishwasher, 5 burner cooker, grill and double oven with external extraction. There is a 3 section gas BBQ on the outside dining terrace. There is a circular marble staircase taking you to the lower level where there are 4 bedrooms, of which one is is a king size bed with en-suite. The other room sharing this balcony is also a king size double bedroom. There are two more shower rooms with WC. There are two balconies on this floor which are both shared by two bedrooms each, again with amazing views across the beach and the bay. There are two single bunk beds in one of the bedrooms and a bunk bed with a double bed underneath.
There is air conditioning in 4 of the 6 bedrooms and the lounge. There is also a washing machine, dryer, iron, safe for your valuables etc.
As you head down into the garden there is a gymnasium with two multi gyms, free weights and a punchbag. The garden is a shady grassy garden with 3 hammocks under two palm trees and a beautiful bay view. On this level there is a swimming pool 9x4.5m, with a pergola over the dining area (seats 16+). There is a traditional BBQ area, kitchen, shower room and toilet. Down from this level there is a sports AstroTurf court of more than 100m2 (1100 sq.ft). Equipped for basket ball, football, bowls, badminton, archery, golf putting practice etc. Further along this terrace there is a table tennis area and a swing ball game. Below this level is a fruit garden with mango, grapes, bananas, oranges, prickly pear and oranges. There are also some steps ( approx 80) from the bottom of the garden to the beach access road.
There is a garage with free use of bicycles and a two man ocean kayak. There are also children's toys and family board games. Pets are allowed subject to additional damage deposit. You can easily walk to the beach from the house (5 mins) and only have to cross one quiet beach road at a designated crossing. Once at the beach you can walk along the promenade and into Almunecar old town (35 minutes) passing numerous bars and restaurants along the way.
Heated swimming pool up to 30 degrees if you want and only 80 minutes drive to Sierra Nevada ski resort ( Dec to beginning May). A true ski in the morning and sunbathe in the afternoon.
Other great day trips are the historic city of Granada and the Alhambra palace and Generalife. These historic buildings came 8th place in the recent new list of the Wonders of the World. Nerja caves are just 15 minutes drive. You can have a day trip to Tangiers in Morrocco and visit the Kazbah/ Hercules Cave and lots more. The famous tax free territory of Gibraltar is only 140 minutes drive where you can see the famous wartime shelters and the Barbary Apes . The famous Otivar waterfalls are only a 1 hour drive where you can dive into lagoons and bath in the amazing crystal clear waterfalls.
|Sleeps up to 15, 6 bedrooms
|Nearest beach
|Will consider
|Corporate bookings, Long term lets (over 1 month)
|Car advised
|Nearest travel links
|Nearest airport: Malaga 75 km
|Family friendly
|Great for children of all ages, Suitable for people with restricted mobility
|Some pets are welcome - please contact the owner, Please contact the owner
Features and Facilities
|Private outdoor pool (heated), Log fire, Internet access, DVD player, Boat available, Sea view
|Private outdoor pool (heated)
|Air conditioning, TV, CD player, Table tennis, Safe, Satellite TV, Wi-Fi available
|Kettle, Toaster, Iron, Hair dryer
|Clothes dryer, Dishwasher, Cooker, Microwave, Fridge, Freezer, Washing machine
|6 bedrooms, 6 bathrooms of which 2 En suites and 4 Shower rooms
|2 Sofa beds, Double beds (3), Single beds (2), Bunk Beds (2), Cots (2), Dining seats for 14, Lounge seats for 12
|Linen provided, Towels provided, High chair
|Private outdoor pool (heated), Balcony or terrace, Private garden, BBQ, Bicycles available, Swing set
|Secure parking
|Further details indoors
The property has been our family home and we know the area very well. If you have any special requirements , I am sure we can oblige. Smoking is not allowed inside but people can smoke outside on the balconies or terraces.
The Andalucia region
Granada is in Andalucia and home to the Sierra Nevada ski resort and the Alhambra Palace and Generalife. the Alhambra was recently voted as the eighth wonder of the world. The ski resort is normally open from the end of November to the end of April. The historic city of Granada is lively and vibrant all year around. Amazingly under-developed and stunning. The coastline is called the Costa Tropical and enjoys a genuine micro climate of cooler summer temperatures and warmer winter temperatures. Granada is the only province to still give FREE tapas with your drink so enjoy great cuisine for free. The Costa Tropical has Nature Reserves where you can enjoy breathtaking scenery and exhiliarating walks. Seeing Ibex, mountain goats, wild boar and eagles is not unheard of if you know where to look. There are great canyon walks with fresh water waterfalls and pools. The area is home to a substantial Marine reserve so the snorkeling and scuba diving is some of the best in Spain with a wide variety of fish and marine life. In brief the Costa Tropical is where mountainous countryside meets the Mediterranean sea. It is green and tranquil with nightlife in the town. A perfect mix.
Almunecar is the resort capital of Granada. It is to be the new home of the first 7 star hotel resort in Spain provided by Banyan Tree Group. Almunecar has a host of activities from a castle, water park , sports facilities (football, tennis, paddle etc), boat cruises, boat hire, best scuba diving in marine reserve, nature walks in natural reserve parkland, canyoning, waterfalls, abseiling , rock climbing, parapenting/hang-gliding, schools (language, flamenco, cooking, art, hang gliding, scuba), great snorkling, paintballing, 4x4 adventures, quad bike excursions, archery,etc. There are a choice of horse riding facilities and three golf courses to chose from 15 minutes to 40 minutes drive There is an amazing aquarium with underwater tunnels and sharks. Fishing trips. There is the old town to explore with its old cobbled streets, phonecian ruins, roman ruins, museums, botanical gardens, flamenco shows, famous Bosai tree exhibition. A wide array of restaurants from giant paella on the beach, to asian fusion cooking, to cordon bleu quality chefs from all around the world.
Guest reviewsPowered by TripAdvisor
Guest reviews no reviews
Guest reviews Powered by TripAdvisor
- 5 star
- 5
- 4 star
- 0
- 3 star
- 0
- 2 star
- 0
- 1 star
- 0
Excellent 5/5
Help other travellers decide where to stay
Add your voice to the conversation about this holiday home and your review will appear on TripAdvisor too.Write a review
31 Aug 2014
"Fabulous, Fabulous, Fabulous!!"
Having just spent the last two weeks at Casa Felicidad on our 13th annual trip to Spain, this has to be the best villa we have stayed at. In our party of 8, the house catered more than adequately and… More
17 Jan 2014
"Amazing luxury home, perfect location, 2nd trip and we all want to go back again!"
This home has it all. so starting with the basics; It is in immaculate condition, very clean, bright, lines and towels, furniture all in newer condition. The pool was heated. Lots of fun toys to kee… More
18 Aug 2013
"A fantastic place to spend time."
My family and I have had the most fantastic holiday in this beautiful Villa. The location is breath taking. The Villa has so many facilities the children did not want to move away from it. We rent Vil… More
7 Jan 2013
"Best holiday ever"
I would not normally take time to write a review on a holiday, however, I feel compelled to write something on this occasion. We had a 2 week holiday at Casa Felicidad in August with our 3 children an… More
6 Jan 2013
"Living the life in true luxury"
It is difficult to fault the accomodation. Something for all.We planned to use the place as a base to find an investment property, before we were gripped with such a peaceful and relaxing place to sta… More
This advert is created and maintained by the advertiser; we can only publish adverts in good faith as we don't own, manage or inspect any of the properties. We advise you to familiarise yourself with our terms of use.
You're booking with
Nick W.
- 1 Years listed
95% Response rate
Calendar last updated:26 May 2015
Based in United Kingdom
- English
- Spanish
Payment accepted
Paypal accepted
Credit cards accepted


text:
2 Results for 'Refurbished iPod classic 80GB Black'
This Is Ground Cordito Cord/Earbud Holder
This Is Ground's Cordito case gives you a gorgeously simple way to wrap the USB cords, earbuds, and plugs for your iOS devices while on the go or just keeping things organized. It's precisely measured premium leather structure neatly holds three cables and two or three plugs.$39.95
- Tan
- Black
- Free Shipping
- Available to ship: 1 business day
This Is Ground Cord Taco (5-Pack)
This Is Ground's Cord Taco helps you clean up all of those wires for your iOS devices or Mac in your bag, pocket, car, or anywhere else. Seal the 100-percent premium leather structure with its metallic clasp and the look instantly changes from messy to cool and organized. Works great for earbuds, USB cables, and other small wires. Each package includes five Cord Tacos.$24.95
- Tan
- Black
- Gray
- Multicolor
- Free Shipping
- Available to ship: 1 business day


text:
When freight railroads were deregulated, they started investing their own money in their infrastructure and began "turning their networks into double-lane steel freeways," writes Michael Barone, The Examiner's senior political analyst. And it is that act that separates freight rail from passenger rail, making it a winner and passenger rail a loser, he contends.
View Full Article in:Examiner (Washington, D.C.), The


text:
Aqua Sarai Wool Rug 1 1
Color is off This rug is much lighter than how it is portrayed in the picture. The colors are very pastel and muted. Will be returning it. October 12, 2014
1-1 of 1
Related Products
Indian in origin, global in appeal: our Sage ...
Thick, lustrous wool is hand carved to create ...
Made in India of 100% wool pile, our ...
Recently Viewed Items


text:
Cheap SNR to Seattle flights
Popular Flights from Saint-Nazaire, France
Top Saint-Nazaire Flights to US Destinations
Top Saint-Nazaire International Destinations
Popular Flights from Seattle, Washington
Top Seattle Flights to US Destinations
Top Seattle International Destinations
SNR to SEA Route Map
Saint-Nazaire to Seattle Flights, Stats and Airplanes
Route information for flights from Montoir to Seattle Tacoma Intl..
4,965.62 miles
SEA - Seattle Tacoma Intl. Airlines
Browse the most popular airlines servicing the Seattle (SEA) airport. Visit their flights pages to learn more about the most popular routes these carriers fly.


text:
Select Year
Select Make
Select Model
Select Submodel
Select Engine
Not listed? Select a new vehicle
Home > MERCEDES BENZ > C32 AMG > IAT Sensor > 2004
Market Price :$27.95
Discount Price :$27.95
Total Savings :$0.00
Market Price :$21.95
Discount Price :$21.95
Receive Exclusive Offers!
Payment Options:
Copyright © 2015 Auto Parts Train. All rights reserved.
Use our Part Fit Checker to view parts compatible with your vehicle.


text:
K100 with 100k miles DC to Panama
View Single Post
Cool Hand
Joined: Nov 2008
Location: Washington DC
Oddometer: 455
So this weekend I bought another '85 K100
and thought it only right to send my old one some love by finishing this report. I'll mainly be throwing in pictures with some commentary on aspects of the trip that deserve it. I've been itching for doing another trip, but this will have to suffice for now. (This trip started September 2008 - End of December 2008)
Here is a map that I put together of the trip, it is split for whatever reason so clicking on the link and then on page two will show you the end of the trip.
I made each riding leg a different color as to make the distances and stops stand out.
Luke´s Trip
in a larger map
I really only had one real destination in Mexico, that was Cordoba, Veracruz where I stayed with a host family (lovely host sister) for a summer back in 2002. Other than that someone recommend hitting up Gomez Farias so a spent a night there enjoying the higher cool altitude and verdant forest.
The first road in Mexico after fighting through Matamores and hauling ass towards Cuidad Victoria for my first night in Mexico. I was coming from Corpus Cristi racing the sun and really didn't want to break my rule of not riding at night the first day. The road was nice and I was cruising at around 80mph when a hot woman wearing a red dress in a 5 series comes up next to me like I was stopped. I remember this distinctly. She looks over, I wave, she smiles, she puts the hammer down and suddenly I find myself playing catchup to this girl going 95mpg for the better part of a 10 minutes. She turned off somewhere along the way, and I kept going. It may have set the stage for the rest of the days to come. Riding fast and chasing women south of the border.
City center Ciudad Victoria at dusk.
Vista riding south from Cuidad Victoria
Gomez Farias city center
My second night in Mexico, a small hotel in El Cielo biological reserve. Great view off the back.
The grounds
Cerro del Bernal, view from carretera #80. A pleasant surprise.
Not much of note going down through Tampico heading towards Tuxpan. I got pulled over about halfway through Tampico, (first of many) a traffic cop waved me over. Stupidly, I pulled over spent the next 20 minutes listening and looking at his little book that showed motorcycles weren't allowed in the left lane. The book showed 75 dollars or something ridiculous and going to the local police dept to pay it. I speak a fair amount of Spanish which in some cases is more of a hindrance than anything. I kindly told him that there is no way I'm going to station to pay and wouldn't it be better for both of us if I just "paid" it now. He agreed, slipped him a $10, received more scolding and how dangerous it is to be in the fast lane, blah blah, and was off.
Happy to be in Tuxpan. Catching a water ferry to check out the Mexican Cuba Friendship Museum.
Said museum:
wikipedia: 'Tuxpan was also the port of departure for the yacht (Granma) that was used to transport Fidel Castro, his brother Raúl, Che Guevara and other fighters of the Cuban Revolution from Mexico to Cuba in 1956 for the purpose of overthrowing the regime of Fulgencio Batista.' It was actually a decent destination with some various relics. What motorcycle trip wouldn't be complete without a little Che? And after being asked for about the millionth time by a multitude of people, yes my trip is just like "The Motorcycle Diaries" and of course secretly I wish I was Che.
After Tuxpan it was down past Veracruz (spent some time there while studying zipped past it), and into my lovely host sister's arms in Cordoba.
I hadn't been in the Cordoba for 7 years and didn't really know exactly where their house was. I had emailed her about a week before and hadn't heard anything back, but what the hell this is an adventure. I knew her house was by the white paint factory where they produce the paint that goes on all the tree trunks. Other than that I had very little. I tried to use google maps satellite view to find the paint factory but it was pretty much useless. I pulled off the highway at the first exit for Cordoba, the intent was to do a moderate search before it got dark. If I couldn't find it, then I would just go get a hotel for the night and try again the next day. Repeat as necessary. Turns out there was a construction detour off of the main road that took me to a T. It all looked very familiar, I hung a right thinking this looks like their street. A few blocks down was their house. It really was a miracle, literally 10 minutes after getting off the highway I was parked at their house without knowing where to go. There was a hell of a welcome, tears, hugs. And after everyone regained their composure they asked me where everyone else was. I told them it was just myself and they stared in disbelief. I spent the next few hours eating, drinking, and reminiscing. It was good to be 'home'.
The generosity of the family is really second to none. During my first stay with them, my Spanish was in shambles, communication was difficult and the culture was foreign. During that stay, they honestly did become my family. They wished to be called hermana, mama, papa. And that they became.
Going out with the crew that night. A nice ratio.
My host brother and cousin took me up to the top of the local mountain, to watch the sunset with a couple 40ozs and chicas.
The entire crew.
After a few days the road was calling, and it was by far the hardest departure of the entire trip. Hugs, kisses, tears as I left, as I promised i'd return in the future. (This summer perhaps?) I burned through the rest of Mexico heading for the northern boarder of Belize. This is where the K100 really was at home. I took the toll roads mainly, and realized that really only the wealthy can afford to. The roads were pristine heading towards the Yucatan and the old girl ate up the miles. The bike was really at home keeping up with traffic which averaged 90-100 mph all day long. One long abandoned streak I decide to see what the silver German princess was made of, took her up to 120 and watched the landscape turn into a blur. She was insatiable and wanted more, but I backed her off. Got to love the flying brick. I spent a night in Villahermosa (bypass if you can) its just a large, dirty, oil boom city. Then made my way to Chetumal to prepare for the crossing into Belize.
Lots of these style suspension bridges.
In all her splendor
lukeman screwed with this post 05-06-2010 at
View Public Profile
Find More Posts by lukeman


text:
Course Descriptions
To view course descriptions for all courses in a single subject:
- Select the subject from the drop-down list
- Click Get Descriptions
Searching course descriptions by keyword is currently unavailable.
To view course descriptions for all courses in a single subject:
Searching course descriptions by keyword is currently unavailable.
Course Level: Graduate
Topics vary by section, may be repeated for credit with different topic. In seventeenth and eighteenth century Britain new literary forms, such as the novel and the autobiography, responded to the far-reaching changes in philosophy, politics, and religion of the Restoration and Enlightenment. Rotating topics include Milton, Restoration drama, and the rise of the British novel, with emphasis on research. Meets with LIT-437. Usually offered every year.
Course Level: Graduate
Advanced Studies in Restoration and Eighteenth Century Literature (3)
Scandal and Celebrity
Many social phenomena often viewed as distinctively contemporary flourished in Britain during the eighteenth century, including the profusion of consumer goods; the expansion of print culture and public commentary; and widespread public fascination with public individuals, fame, and scandal. This course examines the way in which the private lives of both literary characters and historical figures in this period were transformed into saleable commodities that were eagerly consumed by the reading public. In so doing, students explore the transition from narratives extolling "celebrated" public individuals to the emergence of the modern cult of celebrity, as well as the increasingly porous boundary between celebrity and notoriety. Figures and texts considered include the famed courtesan and author, Kitty Fisher; political hostess and 'woman of fashion,' the Duchess of Devonshire; celebrity 'recluses,' the Ladies of Llangollen; poet Lord Byron; novelist Caroline Lamb; naval hero, Lord Horatio Nelson; and the author and former slave, Mary Prince. Meets with LIT-437 001.


text:
First Ascent Team #2 Summits Everest!
Hahn, Waterfall and Arnot Complete the First Ascent Success
High winds and snow placed the second team's summit bid in jeopardy right up to the time they left their tents at Camp IV around midnight on the 22nd. But grabbing a narrow window of opportunity when the winds diminished slightly, the team opted to go for the top. Climbing as quickly as conditions and the extreme altitude would allow, they reached the summit around
"It was a tough one," Hahn said. "But we had a really good team. Everyone was really highly motivated and we got it done."
This was Hahn's eleventh Everest summit — more than any non-Sherpa in history. It was Waterfall's first trip to the Himalaya, while Arnot summited Everest in 2008 as well.
In addition to assembling several of the world's most celebrated mountain guides, the Return to Everest expedition has introduced breakthrough video and audio production techniques that have revolutionized the coverage of high-altitude mountaineering. Unprecedented, high-resolution footage, images and sound have created a compelling canvas for the climbers' approach, acclimatization and successful summit bids. The drama of massive avalanches and the challenges of sudden weather changes and extreme altitude have played out on the stunning film. The entire expedition has been broadcast on the First Ascent blog and has built an avid online following.
The success of the second summit team punctuates the return of Eddie Bauer to its roots. Beginning in 1953, the company outfitted major mountaineering expeditions with down clothing, sleeping bags and other gear. Over the next 30 years, Eddie Bauer outfitted many of the most significant first ascents in American mountaineering history, including the first American ascent of Everest, in 1963. For the past 18 months, Eddie Bauer has been developing the new First Ascent mountaineering gear in collaboration with their First Ascent guide team. The "Return to Everest" expedition marks the expeditionary launch of the new line.
"We made our reputation as America's premier expedition outfitter," says
Positioned as "guide built gear," First Ascent takes a new approach to designing and developing gear. "Viesturs, Hahn and I agreed," says Whittaker, "that most of the mountaineering gear out there is overbuilt. I can't tell you how many times that we, as guides, actually cut features off a product because it doesn't serve a necessary function. To us, that's just extra weight. Our goal was to create the simplest, lightest, best gear in the world. Everything you need, nothing you don't." Nothing ended up on any First Ascent piece that wasn't approved and tested by the First Ascent guide team. And nothing was left off that would compromise performance. Because in the guides' words, "We live in the mountains. Our clothes are our life support."
Five of the six First Ascent guides participated in the Return to Everest climb. Those five include:
Eddie Bauer's mountaineering history: 1953 - K2, Pakistan/China 1953 - Logan & Cook, Yukon 1953 - Inca Highway Expedition, South America 1954 - Makalu, Nepal/Tibet 1955 - Lhotse, Nepal/Tibet *1958 - Gasherbrum I, Pakistan/China 1958 - Antarctica 1958 - Slick-Johnson Snowman Expedition, Nepal 1959 - Eastern Kanjroba Himal, Nepal 1960 - Andes, South America *1960 - Masherbrum, Pakistan/India 1960 - McKinley/Denali, Alaska **1963 - Everest (South Col), Nepal/Tibet *1963 - Everest (West Ridge), Nepal/Tibet 1964 - McKinley/Denali, Alaska *1965 - Kennedy, Yukon 1965 - Antarctica 1966 - McKinley/Denali, Alaska *1966 - Vinson Massif, Antarctica 1967 - Andes, Peru 1967 - McKinley/Denali, Alaska 1971 - Everest, Nepal/Tibet **1973 - Dhaulagiri, Nepal **1974 - Peak Lenin, Russian Pamirs 1974 - Coppermine River, Northwest Territories 1975 - Mt. Logan, Yukon *1976 - Nanda Devi (North Ridge), India 1976 - Brooks Range, Alaska 1976 - Thule-Grise Fjord, Canadian Arctic *1977 - Great Trango Tower, Pakistan 1978 - Baffin Island, Canadian Arctic 1979 - Vatnajokull Glacier, Iceland **1980 - Makalu, Nepal/Tibet 1980 - Dhaulagiri, Nepal 1980 - Ellesmere Island, Canadian Arctic 1981 - Spitsbergen Island, Norway 1981 - Rainier (Pelion Project), Washington State 1981 - Everest, Nepal/Tibet (2) 1982 - Ama Dablam, Nepal 1982 - Ellesmere Island, Canadian Arctic *1983 - Everest (East Face), Tibet 1983 - Northwest Passage, Canadian Arctic 2008 - Cotopaxi, Ecuador 2009 - Aconcagua, Argentina *First Ascent **First American Ascent
To learn more, visit blog.firstascent.com.
For interview requests and more information, contact:
About Eddie Bauer
Established in 1920 in
Safe Harbor Statements
This press release contains forward-looking statements. In some cases, you can identify these statements by forward-looking words such as "may," "might," "will," "should," "expects," "plans," "anticipates," "believes," "estimates," "predicts," "intends," "potential" and similar expressions. All of the forward-looking statements contained in this press release are based on estimates and assumptions made by our management. These estimates and assumptions reflect our best judgment based on currently known factors. Although we believe such estimates and assumptions are reasonable, they are inherently uncertain and involve risks and uncertainties. In addition, management's assumptions about future events may prove to be inaccurate. We caution you that the forward-looking statements contained in this press release are not guarantees of future events, and we cannot assure you that such statements will be realized. In all likelihood, actual results will differ from those contemplated by such forward-looking statements as a result of a variety of factors, including our inability to hire, retain and train key personnel; delays in enhancement of our disclosure controls and procedures; our inability to revitalize Eddie Bauer as a premium quality brand; changes in general economic conditions, consumer confidence and consumer spending patterns; risks associated with legal and regulatory matters; risks associated with rising energy costs; risks associated with reliance on information technology; challenges as a result of our involvement in our former parent's bankruptcy process; the diversion of management's attention from operations while establishing post-emergence infrastructure; our inability to improve profitability of our retail stores, catalogs and website operations; our inability to source our requirements from our current sourcing agents; a significant disruption in our back-end operations; the inability of our joint venture partners to operate our joint ventures effectively; our inability to protect our trademarks and other proprietary intellectual property rights; unseasonable or severe weather conditions; our inability to use our net operating losses to reduce taxes; and the other risks identified in our periodic reports filed pursuant to the Securities Exchange Act of 1934, as amended. Except as required by law, we undertake no obligation to update any of these forward-looking statements.
SOURCE Eddie Bauer


text:
Reuters: Hot Stocks
Fri, 26 Apr 2013
Read the rest of this article on Reuters: Hot Stocks
Related Topics:
Related Videos
Sun, 7 Apr 2013
Morningstar's Patty Oey and Dan Rohr and Columbia Acorn's Andreas Waldburg-Wolfegg offer best practices for globe-trotting investors who must navigate choppy waters in today's market.
Thu, 23 May 2013
Chinese Internet giant Baidu offers robust growth at an attractive share price for investors who can get comfortable with the regional and business-specific risks, say Morningstar's Matt Coffina and Dan Su.
Thu, 18 Apr 2013
Five stats from the market and the stories behind them. This week: the 18% dent in gold, the disappointing data on earnings, and more.
Fri, 2 Nov 2012
China's historical growth drivers have started to plateau, but many untapped industries--particularly in the services sector--are set to take the lead, says Seafarer's Andrew Foster.


text:
Critical of the judiciary for taking too long to punish the guilty, Finance Minister P Chidambaram today said the country needs speedier enforcement of laws to combat corruption.
"Judges lecture the government every day. But let me say with humility, the failure to punish the corrupt is entirely the responsibility of our judicial system. It is our judicial system that failed to punish the corrupt.
"Corruption cases drive on for 20-30 years. You take disciplinary action against government servants...it takes 10 years (to) find him guilty and you punish him. And finally the court will set it aside (the order) on some technical (grounds)," he said at an NSUI meet here.
Chidambaram also said it was wrong to assume that there is corruption only in India.
"There is corruption worldwide and there is corruption in India. Corruption is driven by greed. It is not sufficient to make laws -- the laws must be enforced. We must punish the corrupt.
"You cannot entirely stop corruption...The best way to control corruption is to punish one who is caught red-handed.
Anyone found guilty must be punished severely," he said.
The Finance Minister also advocated greater use of technology to bring down corruption.
Talking about price rise, Chidambaram said the focus of the government was to bring down the fiscal deficit and borrowings to curb inflation.
He said efforts have yielded results and wholesale inflation has eased to 5% from 10 % and retail inflation to 7.24 % from over 12 %.
The Finance Minister said items such as fruits and vegetables, meat and fish, eggs, milk and spices are driving inflation, not wheat and rice.
By containing demand, by controlling the fiscal deficit, by spending less, we have brought down inflation, he said.
Chidambaram said if the current polices are followed for next one-two years, WPI inflation will come down to about 3 % and CPI inflation to below 5%.


text:
Video: Fired from Ridgewood Bushwick Senior Center
Tuesday, September 21, 2010 - 09:40 AM
Cyril Joseph says he was fired from the non-profit founded by Vito Lopez "because I did not endorse Maritza Davilla," a City Council candidate Lopez was supporting last year.
Joseph says the official reason he was given for losing his $10-an-hour custodial job after only a year was poor performance. He says others within the non-profit made it clear he was fired because of his political activities.
Joseph made his claim last night, outside the Brooklyn Democratic County Organization's bi-annual meeting where Lopez was re-elected as County Leader.
Lopez took a few questions from reporters afterward, but left before he could be asked about Joseph's claim. City investigators have already criticized the non-profit for lax financial oversight. Lopez defended the organization, saying he's "proud" they serve his community.
More in:
Comments [1]
good job lincoln!! did you write mr. joseph's script? Im surprised he could read it the man is usually wasted!!
Leave a Comment
Email addresses are required but never displayed.


text:
TheRecipeDiva.com to Raise Awareness & Donations for 'Jamie Oliver's Food Revolution'
DALLAS, May 2, 2011 /PRNewswire/ — TheRecipeDiva.com, a global recipe sharing and social networking website for foodies, chefs and cooks, today announced a new initiative to raise awareness and donations for "Jamie Oliver's Food Revolution." The Recipe Diva will donate one dollar to "Jamie Oliver's Food Revolution" for every new user that registers on TheRecipeDiva.com during the month of May and encourage action among current users with a social media campaign.
An online hub for numerous food experiences, TheRecipeDiva.com features a variety of cooking and lifestyle tips, daily helpful how-to's and online foodie forums. Throughout the month of May, the website will concentrate on topics specific to "Jamie Oliver's Food Revolution," with an emphasis on health and changing the way people eat.
As part of the month-long campaign, TheRecipeDiva.com will highlight specific "special" recipe categories including: child-friendly, low fat, heart healthy and low calorie recipes. The online forums and how-to's will focus on healthy cooking techniques and methods for working with fresh ingredients. In addition, users will find a "Weekly Health Tip" and alternative healthy cooking methods from Shannon McNeil, a registered and licensed dietician.
To create greater awareness of "Food Revolution" cause, TheRecipeDiva.com will also launch a social networking campaign using Facebook and Twitter. Followers will be encouraged to interact with other supporters and help spread the word about The Recipe Diva's mission to donate to the Food Revolution for all new registered users in May.
"I am a huge fan of Jamie Oliver's Food Revolution. His passion to make a difference in the way people eat is so important. I respect and applaud his efforts," said Jacquelyn McVey, founder of TheRecipeDiva.com. "We'll do whatever we can to educate people about his Food Revolution mission through our different platforms."
About The Recipe Diva
The Recipe Diva LLC. is a recipe sharing and social networking cooking website. The site provides a user-friendly meeting place for foodies interested in sharing recipes and improving their cooking skills to come together. The Recipe Diva currently has users from over 30 countries.
About Jamie Oliver
In the past five years Jamie Oliver has been on a mission to get people healthier by cooking with fresh foods. His Food Me Better campaign in the United Kingdom led the British government to add $1 billion into the school food budget and, more recently, his Food Revolution campaign in the United States collected more than 650,000 signatures and helped pass the Healthy Hunger Free Kid Act of 2010.
–The Recipe Diva–
SOURCE The Recipe Diva LLC


text:
Narciso Rodriguez
Leather Suede Convertible Clutch
- Color:
- teal/black
Please select an available size.
Please select a size.
Share This Item: Email
Description: Convertible oversized clutch
- Leather and suede
- Optional chainlink shoulder strap
- Leather lined interior with two slip pockets
- Foldover flap closure
Measurements: Body length 15", height 10", width 3½", strap drop 11"
Material: Leather, suede
Brand: Narciso Rodriguez
Origin: Italy


text:
Colin Farrell treated for medication dependency, exhaustion*
LOS ANGELES (AP) Actor Colin Farrell is being treated for exhaustion and dependency on prescription medication, his publicist said Monday.
Colin Farrell's publicist confirmed he was seeking treatment but did not elaborate on where he was seeking it.By Frederick M. Brown, Getty Images
The medication was prescribed to the Irish actor after a back injury, publicist Danica Smith said in a written statement.
The statement said Farrell checked himself into a treatment center, which was not identified.
"No other comments to be made at this time," the statement said.
Farrell, 29, stars in the upcoming epic, The New World, and recently finished filming Miami Vice. He also appeared in last year's Alexander and the 2002 thriller Phone Booth.
*That explains this:


text:
To embed, copy and paste the code into your website or blog:
The United States Department of Labor's Office of Federal Contract Compliance Programs (OFCCP) has rescinded Directive 293, Coverage of Health Care Providers and Insurers, which outlined OFCCP policy for determining whether OFCCP has jurisdiction over health care providers and insurers based on their relationship with federal health care programs.
On April 25, 2012, the OFCCP announced that it was rescinding Directive 293, effective immediately, in light of questions raised with respect to the OFCCP's jurisdiction over health care providers: "[R]ecent legislation and related developments in pending litigation warrant rescission of Directive 293 at this time." Those recent developments include: (1) the pending appeal of OFCCP v. Florida Hosp. of Orlando, ALJ Case No. 2009-OFC-00002 (October 18, 2010) (concluding that hospital was covered subcontractor where it had a contract with Humana to provide health care services to TRICARE beneficiaries); (2) the passage of the National Defense Authorization Act (NDAA) of 2012 (exempting from OFCCP jurisdiction medical providers who participate in the Department of Defense TRICARE program, the health care program for active and retired military personnel); and (3) the pending appeal of OFCCP v. UPMC Braddock, ARB Case No. 08-048 (May 29, 2009) (concluding that hospital was covered subcontractor, where it had a Health Maintenance Organization (HMO) contract to provide medical products and services to federal government employees).
Please see full alert below for more information.
Firefox recommends the PDF Plugin for Mac OS X for viewing PDF documents in your browser.
We can also show you Legal Updates using the Google Viewer; however, you will need to be logged into Google Docs to view them.
Please choose one of the above to proceed!
LOADING PDF: If there are any problems, click here to download the file.
DISCLAIMER: Because of the generality of this update, the information provided herein may not be applicable in all situations and should not be acted upon without specific legal advice based on particular situations.
© Snell & Wilmer
Read fresh new writing on compliance, cybersecurity, Dodd-Frank, whistleblowers, social media, hiring & firing, patent reform, the NLRB, Obamacare, the SEC…
…or whatever matters the most to you. Follow authors, firms, and topics on JD Supra.
Create your news brief now - it's free and easy »
Founded: 1938
Geographic Reach: More than 400 attorneys in nine locations across the western...
View Profile »
See more »
Sign up for your custom alerts now, using LinkedIn ›
Back to Top
Copyright ©