text:
Wire in the Blood
2002, 6 seasons to date
Latest Episodes
Show more
Season 1 Show All Episodes
Episode 1: The Mermaids Singing: Part 1A police psychologist pursues a serial killer who tortures h...Nov 14, 2002
Episode 2: The Mermaids Singing: Part 2As Dr. Hill closes in on the homophobic psychopath, he almos...Nov 21, 2002
Shadows Rising: Part 1
Dr. Hill strives to deduce the connection between the bodies of two teenage girls dumped in a lake and the motives for their murder.242039106
Shadows Rising: Part 2
Dr. Hill pieces together the convoluted history of a formerly retired serial killer and the whereabouts of the latest victim the killer abducted.305049295
- +See All
Season 2 Show All Episodes
Episode 1: Still She CriesTony's patient, the child killer Maggie, is on the verge of...Feb 12, 2004
Episode 2: The Darkness of LightThe remains of corpses are discovered whilst new foundations...Feb 19, 2004
Right to Silence
Newly promoted to Detective Chief Inspector, Carol investigates a murder which seems to bear the hallmark of gang boss Gavin Cochran. However, Cochran is behind bars for murder and could not have done it. Carol asks Tony to work out any links between the two slayings, leading to the arrest of Cochran's brother George. But there is a fight during which George ends up in a coma. Gavin is released from prison for a compassionate visit, during which another killing takes place, allowing Tony to test his theory and trap the murderer.859527200
Sharp Compassion
The suspicious death of a hospital patient leads to post mortems being conducted on other patients who supposedly died of natural causes but now appear to have been murdered. Tony suspects the killer may be a person who believes they are releasing the victims from pain by their actions, guided by religious motives. However, Islamic terrorists are also suspected, leading to the involvement of MI5. Carol is under scrutiny and needs Tony's help to keep her job.321542241
- +See All
Season 3 Show All Episodes
Episode 1: RedemptionTony Hill and the police search for a serial killer who has...Feb 21, 2005
Episode 2: Bad SeedTony Hill works with the police to solve the murder of the J...Feb 28, 2005
Nothing But the Night
Dr. Tony Hill has his hands full. His principal interest is in solving a string of murders where he can find no apparent connection. A child molester, a divorced woman and an elderly pensioner are all violently killed and while there are a few similarities, the cases suggests that different personalities are at work. He begins to decipher the motives when he realizes that there are two killers working together, alternating their kills. Tony also finds that a woman he's met on an airplane is stalking him and developing a whole fantasy life around him. DCI Carol Jordan ...116445214
A sniper is at work and Tony Hill is having trouble profiling him. The killer leaves a playing card at each site but there is no apparent connection among the victims. As the deaths rise, people are walking the streets in fear, the media is in a frenzy and DCI Carol Jordan is under extreme pressure to solve the case. Tony has a bigger problem however when a medical exam reveals he has a brain tumor that is growing rapidly and is likely malignant.849043186
- +See All
Season 4 Show All Episodes
Episode 1: Time to Murder and CreateWhen a rapist who was convicted on Tony's evidence is releas...Sep 20, 2006
Episode 2: TormentWhen a young prostitute is found dead, clinical psychologist...Sep 27, 2006
Hole in the Heart
Tony Hill assists the police in their investigation of a bizarre series of murders. In each case the victims - a property developer, a bishop, a judge - were brutally killed and the killers then immediately committed suicide. Tony thinks there is a connection to the Freemasons, but then realizes that they are dealing with a religious sect that glorifies suicide. He knows from the profile that the head of the sect will be a white male and from the religious symbolism that he will have six disciples, but who are they and how will they find this needle in a haystack?781850180
Wounded Surgeon
When a young woman is raped and murdered after being kidnapped from a nightclub, Tony Hill is convinced that Jason Eglee is responsible. Ten years previously Tony had got him to confess to the rape of Tracy Bradshaw in what was Tony's first case working for the police. Eglee was released on parole, against Tony's advice, only three weeks before the most recent crime. When a crusading journalist questions Tony's interrogation technique and pushes for Eglee's original conviction to be overturned, DNA testing proves the man is innocent. The evidence notwithstanding, Tony...490326136
- +See All
Season 5 Show All Episodes
Episode 1: The Colour of AmberWhen an 11-year old girl is seen being dragged into a car ki...Jul 11, 2007
Episode 2: NoceboTony Hill and DI Alex Fielding find themselves investigating...Jul 18, 2007
The Names of Angels
The police investigate a series of rapes and murder of young, professional women in the Bradfield area. After attacking them, he dresses the victim in a previous victims clothes and leaves their ID on the body. As the investigation continues, they learn from DNA that the man is responsible for at least seven murders over the years, but that he has never been arrested and as such, are unable to identify him. In a separate case, a former patient who has run away from his care home, Jack, contacts Tony. As a child, Jack killed his family and the police are concerned that...727049199
Anything You Can Do
Tony Hill assists the police in investigating a series of murders. His profile suggests that the man committing these crimes may come forward as a potential witness and the police soon focus in on Bernard Kelly. In his mid-30's and still living at home with a domineering mother, he seems to fit his profile, but Tony has nagging doubts as he finds significant differences in style between some of the attacks. During this time Tony has a house guest, his old friend from university Jonathan Good who is also a psychologist. As time goes by however, he begins to behave ...977612191
- +See All
Season 6 Show All Episodes
Episode 1: Unnatural Vices: Part 1Several bodies are discovered buried in wasteland. They rang...Sep 12, 2008
Episode 3: Falls the Shadow: Part 1Tony attends a conference of psychologists, where he is a gu...Sep 26, 2008
From the Defeated: Part 1
Two young men are found murdered, the only connection being that skin from one of them is found under the other's fingernails. As other bodies are found, Tony deduces that a sadistic gay murderer is abducting white boys and forcing them to kill each other. Meanwhile Michael Bryant, the cannibal killer whom Tony helped to put away, sends him a message from the secure unit where he is incarcerated, telling Tony that he is planning to escape and will see him soon.655228108
The Dead Land: Part 1
Another serial killer is at work. This one kills homeless men by stabbing them through the heart but a bizarre ritual is also at work because the bodies are bathed and wrapped up in paper before they are left around the town's business area. Alex is called away and her place taken by the young Oxbridge graduate Hall,of whom Tony is initially suspicious but he turns out to have a psychology degree and to be a big fan of Tony's work. A more sinister fan,clearly Bryant,is leaving 'presents' on Tony's door-step.882519162
- +See All


text: 3 comments Every blog title I could think of today is also a song that I love, so I'm combining an awesome song with a good ole fashioned blog. The song is "Living in the Moment" by Jason Mraz. living in the Moment.10 Oct, 2012 in Featured Songs / Reflections tagged advice / beauty / God / hope / lyrics / peace / trust

subset: commoncrawl


text:
The Australian High Commission in Pretoria has become aware of several visa scams. Please be cautious of any person or websites offering 'guaranteed' Australian visas.
Scammers may try to trick you into believing they are genuine by posing as staff from an Australian Government department, or by using websites which look like official Government sites or reputable news sites. Illegal operators often give incorrect advice, steal your money, encourage you to lie on your application and do not deliver the services promised.
Warning Signs
- Offers for a 'guaranteed' Australian visa.
- Unsolicited offers via email, post, over the phone, on a website or even face-to-face.
- Claims of 'once in a lifetime opportunity', or your 'only' chance to travel or migrate to Australia.
- You are asked to pay the scammer upfront to 'register' your interest in getting a visa. The scammer asks you to pay them directly rather than paying the government department and claims that only they can pay the department's fees.
- The scammer claims to have a special relationship with the Department of Immigration and Border Protection (DIBP).
- They tell you they need to keep your original documents.
- There is only one official Australian Government provider of visas - the Department of Immigration and Border Protection (DIBP). DIBP's official website is www.border.gov.au
- If you receive an email from the Australian High Commission in Pretoria the email address must end in "@dfat.gov.au".
- DIBP charges a one-off fee at the time you lodge your visa application. You can pay the fee directly to the department and do not require an agent to pay this fee on your behalf.
- No one can influence the outcome of a visa application or the visa decision making process. Only authorised officers from DIBP can issue you with a visa and only if you meet all the visa requirements.
- Apart from DIBP's official service delivery partner in the Africa region, TLScontact, the Department does not have any special relationships with outside agencies and does not give preferential treatment to anyone.
Protect Yourself
- If you wish to use an Australian migration agent, check that they are registered on the Office of the Migration Agents Registration Authority website (https://www.mara.gov.au/) or if they are operating outside Australia to check with the relevant Business Registration office that they are a legitimate business.
- Never give or send anyone your original identity documents. Government departments may wish to view your original documents in person or may ask for certified photocopies but should never ask to keep your original documents.
- Never provide your personal, credit card or banking details in an email or over the phone—scammers will use your details to commit identity fraud or steal your money.
- If you think you have provided your bank account details to a scammer, contact your bank or financial institution immediately.
People with information about migration scams or illegal operators should contact DIBP's Dob-In line. See: http://www.border.gov.au/about/contact/report-suspicious-activities-behaviour


text:
Interested in Milan?
We'll send you updates with the latest deals, reviews and articles for Milan each week.
Topics include Transportation, Italy: For Foreign Visitors & more!
First-time visitors to Milan might be interested in joining a city sightseeing tour. These tours are not cheap (€ 55 per person in 2009) but cover all major highlights (including a guaranteed visit of the Last Supper), and can be a good introduction to Milan and its beauties. They are led by multilingual tour guides. The two operators offering these tours are Autostradale http://www.autostradale.it/interna.as... and Zani Viaggi http://www.zaniviaggi.it/tour/elenco_...
Zani Viaggi also offers a hop-on, hop-off tour bus service (audioguides are provided).
If you are looking to do a tour only in English there are tours which you can book on www.lastsuppertickets.com, Select Italy, or tickitaly.
More adventurous (and/or budget-minded) visitors might like to ride on the #1 tram from Via Settembrini (two short blocks from the E side of Milan's central train station where shuttle buses from airports arrive) to the Cadorna train station (where the train from Malpensa airport arrives). This tram line is still operated with vintage vehicles built in 1928 (a few identical trams have been shipped to the USand are in use on the 'F' streetcar line in San Francisco), and the route takes in several major highlights, notably Via Manzoni (skirting Via Montenapoleone and the fashion area), La Scala opera house, and the Castello Sforzesco. Trams do not run in front of the Duomo itself (tracks were removed from the Duomo square several years ago), but you can walk from La Scala to the Duomo, through the Galleria Vittorio Emanuele, in less than 5 minutes. A standard € 1.50 ticket, bought from a newsstand, is valid for unlimited rides on trams/buses, as well as one subway ride, for 90 minutes from stamping it for the first time (but swipe it in the little red machine any time you board a tram) -- more information on public transport in the dedicated 'Inside Milan' page.


text:
Write Review
sincerely, marie designs added on 3/26/2017
Classic square coffee table with painted base and rustic stained table top complete with bottom shelf for storage. Perfect for living rooms with sectionals!
Follow the steps below to complete this project.
Using 2" Kreg screws, attach the top support flush with the top of the legs. Attach the bottom support to the legs 3" up from the ground. Use these same steps to make the second side.
Using 2" Kreg screws, attach your two sides with the two top and bottom shelf supports, making a square. Make sure that the top supports are flush with all the top of the legs so your table top is level.
Using 2" Kreg screws attach the angled, side supports. Supports should run from the bottom shelf support to the top support bar.
Glue and nail in place with brad nails.
We recommend you cut these to fit. 14 1/2" from longest end to longest end is a good place to start.
Attach the bottom shelf to the bottom shelf supports using 2" Kreg screws.
You can make the shelf flush with the top or leave 1/4" lip. This is personal preference. The coffee table in the photo has a 1/4" lip all the way around. We used a wood spacer to keep the lip even on all sides.
Attach a table top support to the two top support boards using 2" Kreg screws. This will give your top some extra support.
Using glue and 1" Kreg screws assemble the top. Start by assembling the center 1x8"s.
Add the right and left 1x4"s next.
Add the last two side 1x4"s making sure you cut them to size to guarantee a snug fit.
Attach the top of the table to the base using 2" wood screws. Screw up from the bottom of the top supports into the table top, just barely sinking the screws.
*If you choose to make pocket holes in the top supports, use 1 1/4" Kreg screws to attach the top.
Sand the coffee table and wipe clean. Paint and stain in your color of choice.
This table is painted in Decorators White by Benjamin Moore and the top is stained Sun-bleached by Varathane with a dark antiquing wax on top.
Wood Products:
You must log in to add comments
0 Comments
4 Comments
Printmaker's Coffee Table | RH Inspired
Rustic Industrial Coffee Table
Super-Simple Coffee Table
Multi-Functional Coffee/Play Table
Coffee Table with Hairpin Legs
Sign Up
Already a member?
Sign in!
What projects would you like to build? Tell Us
Copyright ©
Privacy Policy | Terms of Use


text:
The PTC SLM Solution Management Team hosts a User Community Webinar Series to keep you and other customers informed on the latest solution roadmaps, tips & tricks and best practices. This webinar: "Introduction to Servigistics InService", is presented by Nir Even, Senior Solution Manager.
In this webinar you will learn:
- Overview of Servigistics InService
- Loading data into Servigistics InService
- Key capabilities of the Viewer
- Q&A session


text:
Welcome to the ThemeEnergy Support Center!
Thank you for purchasing one of our items! This support forum is here to help not just yourself, but also also other buyers.
We ask that unless you are posting sensitive information (server FTP info or WordPress admin login) that you please make your ticket public for all to be able to see and search. This way repeated questions and answers can form a searchable knowledge base for everyone.
Please Note Before Posting: Every time you post a new comment before we have a chance to respond your tickets gets unintentionally bumped to the bottom of the queue since tickets on our end are sorted from oldest to newest in terms of last comment posted. If you have additional comments prior to us responding, please edit them into the initial post.
What is not included in item support
- WordPress general support/howto's (please, use wordpress.org forums for that);
- new features implementation and extending themes functionality;
- themes modifications and customization;
- complex individual server-side issues;
- third-party plugins and any other things that are not related to our products directly;
- issues particular to any specific device or browser (for example, IE8 and below)
- help with web-sites with "adults only" content;
- help with web-sites with any information, which undermines human dignity.
How to submit a support ticket
Please, make sure that you've studied the theme manual and referred to the knowledge base before submitting a support ticket.
To get started you should first register to use the support site. You can either click the Sign In / Register on the top right of this page to manually create an account using an email and password, or alternatively you can take advantage of using your Facebook or Twitter account to register and sign-in.
It is required that we verify your purchase before you can submit a ticket. Please place your unique purchase code in the form supplied.
Where can I find the purchase code?
If you need new features implementation or extending functionality of the theme, please proceed here. Thank you so much!


text:
|Publication number
|Publication type
|Application number
|Publication date
|Mar 29, 2011
|Filing date
|Mar 18, 2009
|Priority date
|Mar 18, 2008
|Fee status
|Also published as
|Publication number
|Philippe Le Bars, Julien Sevin
|Original Assignee
|Canon Kabushiki Kaisha
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (27), Non-Patent Citations (4), Referenced by (8), Classifications (15), Legal Events (3)
|External Links: USPTO, USPTO Assignment, Espacenet
The field of the invention is that of the techniques of network coding (sometimes also called coding on network), i.e. techniques related to information theory and using codes that fulfill the information-transportation capacity of a network.
More specifically, the invention relates to a technique for building a network coding system adapted to the transmission of data between a plurality of source nodes and a plurality of destination nodes in a communications network comprising a plurality of nodes.
The invention can be applied especially but not exclusively in a shared-medium context. In such a context, the invention applies to information transport systems such as wireless networks in which all the members use a same frequency band accessed using a time-division multiplexing (TDM) or sets of computers sharing a common bus.
Network coding techniques are very recent and have not yet found commercial application except for the "Avalanche" (registered mark) system proposed by Microsoft Corporation. Trials on wireless networks however have been made with encouraging results (see: S. Katti, H. Rahul, W. Hu, D. Katabi, M. M�dard, J Crowcroft, "XORs in the air: Practical Wireless Network Coding". SIGCOMM 2006).
It will be noted that when designing a network coding it is of great importance to have an appropriate adaptation between the network and the used coding in order to avoid a significant degradation of transmitted information. Indeed, in case of incorrect adaptation, instead of receiving information that is partially exploitable, certain nodes may receive only non-exploitable information.
2.1 General Principle of Network Coding
It is possible, through a simple observation, to understand what is at stake in network coding applied to meshed networks. Here below, a quick illustration is provided of the gain given by a network coding. A communications network can be modeled by a directed graph with several arcs going from one vertex to another. A vertex without a finishing arc is called a source of the network. An arc represents a communications channel with the capacity of one information unit per time unit, without prejudging the issue of whether several channels can communicate at the same time.
Referring now to
2.2 The Usable Network Codes
Not all the nodes of a network necessarily take part in a significant coding operation. They may carry out trivial coding, that is they may take incoming data elements and retransmit them. A combining node is the term applied to a node of the network that forms a non-trivial operation on the incoming data.
As we have seen in the above-mentioned examples, a simple code consists of the bit-by-bit addition of data. It follows immediately from this that a linear combination applied to the data coming from the incoming arcs can be used at each encoding node and that a multiplier coefficient can be assigned to each arc going out of the encoding node. At the receiver, if the node knows the various linear combinations used by the "combining" nodes, the decoding is done by applying the inverse matrix formed by the coefficients used in the linear combinations. Naturally, these linear combinations need to be independent.
Furthermore, a node may receive a piece of information which is itself a linear combination of information coming from parent nodes in the hierarchy. The assigning of the nodes must take account of these necessities. Since the data to be transmitted is generally a packet of binary elements or bits having a length q−1, the packets are likened to finite fields with 2q elements. The coefficients of the linear combinations too are chosen in the same finite field.
Koetter and M�dard have explained the way to build a network coding scheme (see: "An Algebraic Approach to Network coding" ACM transactions on Networking, Vol 11, No 5, October 2003.). We consider an oriented graph G=(S, E). S is the set of vertices of this graph. E is the set of arcs of this graph, i.e. the set of pairs of S�S which are connected. Let x be the vector representing the data coming from sources at the same point in time. Let z be the vector representing the incoming data entering the receivers at the same point in time. The network is deemed to be without delay, i.e. there is a matrix M such that z=xM. Let F be the matrix of a adjacency associated with the network but modified in the sense that coefficients replace the "1"s that are normally used to mark the presence of an arc. We then define a matrix A and a matrix B which take account of the coefficients on the arcs entering the network portion considered and the coefficients on the outgoing arcs. The transfer matrix M of the system associated with the network is M=A(I−F)−1BT, where I is the identity matrix of the dimension cardinal (E) x cardinal (E). The coefficients (matrices A and B) are chosen in a large-sized finite field so that the determinant of the matrix M is not zero.
Koetter and M�dard have also proposed a method in the US patent application 2005/015391 in which the coefficients of the matrix are drawn randomly and then transmitted through the entire network to be made known to all the nodes of the network. This method can be applied to networks of unknown topology. The chances of success depend on the cardinal number of the finite field in which the coefficients are chosen randomly.
2.3 Possibility of Network Coding
The US patent application 2005/0010675 proposes a method to build a network coding scheme that applies the prior art described here above to error-free networks with a single source seeking to transmit the same information to several destinations. It produces a solution for the case of an acyclic network with zero delay. It is based on the work of Ahlswede and uses the Ford Fulkerson algorithm (cf "Maximum Flow through a Network" Canadian Journal of Mathematics, 8, pp 399-404, 1956) to create sub-graphs.
Prior work by Ahlswede and al. in 2000 (see article: R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung "Network Information Flow" I.E.E.E. Transactions on Information Theory Vol 46, No 4, pp 1204-1216, July 2000) already contained a major theorem of existence: "let S be the set of sources of a network; let R be the set of receivers of this network; let G be the graph associated with this network; in G there are h disjointed paths (i.e. paths that do not have an arc in common) (Si,Rj) for 1≦i≦h, for a given receiver Rj, with 1≦j≦card(R); then if the number of sources is equal to h (multicasting capacity of the network), there is a multicasting with a throughput h because of the network coding (being assumed that a link has a capacity of one)". The problem therefore lies in testing the graph that represents the network to establish the number of disjointed paths.
Ford and Fulkerson's operational search algorithm is well known for resolving problems of transport, especially to determine the maximum flow between a source and a sink. It is also well known in the prior art that this algorithm can be used to obtain the number of disjointed paths (see Appendix).
The US patent application US2005/0010675 mentioned here above, which is a known solution pertaining to network coding uses this algorithm. However, this known solution has several drawbacks.
One drawback of this known solution is that, even if its authors assert that it can be easily extended, the algorithms presented do not take account of the case of a shared medium which obviously entails the existence of delays. It is easy to prove that their method fails for a shared medium, especially in the computation of multicast capacity.
Another drawback of this known solution is that it does not account of the existence of multiple multicast sources.
Furthermore, and more generally, no known technique of network coding is proposed when the number of sources is strictly greater than h (multicast capacity of the network), i.e. when the condition of the above-mentioned theorem is not respected.
More specifically, it is a goal of at least one embodiment of the invention to provide a technique for building a network coding that can be implemented, if the topology of the network allows it, whatever the number of source nodes in a network and whatever the value of the multicast capacity of this network.
At least one embodiment of the invention is also aimed at providing a technique of this kind that can be applied to a communications network comprising a shared medium.
It is another goal of at least one embodiment of the invention to provide a technique of this kind that is simple to implement and costs little.
One particular embodiment of the invention proposes a method for building a network coding scheme adapted to the transmission of data between a plurality of source nodes and a plurality of destination nodes in a communications network comprising a plurality of nodes, said method comprising the following steps:
Thus, in this particular embodiment, the invention relies on a wholly novel and inventive approach consisting of the determining of a sub-network that can support a network coding, i.e. a sub-system for which the following condition of the above mentioned theorem is verified: "the number of sources is smaller than or equal to h (multicast capacity of the network)". The determining of this sub-network is based on the determining of the intersection of the first sets of source nodes (each first set comprising source nodes can attain a given destination node with disjointed paths).
It must be noted that for certain topologies of the network, it may happen that no sub-network can be determined and therefore that no network coding can be built.
Advantageously, the cardinal number of each first set of source nodes is the maximum.
Thus, the number of source nodes of the second set (resultant of the intersection) is optimized (maximized) and the quality of the network coding built is improved (since it implies a sub-network comprising more source nodes).
In one particular embodiment, said method comprises a step for obtaining a predetermined sequence order indicating the order in which said nodes can access a shared medium included in the communications network, and said step for determining a first set of source nodes for each destination node comprises the following steps:
Thus, in this particular embodiment of the invention, the proposed technique is adapted to a network comprising a shared medium, through the taking into account of the notion of an order of sequence of access of the nodes to this shared medium.
Advantageously, said step for determining a first set of source nodes, for each destination node, comprises a step for determining the disjointed paths, based on the Ford Fulkerson search algorithm modified to take account of said step of verification of consistency with the predetermined sequence order.
Thus, in adapting the Ford Fulkerson search algorithm, the advantages associated with it are obtained. At the same time, the invention remains in the context of a shared medium.
According to an advantageous characteristic, said step for building a network coding comprises the following steps:
This enables the use of a finite field for the coding, this finite field comprising a larger number of elements, and hence reduces the computation capacities and resources needed.
Advantageously, said method comprises the following steps:
Thus, a simple definition is made of the cases of execution of the method according to the invention (apart from the classic cases of execution, for example when the network is started up and at each change of the topology of the network).
In another embodiment, the invention pertains to a computer program product downloadable from a communications network and/or recorded on a computer-readable carrier and/or executable by a processor, said computer program product comprising program code instructions for the implementation of the above-mentioned method (according to at least one embodiment) when said program is executed on a computer.
In another embodiment, the invention relates to a storage means that is possibly detachable, readable by a computer, storing a set of instructions that can be executed by said computer to implement the above-mentioned method (according to at least one embodiment).
In another embodiment, the invention concerns a device for building a network coding scheme adapted to the transmission of data between a plurality of source nodes and a plurality of destination nodes in a communications network comprising a plurality of nodes, said device comprising:
Advantageously, the cardinal of each first set of source/nodes is the maximum.
In one particular embodiment, said device comprises means for obtaining a predetermined sequence order indicating the order in which said nodes can access a shared medium included in the communications network, and said first determining means enabling the determining, for each destination node, of a first set of source nodes, comprise:
Advantageously, said first determining means enabling the determining of a first set of source nodes for each destination node, comprise means for determining the disjointed paths, implementing the Ford Fulkerson search algorithm modified to take account of said verification of consistency with the predetermined sequence order.
According to an advantageous characteristic, said means for building a network coding scheme comprise:
Advantageously, with encoded data being exchanged between the nodes of said sub-network in using said network coding, said device comprises:
Other features and advantages of embodiments of the invention shall appear from the following description, given by way of an indicative and non-exhaustive and from the appended drawings, of which:
In all the figures of the present document, the identical elements and steps are designated by a same numerical reference.
6.1 Method
Referring now to
This method can be executed when the network is started up or as soon as there is a change in topology.
The step E1 is the step for capturing the topology of the network. The means used to know the topology of the network are described in paragraph 6.2.1 here below. From the topology, the process also extracts the source and destination nodes and stores them in two lists.
In the step E2, to create the graph, each node has an associated vertex of the graph. If the quality of reception from one node to another is sufficient, then an arc (directed edge) is created between the vertices representing them, the arc is directed towards the reception vertex.
It is possible to consider flows across a graph by designating a source node and a destination node. In order to consider such a flow, we need to define an ability of arcs to carry a flow. This is done by the capacity function c(u, v), which defines an ability to carry flow on an arc between node u and node v.
Such a graph, which may carry a flow, may be represented by an adjacency matrix. An adjacency matrix is a K�K matrix, where K is the number of nodes in the graph. An entry auv in an adjacency matrix is equal to the capacity function of the arc between u and v, i.e. equal to c(u, v).
In the step E3, the graph obtained is extended by the addition of a virtual source vertex having arcs towards all the multicast source vertices representing source nodes of the real network.
The method now necessitates the exploration of the paths leading from the virtual source to each of the destination nodes. To this end, at the step E4 the process initializes to zero a counter i indexing the destination nodes counted in the list obtained through knowledge of the topology at the step E1, and initializes the capacity of the graph (variable Min) to the total number of real source nodes for which the minimum value is sought. The counter is incremented at the step E10. Its final value (the number of destination nodes) is tested at the step T5.
The step E6 is iterated for each destination node (vertex) and consists of a search for the disjointed paths that lead to that destination node.
In a preferred embodiment of the invention the search consists of finding the maximum number of disjointed paths for a given destination node, even if it is possible to select any number of disjointed paths. In this latter case however, the multicasting throughput may not be maximum.
This search of the maximum number of disjointed paths is performed preferably by using a modified Ford Fulkerson algorithm (described in detail in paragraph 6.2.2 here below).
In the modified Ford Fulkerson algorithm, the capacities of all arcs (u, v) of the extended graph are set equal to one. This algorithm is applicable to the extended graph in which the source node (virtual source node) has no incoming arcs and a destination node (i) has no outgoing arcs.
The Ford Fulkerson algorithm allows computation of a maximum flow between the source node and the destination node. The maximum flow may involve sub-flows passing along different paths and consequently along different arcs.
Due to the setting of the capacities of all the arcs to one, all the paths participating in the maximum flow are disjointed paths. The number of disjointed paths, relatively to destination node i, can thus be computed.
Each time that a maximum flow is obtained, the process stores the disjointed paths of the sub-graph participating in this maximum flow (step E7).
If the number of disjointed paths is smaller than the number stored in the variable Min (test T8), the process replaces this value by the new value at the step E9.
Steps E6 and E7 and test T8 are repeated for all destination nodes.
From each set of disjointed paths determined for a given destination node, a set of real source nodes is obtained corresponding to the source nodes belonging to those disjointed paths and with which the virtual source node has arcs. A set of source nodes is thus obtained for each destination node. The cardinal of each set is equal to the number of disjointed paths for that destination node.
If the minimum Min found after executing the above steps is less or equal to 1 (test T11), then the coding is declared to be impossible and the algorithm jumps directly to the step E30. If not, at the step E12, a resultant set of source nodes is determined by the intersection of the different sets of real source nodes obtained for the different destination nodes.
Each destination node is thus reachable via disjointed paths by all the sources nodes of the determined resultant set. The nodes of the graph involved in all these paths, i.e. participating in the flows coming from the source nodes of the resultant set and reaching all the destination nodes, are determined. They form with the source nodes of the resultant set a resultant sub-graph in which a network coding is to be applied.
To this end, it is possible to use the previously determined disjointed paths between real source nodes participating in the flow and the destination nodes. These paths will have been stored during the previous search. Alternately, it is possible to re-apply the search for disjointed paths made by the Ford Fulkerson algorithm between the real source nodes participating in the flow and the destination nodes.
Then, from the sub-graphs representing these flows, i.e. the resultant sub-graph, the process extracts an adjacency matrix M at the step E13. For example, the matrices describing the flows sub-graphs are added term by term and then the non-zero terms are replaced by a 1 to obtain a non-weighted adjacency matrix (the elements of the adjacency matrix are thus zeros or ones). This matrix is a square matrix and has a dimension corresponding to the number of nodes of the sub-graph.
A coding matrix is afterwards generated from the adjacency matrix. This is performed by assigning, to every non-zero coefficient of the matrix (test T18), a pseudo-random element drawn from the finite field (step E20). Steps E14, E16, E19 and E21, and tests T15 and T17 allow to cover all the coefficients of the matrix. One means for computing this coding matrix is described in paragraph 6.2.3 here below.
Once the exploration of all the rows and all the columns is finished, the process will determine the system matrices corresponding to each destination node. The term "system matrix corresponding to the destination node i" and the notation S(i) are applied to the matrix used to retrieve the packets (or vectors) sent by the source nodes from the packets (or vectors) received by the destination node i. The term "system" herein evokes the linear system to be resolved at the destination node i in order to retrieve the original data. The linear system is resolved by inversion of the matrix S(i).
In order to ascertain that the process has taken place without any problems, a test counter K is set at zero (step E22). Then, in the step E23, a counter i indexing the list of the destination nodes is set. The counter is tested for its final value at the step T24 and incremented at the step E26. The means described in the paragraph 6.2.4 here below, which is an algorithm extracting the matrix S from the matrix M, is used iteratively to obtain the system matrix S(i) of each of the destination nodes (step E25).
The iteration is broken if a matrix S(i) is non-invertible, i.e. if its determinant is zero (test T27) then the process increments the counter K by the number of unsuccessful attempts (E34) and recommences the drawing of random coefficients for the coding matrix (returning to step E14). When there are too many failures (test T28), it may be decided to stop the procedure (step E30) and the network will then make use of the usual routing and the packets will not be combined.
If the matrix S(i) is invertible (test T27), the system matrix S(i) is inverted (step E29) and the counter i is incremented (step 226) before returning to the step T24.
Note: in the prior art, the header of the packet frequently conveys an identifier of the source of the packet. In this invention, if the source takes part in the network coding, the identifiers of the real sources of the packet may, for example, be conveyed in the header as and when the nodes combine several packets. The receiver then knows that it must use the packet in combination with others and that it should rely on the system matrix to retrieve the original information. If the source does not take part in the network coding, the packet is directly exploitable. However, the topology and the order in which the medium is accessed are known. Therefore, the header is redundant. This new means for transporting numerous identifiers can be a precaution against errors.
If all goes well, then after the determining and inversion of all the system matrices (test T24), the set of nodes taking part in the resultant sub-graph can start the exchange of encoded data (step E32).
During the exchange of data, every node of the resultant sub-graph may monitor that the network coding as initially configured is still well adapted to network conditions and it may trigger a reconfiguration of the network coding if necessary. For example, if an insufficient number of packets necessary to correctly encode or decode data is received by one of the participating nodes (test T31), this node can inform all the other nodes of an error and prompt a re-execution of the whole method (step E33).
6.2 Device
The invention can be obtained equally as a program executed on a re-programmable computing machine (a PC, a DSP or a microcontroller) or on a dedicated computing machine (a set of logic gates such as an FPGA or an ASIC).
This program has several algorithms implemented in a distributed fashion.
The computation field used for the algebraic codes is a finite field. The operations of addition and multiplication require means different from those usually encountered in computers, but are known to those skilled in the art.
6.2.1 Means Used to Know the Topology of the Network
Several embodiments are possible and known to those skilled in the art for knowing the topology of the network, i.e. the exhaustive list of the nodes participating in the network as well as the state of communications between the nodes and the order in which nodes access the shared medium.
This topology can be known to the nodes of the network by construction, if the network is fixed and has a constant number of nodes. This information can also be introduced by the user after the installation of a system.
6.2.2 Distributed Algorithm for Determining Disjointed Paths
The distributed algorithm for determining disjointed paths is described using the following pseudo-code.
Modification of the Ford Fulkerson Algorithm:
c(u,v)=1 for all adjacent u,v.
Input: the network (G,s,t,c).
Output: a maximum flow f between s and t.
Color [t]= black;
MaxFlowValue =−1 ;
While Color[t]= black
1. f(u,v) = 0 for all the adjacent vertices u, v.
color = white for all the vertices.
u=s ;
Breadth-FirstSearch[u] ;
MaxFlowValue = MaxFlowValue +1 ;
The Breadth-First Search takes account the order of access (index) to the shared medium (index), through the following two tests which appear in the pseudo-code below of this Breadth-First Search ("Breadth-FirstSearch [u]"):
In the first test, the condition verifies the order of sequence of the nodes of the network unless the node to be marked v is the destination node (v=t). Indeed, this node, which is the last node of a path, no longer needs to relay information and benefits from all the copies received.
In a shared medium network, the order in which the nodes access the medium is predefined and known to all the nodes.
Breadth-FirstSearch [u]:
1. While FIFO is not empty u = OffFFO[ ] ;
For all the nodes v of G
If color [v] = white and c(u,v)−f(u,v)>0 and
index(u)<index(v) or v=t
InFIFO[v] ;
Π[v]=u ;
Color [v]= black;
If color [v] = white and f(v,u)>0 and index(v)<index(u)
InFIFO[v] ;
Π[v]=u ;
Color [v]= black;
2. Color[u]= black;
The maximum flow is simplified, with the increment always being equal to 1 in this problem.
Maximum_Flow [u]Start
f(Π[u],u) = f(Π[u],u) + 1;
f(u,Π[u]) = f(u,Π[u]) − 1;
v = Π[u];
Maximum_Flow [v];
The above Maximum Flow function is recursive and its stopping criteria is matched when the function is called for variable v that equals 'NIL' (in this context the predecessor of zero).
These algorithms are applied between the virtual source s and each destination node t. The flow obtained is stored along with the sources participating in one of the disjointed paths. A comparison is then made on the values of the maximum flows. The capacity of the network is the absolute minimum of these values of maximum flow. In order that a code may be possible, this minimum should be equal to the number of source nodes that can participate. The participating source nodes are determined as being the intersection of the set of source nodes participating in the disjointed fields.
The data coming from the non-participating source nodes will use orthogonal channels in order to be conveyed.
It can be noted that the solution found is one among others. It must be noted that the problems related to graphs are almost all complete NP (for "non-polynomial", referring to the complexity of an algorithm) problems. Here, we verify one of the possible solutions, which is performed in polynomial time. The obtaining of all the solutions exhaustively is not done in polynomial time.
If the FIFO is not empty, then the variable u is loaded with the content of the FIFO at the step E608 while at the step E609 the variable v is set at zero (the virtual source may have been numbered zero but this is not necessarily so. If this were to be the case, the initial value can be 1).
This variable v represents the other vertices of the graph, and the algorithm makes a test at the step E610 to ascertain that all the vertices have been examined. If the answer is yes, a search must be made for a new starting vertex in the FIFO. If not, a test is made at the step E611 to find out if the vertex has already been marked. A positive response implies that the next vertex should be examined, by increment at the step E619. If there is a negative response, the algorithm must make a test to find out if the capacity of the arc between u and v is greater than the stream which can flow therein (step E612). The capacity is equal to 1 if there is an arc between the vertex u and the vertex v. If not, it is equal to zero. In the prior art this capacity is not limited. A number of changes and simplifications of the Ford Fulkerson algorithm flow from this limitation. A positive response at the step E612 means that the algorithm can then perform a test at the step E613 to find out if the order in which the nodes access the medium is compliant (i.e. whether the condition "index(u)<index(v)" is verified), so as to select only disjointed paths that can be physically set up. Indeed, the algorithm relies on a representation of the network that removes the problem of access to the medium so as to keep only relationships that are possible from one node to another. For example, in a wireless network, the node A is linked to the node B if the distance between A and B is small enough for B to receive a signal with a signal-to-noise ratio such that the demodulation of the signal is possible. If other nodes wish to communicate without interference on the same physical medium, a system of orthogonalization is necessary to ensure access, for example TDM or FDM or a combination of all these means. Even if in an FDM several nodes can access the medium at the same time, for the network coding to work, the message should be received by a node before being encoded and retransmitted. An index is therefore defined for the vertices of the graph which represent the time at which the node corresponding to the vertex can access the medium. The step E613 thus ensures that the message will be received before being encoded and constitutes a remarkable difference as compared with the prior art which is an implementation of the Ford Fulkerson algorithm.
If the response is negative at the step E613, the algorithm ascertains that the vertex tested (v) does not represent the destination node (t) (test of the step E618).
The algorithm computes a path. Its result is used to determine the number of disjointed paths between source and destination. It is therefore executed several times. When it is called again, it should be able to question the paths already set up in the previous calls. To do this, the arc (v, u) is a candidate to be an element of an alternative path. As a consequence, it is assigned a flow equal to −1. During the exploration, if the capacity of the arc between u and v is smaller than or equal to the stream that must flow therein (negative response at the step E612), then the algorithm tests whether the arc (v, u) is a possible path (step E614) and whether the order in which the medium is taken by v and u is compatible with this direction of exploration (i.e. whether the condition "index(v)<index(u)" is verified) (step E615).
If the response is negative at the step E615, the algorithm ascertains that the vertex tested does not represent the destination node (test of the step E118).
A positive response at the step E613, E615 or E618 leads, at the step E616, to the placing of the tested vertex (v) in the FIFO to take account later of the vertices neighboring this vertex. The algorithm must store that vertex which preceded the tested vertex, so that the recursion may function. The algorithm can then mark the vertex as processed and assign it the color black at the step E617. Then the algorithm goes to the next vertex (step E619).
When all the vertices have been processed, then the FIFO is empty (test step E606 again). The algorithm then assigns the initial vertex the color black (step E607).
It is then necessary to update the flows between the vertices. This is again a recursive process which scans the path between the source vertex and the destination vertex, this time from bottom to top. To this end, a variable u is initialized with a number of the destination vertex (t) at the step E620. So long as the current vertex has a predecessor (test E621), the algorithm will add 1 to the value of the flow between u and its predecessor (E622) and deduct 1 from the value of the flow between its predecessor and u (step E623). Then the predecessor becomes the current vertex (step E624). When there is no longer any predecessor (test step E621), the process of updating the flows stops.
6.2.3 Algorithm for Computing the Network Coding and Assigning Coding Coefficients
An algorithm is used to set up the coding matrix of the network obtained beforehand. The number of coefficients to be drawn is indicated by the rows of the matrix. A pseudo-random generator at output in the finite field is used. A generator of this kind is obtained for example by making a bijection between the outputs of a generator according to a normal law reduced to an interval [1 q] in the set of integers (see the above-mentioned patent application: US2005/0152391, M. Effros, T. Ho, R. Koetter, M. M�dard, D. Karger "Randomized Distributed Network Coding"), then in taking the element of the finite field corresponding to the bijection. Since all the nodes have the same starting point for the draws, they will all successively draw exactly the same coefficients. It is possible, as a storage means, to use an adjacency matrix in which the unit coefficients indicating a arc will be replaced by the coefficients of the pseudo-random code. Indeed, the identity of coefficients leads to identical adjacency matrices for all network nodes.
6.2.4 Algorithm for Computing Resolution Matrices of the Linear Systems Built by Network Coding
It is possible that the number of incoming arcs in a destination node is greater than the number of sources. There is then a redundancy. The computation device proposed here above advantageously eliminates this redundancy. When the maximum number of sources is n, the system matrices obtained are n-ranked squares. The system matrix of a node is used to retrieve the data sent out by the sources on the basis of the data received at the destination node.
The following algorithm is used to build a matrix S(J) associated with the destination node J. This algorithm is therefore to be used for all the destination nodes. It is based on a variation of the "depth first search", which is a well known algorithm for the exploration of graphs.
Input: F
Output: M
M(LM,CM) = 0 for LM,CM from M to Number_of_sources
For lf= 1 to N
COEFMEM(lf)=0 ;
LM=Number of sources ;
CM=Number of sources ;
lf=N ;
while lf > 0
If F(lf, cf)=0
lf = lf −1 ;
COEFMEM(lf)= COEF;
COEF = F(lf, Cf) . COEF
Collection (lf) ;
If cf = J //there is a return to the initial
For lf= 1 to N COEFMEM(lf)=0 ;
End if
lf = lf −1 ;
End if
End while.
If cf belongs to the list of sources
CM= index_in_list_sources(cf) ;
COEF= COEFMEM(cf) ;
End if
End collection
In this algorithm, the matrix M is explored in starting with the last column. When the coefficient is not zero, it is used to compute one of the coefficients of the matrix S. This algorithm is recursive and uses breadth-first search too but from bottom to top. The operation determines which coefficient of the matrix X corresponding to the destination node i has been obtained when the algorithm leads to a source, at the first row of M.
The matrix S should have a non-zero determinant, otherwise it is not invertible. The probability of this latter event depends of course on the inverse of the dimension of the finite field from which the coefficients have come and on the number of coefficients in the product. Indeed, in a multiple product it is enough that only two of the coefficients should form a zero product for the entire product to be zero. Furthermore, a number having been drawn by chance from the finite field, there is one chance relative to the dimension of the field that its complementary value will be drawn. Hence, this probability tends towards zero when the dimension increases, but be that as it may, if the determinant is zero, the step for drawing the coefficients has to be restarted. This further diminishes the probability of coefficients leading to a zero determinant being drawn again.
It is necessary to limit the number of reiterations of the step for drawing the coefficients. Indeed, if the determinant of the matrix remains zero after several consecutive trials, it means then that it is certain that an error has entered during the preceding steps. It will be easy then to conclude that the network coding cannot be done and therefore that a traditional routing should be used.
The inversion will be done by many possible algorithms, in transposing the computations in the finite field. A certain number of these algorithms is listed in the following reference: W. Press, S. Teukolsky, W. Vetterling, B. Flannery, "Numerical recipes in C", Cambridge University Press 2nd ed. 1992.
The order of the rows of the system matrix is arbitrary. The messages coming from the previous nodes should be taken into consideration in the same order.
6.3 Example
The adjacency matrix of this network is the following, according to the order of access to the medium, A B C D E F:
The pseudo-random coefficients are then drawn, and the same coefficient is assigned to the arcs coming out of the same node. The coding matrix is obtained:
The algorithm then scans the columns of this matrix in focusing on the destination nodes E and F to determine their system. The operation then starts from the columns associated with the destination nodes. For the column of E, the coefficient α and the coefficient δ corresponding to the nodes A and D are found. A is a source whose first source/destination path is complete. D is a relay linked to C which is linked to the two sources A and B. Respectively, the two paths starting from A and B are associated with the coefficients δ.χ.α and δ.χ.β. The system matrix of E is therefore the inverse of:
It must be ascertained that the determinant is not zero. The determinant here is αδχβ. It is therefore necessary that the pseudo-random draw should not have produced numbers whose product is zero. In a field such as F(21500), this probability is 4/1500, i.e. 1/375. The occurrence of the zero matrix event is not negligible and justifies the verification. For the column of F, we find the coefficient β and the coefficient δ. B is a source whose first source/destination path is complete. D is a relay connected to C which is connected to the two sources A and B. Respectively, the two paths leaving A and B are associated with the coefficients δ.χ.α and δ.χ.β. The system matrix of F is therefore the inverse of:
We therefore see the gain in time as compared with a classic routing. In the classic routing, A would have transmitted to E and then to C. C would have transmitted to D, then D would have transmitted to F. B would have transmitted to F then to C. C would have transmitted to D, then D would have transmitted to E. The medium has to be accessed eight times in order to convey the information. In the encoded system, it is necessary for the medium to be accessed four times (A speaks, B speaks, C speaks, D speaks).
Given directed graph G=(S, A). Let s be a source vertex (s does not have any incoming arc), let t be a sink vertex (t does not have any outgoing arc).
For each pair of vertices {u, v} belonging to A, (u, v) denotes the arc starting at u and finishing at v.
An integer C (u, v) is defined, this integer defining a capacity (zero if there is no arc between u and v, i.e. if (u, v) does not belong to A).
A flow is an application f of S�S to the set of positive integers or zero, such that:
A saturated flow is a flow f(u,v) equal to the capacity c(u,v), (u,v) belonging to A, (the set (G,s,t,c) denotes a network.
Ford Fulkerson Algorithm (1956)
Input: the network (G,s,t,c).
Output: a maximum flow f between s and t.
Color [t]= black;
MaxFlowValue =−1 ;
While Color[t]= black
1. f(u,v) = 0 for all the adjacent vertices u, v.
color = white for all the vertices.
u=s ;
Breadth-FirstSearch[u] ;
MaxFlowValue = MaxFlowValue +1 ;
The fact of exploring the graph in width and in order of relationship implies the use of a LIFO (Last In First Out) memory to memorize the descendants of a node having the same parenthood. The description of these operations in a memory is given by
Initialization :
i=0 ;
k=0 ;
FIFO[i]=v ;
OffFIFO[ ]
Breadth-FirstSearch [u]
1.While FIFO is not empty u = OffFFO[ ] ;
For all the nodes v of G
If color [v] = white and c(u,v)−f(u,v)>0
Color [v]= black;
2. Color [u]= black;
increment = minimum(increment, c(Π[u], u) − f [Π[u],u));
Maximum_Flow [u]
f(Π[u],u) = f(Π[u],u)+ increment;
f(u,Π[u]) = f(u,Π[u])− increment;
v = Π[u];
Maximum_Flow [v];
End ;
This algorithm uses known techniques of graph exploration. The first technique is that of recursion. The algorithm is applied identically to all the vertices as and when they are taken into account. The letter Π contains the predecessor vertex (also called parent vertex) of the vertex being processed. The second technique is a technique for the marking of the vertices being executed, to find out if the vertex has been taken into account or not. Here, the marking is represented by the color of the vertex: black if already processed, white if not. Finally, there are only two ways of processing recursion, it is possible to explore an entire branch from top to bottom or from bottom to top (Depth First Search) or it is possible from a same vertex to explore all the immediately adjacent vertices (Breadth First Search). It is the last-named method that is used here. The term "flow" is used to represent any throughput rate flowing in the same direction, whether it is cars, goods, electricity in a circuit, messages etc because the applications of this algorithm are not limited to information theory.
|Cited Patent
|Filing date
|Publication date
|Feb 23, 1999
|Aug 1, 2000
|At&T Corp.
|Optical layer quasi-centralized restoration
|Sep 17, 2001
|Apr 5, 2005
|Canon Kabushiki Kaisha
|Devices and methods for estimating a series of symbols
|Mar 14, 2001
|May 24, 2005
|Canon Kabushiki Kaisha
|Method and device for evaluating the noise associated with turbocodes, and systems using them
|Feb 16, 2001
|Mar 13, 2007
|Canon Kabushiki Kaisha
|Methods and devices for sending and receiving information, and systems using them
|Dec 1, 1999
|Jul 3, 2007
|Verizon Corporate Services Group Inc.
|Multiservice network
|Dec 16, 2004
|Jun 24, 2008
|Canon Kabushiki Kaisha
|Error locating methods and devices for algebraic geometric codes
|Jan 13, 2005
|Jun 24, 2008
|Canon Kabushiki Kaisha
|Decoding for algebraic geometric code associated with a fiber product
|Jul 21, 2004
|Jul 8, 2008
|Canon Kabushiki Kaisha
|Information encoding by shortened Reed-Solomon codes
|Sep 29, 2004
|Jul 22, 2008
|Canon Kabushiki Kaisha
|Encoding/decoding device using a reed-solomon encoder/decoder
|Apr 28, 2005
|Sep 9, 2008
|Canon Kabushiki Kaisha
|Method and device for evaluating the noise associated with turbocodes, and systems using them
|Mar 22, 2005
|Dec 2, 2008
|Canon Kabushiki Kaisha
|Channel encoding adapted to error bursts
|Dec 29, 2003
|Dec 9, 2008
|Canon Kabushiki Kaisha
|Algebraic geometric code adapted to error bursts
|Feb 25, 2005
|Mar 10, 2009
|Canon Kabushiki Kaisha
|Decoding and error correction for algebraic geometric codes
|Sep 26, 2003
|Jun 9, 2009
|Alcatel-Lucent Usa Inc.
|Restoration path calculation in mesh networks
|Dec 14, 2001
|Feb 2, 2010
|Hughes Network Systems, Inc.
|Inroute training in a two-way satellite system
|Sep 26, 2003
|Mar 30, 2010
|Alcatel-Lucent Usa Inc.
|Primary/restoration path calculation in mesh networks based on multiple-cost criteria
|Jun 10, 2001
|May 20, 2004
|Agee Brian G.
|Method and apparatus for optimization of wireless multipoint electromagnetic communication networks
|Jun 23, 2003
|Jan 13, 2005
|Microsoft Corporation
|System and method for computing low complexity algebraic network codes for a multicast network
|Mar 10, 2004
|Jan 20, 2005
|Siemens Aktiengesellschaft
|Visualization of a comparison result of at least two data structures organized in directory trees
|Nov 17, 2004
|Jul 14, 2005
|Michelle Effros
|Randomized distributed network coding
|Apr 18, 2007
|Jan 3, 2008
|O'brien Ray
|Packet voice gateway
|Apr 24, 2007
|Oct 30, 2008
|Buddhikot Milind M
|Apparatus and method for practical and efficient broadcast in mobile ad hoc networks
|Dec 22, 2005
|Oct 30, 2008
|Canon Kabushiki Kaisha
|Decoding Method for Algebraic Geometric Codes and Associated Device
|Jul 28, 2008
|Feb 5, 2009
|Canon Kabushiki Kaisha
|Method of decoding content data blocks, corresponding computer program product and decoding device
|Oct 6, 2008
|Apr 9, 2009
|Equilibrium Networks
|System and method for information assurance based on thermal analysis techniques
|Oct 17, 2008
|Apr 23, 2009
|Canon Kabushiki Kaisha
|Iterative decoding in a mesh network, corresponding method and system
|Sep 2, 2009
|Dec 24, 2009
|Richard Reisman
|Method and Apparatus for Browsing Using Multiple Coordinated Device Sets
|Ahlswede, et al., "Network Information Flow," IEEE Transactions on Information Theory, vol. 46, No. 4, p. 1204-1216, Jul. 2000.
|Ford, Jr. et al. "Maximal Flow Through A Network," Canadian Journal of Mathematics, vol. VIII, No. 3, p. 399-404, 1956.
|Katti, et al., "XORs in The Air: Practical Wireless Network Coding," SIGCOMM '06, Pisa, Italy, p. 243-254, Sep. 11-15, 2006.
|Koetter, Ralf, "An Algebraic Approach to Network Coding," IEEE/ACM Transactions on Networking, vol. 11, No. 5, p. 782-795, Oct. 2003.
|Citing Patent
|Filing date
|Publication date
|Aug 5, 2014
|Dec 13, 2016
|Huawei Technologies Co., Ltd.
|Network coding method, relay apparatus, and selection apparatus
|Sep 30, 2014
|Feb 21, 2017
|Alcatel Lucent
|Devices and methods for content distribution in a communications network
|Sep 30, 2014
|Jun 20, 2017
|Alcatel Lucent
|Devices and methods for network-coded and caching-aided content distribution
|Jan 13, 2014
|Sep 26, 2017
|Samsung Electronics Co., Ltd.
|Transmitter, relay, receiver, and cooperative communication system using network compress-and-forward scheme
|Sep 30, 2014
|Jul 23, 2015
|Alcatel Lucent Usa, Inc.
|Devices and methods for network-coded and caching-aided content distribution
|Sep 30, 2014
|Jul 23, 2015
|Alcatel Lucent Usa, Inc.
|Devices and methods for content distribution in a communications network
|Feb 10, 2012
|Aug 14, 2013
|Network coding method, relay device and screening plant
|Feb 10, 2012
|Apr 8, 2015
|Network coding method, relay device and screening plant
|U.S. Classification
|370/254, 370/252
|International Classification
|Cooperative Classification
|European Classification
|May 29, 2009
Owner name: CANON KABUSHIKI KAISHA, JAPAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LE BARS, PHILIPPE;SEVIN, JULIEN;REEL/FRAME:022751/0989
Effective date: 20090429
|Nov 2, 2011
Effective date: 20110816
Free format text: SECURITY AGREEMENT;ASSIGNOR:VARAHA SYSTEMS INCORPORATED;REEL/FRAME:027189/0066
Owner name: SILICON VALLEY BANK, CALIFORNIA
|Sep 3, 2014
|Fee payment
Year of fee payment: 4


text:
24 Sep 2016
The event is over
Loren Andrus Octagon House
Washington / Michigan / United States of America
WKCC Show is a great event to buy, sell, invest, and trade custom knives. This 1 day knife show is being organized by Wolverine Knife Collectors Club (WKCC). The venue of this event is Loren Andrus Octagon House which is located in Washington, Michigan, United States of America. The event will be held on 24 September 2016, Saturday. WKCC Show will showcase a wide range of products and services related to gun & knife sectors from the leading exhibitors, for example, old knives, new knives, scrimshaw, factory knifes, custom knife making, and knife making supplies. Over 100 exhibitors are expected at this event to showcase their products and services. The frequency of WKCC Show is biannual (twice a year). The first year of this knife show is 1978.
Address : 57500 Van Dyke Avenue
City : Washington, MI
Country : United States of America
Phone : +1 586-781-0084
Greencastle Mason Dixon Gun Show
Wolverine Knife Collectors Club (WKCC)
Address: P.O. Box 52
City: Belleville, MI
Country: United States of America
Phone: (810) 750-2897
Phone: (586) 786-5549
|Start Date
|24 September 2016, Saturday
|End Date
|24 September 2016, Saturday
|Gun & Knife
|Loren Andrus Octagon House
|Washington, MI
|United States of America
|Wolverine Knife Collectors Club (WKCC)
|First Year
|Open to
|The public


text:
Stimulus Greed Endangers Tribe's Cultural History, American Indians Say
It is not exactly the mortgage mess, but it strikes a similar chord.
When Congress passed the economic stimulus package
in 2009, it promised billions of dollars to shovel ready government projects that could get up and running quickly. But the scramble for the flood of money led to some shortcuts being taken to meet start-up deadlines -- leaving problems that will have to be dealt with later.
It's no magic trick. Harry Potter, the fictional boy wizard, is making owls disappear in India, Environment Minister Jairam Ramesh says.
His comments came during a presentation of a new report by a conservation group, Traffic, which offered a new study blaming a black market for trading in the highly endangered owl species in India.
The report says the owls are often being trapped for black-magic rituals. "Shaman or black magic practitioners frequently referred to as tantriks in India, prescribe the use of owls and their body parts such as skull, feathers, ear tuffs, claws, heart, liver, kidney, blood, eyes, fat, beak, tears, eggshells, meat and bones for ceremonial pujas and rituals."
Some call members of the Kalash tribe the descendants of Alexander the Great. A unique race living in the lap of the mighty Hindu Kush range for centuries with an independent socio-cultural identity that follows traditions similar to Indo-Iranian culture (Vedic and pre-Zoroastrian), the Kalash are often referred to as the only pagan tribe in Pakistan.
Juan Bautista Agreda Chindoy, an indigenous healer from Colombia's Valle de Sibundoy, was arrested in Houston airport, U.S., El Tiempo reports.
On October 19 the medicine man travelled to the United States to give a healing session on Ayahuasca, a herbal mixture.
Border police arrested the indigenous healer due to the exotic herbs in his possession.
"He has been treated like a drug dealer but he is an indigenous healer," Agreda's family insists.
KAPIT: Some 200 Iban elders and chieftains will seek the help of their Petara (gods) to punish those who were responsibile for the logjam in Rajang River and its tributary Baleh River.
According to an Iban shaman, who refused to be identified, they will be performing the traditional miring (ritual) next month to seek the help of the spirits because the government has refused to act against those responsible for the logjam.


text:
Malcolm Turnbull, in a recent speech invented a parable about a foolhardy smoker to illustrate his claim that contesting the views of the "best scientists" on man-made climate-change is an "attack on science". But does this parable make sense? Should we consider the the claimed "consensus" of science-policy bodies on dangerous global warming to be […]
Peter Gallagher
Peter Gallagher is a leading Australian consultant on trade and public policy.[bio].
"I can help you with strategies for, and analysis of, international markets, law and regulations, trade agreements, export policies, import restrictions… I also offer reports, conferences and master-classes for government officials and industry associations on international trade research."
Email: Peter Gallagher


text:
2014 was filled with challenges, a few surprises and plenty of learning for my team at Evolve Systems. I was fortunate enough to take a week long retreat this January and spend time reflecting on all that happened as well as all that we have planned for the future. To be honest it was a lot to ponder and a bit overwhelming. So I decided to share our story of 2014 and our Vision 2020 with you, our faithful friends, colleagues and fans. It has been rather therapeutic to put this in writing and post it to our blog. I hope you find it helpful as you reflect on your own 'state of the business'.
2014: A year of challenge and surprise
I hesitate to describe 2014 as a year of challenge and surprise because every year in business could be defined that way. Challenges are for meant for learning and we did our fair share from two in particular.
Challenge #1: Losing clients unexpectedly. The result was lost revenue. But our takeaway was to learn what we could from the loss and move on. Don't dwell on it. Pick yourself up and go get new clients. We did, and we are stronger for the experience.
Challenge #2: Losing an essential employee unexpectedly. The result was a brief episode of panic and worry about replacing her. But our takeaway was that a little planning goes a long way. We had worked with this employee to create a manual that outlined her role and responsibilities. That one thing made replacing her and training the new employee much easier. We did, and we are looking to implement this type of process documentation across the organization.
2015: A year of change and growth
The one word that defines our focus in-house is communication. We organized a staff strategy session to create a list of goals and strategies as a group. We also held a team building session in 2014. The results spilled over into the new year with a measurable shift in our internal culture toward teamwork and communication. Growth will be driven by a refreshed business plan that leads us to expand our reach beyond the local to a regional presence and client base. 2015 will also be a year of growing our team in the technical, project management and sales departments. And a final item from our list: update our own website. Whew.
Vision 2020: Our five-year plan
Focus and a clear vision for the future. That's the concept behind Vision 2020. Five years from now we will ring in the year 2020. As we work to develop our longer term strategy we will be partnering with you, our clients to become an integral part of your Vision 2020 as well. The ever-changing landscape of the internet, apps, mobile, social media and ecommerce will require our constant attention. Yours and ours combined. We will need to partner with you, side by side, in order to stay relevant and keep our companies growing. So we are developing a program to partner with you more effectively. More to come on this exciting new concept!
I do hope this summary has been helpful and piqued your interest in Vision 2o20.
What is important to your business in the next five years? What type of technology partner do you need to help you get there? Comment below or contact me with your ideas and let's build Vision 2020 together.


text:
English Tutors in Mantampay, Philippines
Find Private & Affordable English Tutoring in the Mantampay Area!
third year student taking bachelor of elementary education at st. peters college iligan city
graduated as cum laude bachelor in elementary education major in science
Bachelor in Science Major in Entrepreneurial Marketing at Iligan Institute of echnology
Graduated and completed Elementary Education on April year 2001 at South 1-A Central School, Tubod Ros. Hghts, Iligan City,...
A license chemical engineer from MSU-IIT, currently taking up master of science in material science and engineering
Junior Financial Management Major at St. Michails College, Iligan City
Bachelor in elementary education major in English with 30 units of masters degree
Bachelor of Arts in English at Mindanao State University- Iligan Institute of Technology.
Mindanao State University - Iligan Institute of Technology, Bachelor of Secondary Education Major in Technology and Livelihood...
Junior Statistics Major at Mindanao State University, Marawi City, Philippines


text:
|Deviant Art
My name is Luke Woods, i'm from Liverpool, England, and i have been drawing practically all my life. Coupled with this i am also an avid gamer and have been playing Ubisoft's Beyond Good and Evil since 2003. This Deviant Art ID has been solely based and inspired by that game alone, it has also affected and inspired aspects of my life. In my time, I like to draw and I also consider myself a bit of a writer.
I founded the Beyond Good and Evil Wikia, which has grown amazingly over the past few years, but there is not much more left to fill it with, we have covered nearly all bases of the BGE world, and now we all ready for the (hopeful) arrival of the long awaited Beyond Good and Evil 2, and with that, the arrival of new and nostalgiac fans alike.
IRIS Network over and out.


text:
My child was curled up on his bed, giving me that adorable "but I don't wanna go to sleep!" look of his. "Mom..."
I sighed, but gave him a smile. "Yes, love?"
"When we were playing Dragons and Dungeons.... You and Rory were acting like it was a joke."
Well, we were certainly laughing a lot as we played his free-form di-less roleplaying adventure, yes. I mean, our friend Rory was a half-orc half-ogre ninja and I was a human potato mage. As in a mage who specialized in spells involving potatoes and whose main motivation for questing was finding something to cook potatoes in. But... "We were having fun."
"But it wasn't Dragons and Dungeons!"
"Dungeons and Dragons," I corrected.
He narrowed his eyes at me. "The order doesn't matter."
It did, kinda, but I didn't feel like arguing about it. It's not like the game was really D&D anyway. Maybe Dragons and Dungeons was a better descriptor. "I'm sorry if we upset you. We were enjoying ourselves. That's how I play these games, you can ask your dad about it."
"Maybe I should have made a demo level." He nodded to himself in thought.
"That might have helped," I agreed, smoothing down his blankets and starting to tuck him in.
His eyes brightened. "Okay, make a character."
Um... I smiled gently. "Can we do this tomorrow, honey? It's late."
"It'll be fast," he promised. "What do you want to be?"
"An elvish potato mage? I liked being a potato mage."
He sighed. "You're a human wizard. You are in a padded room. There is a gnome attacking you."
A gnome? I was being attacked by a gnome? Okay... "I throw a potato at him."
Eric sighed. "It knocks off his hat. You are struck by lightening. You are dead."
"What?" I asked. "How'd that happen?"
"It just did. You are a human wizard in a padded room. There's a gnome attacking you. What do you do?"
I smiled. "Throw a rutabaga at him!"
The child let out a moan of despair. "I don't even know what a rutabaga is!"
"It's a root vegetable. Like a big turnip."
"You are struck by lightening. You are dead."
I had similar results from throwing a banana, a bunch of grapes, and even my pet dragon. Thought I had a shot at doing damage with the dragon, but no...
I eventually defeated the gnome by casting a freeze spell on him, but then killed myself when the spell that was supposed to break through the wall bounced back at me. Spell-reflective padding. My kid's an evil genius. But he was an evil genius who was already up past his bedtime, so I stopped playing then.
A few days ago, I had a strange idea that I shared with my son. The last two Novembers, he's done National Novel Writing Month with me, producing short pieces of video game fan fiction as I cranked out novel rough drafts. This year, I've been doubting if I want to participate because, frankly, I think I've gotten past the point were it really helps me and it adds a lot of stress to my family life. But it occurred to me that if I were writing something with one of my family members.... Well, my husband may still feel neglected but he won't be able to accuse me of neglecting the kiddo. So, I asked Eric what he thought of the idea of writing a middle grade novel together.
He's excited about the idea, even though I set the rule that we had to do something original rather than fanfic. Me... I'm a little scared to be honest. I've never co-authored before and never written a middle grade novel. But it has the potential to be a great adventure. :)


text:
Manage Reservations
Need to make changes to your reservation? You've come to the right place!
Already an IHG® Rewards Club Member? Sign in to view reservations.
Upgrade to a stylish Executive room or Suite for extra benefits including complimentary wireless Internet and soft drinks. You'll also enjoy access to the exclusive Executive Lounge for complimentary breakfast and evening refreshments.
Complimentary Fitness Center
Hours of Operation: 12:00 AM to 12:00 PM


text:
Reportáž na rádiu o našem ateliéru - "The story of a successful Fine Arts studio"
V pátek byla odvysílána reportáž na rádiu o našem ateliéru - "The story of a successful Fine Arts studio". Pokud máte zájem se procvičit v angličtině, tak s chutí do toho :-)
"It was almost two years ago that then-fresh graduate Nina Mainerová set out with a colleague to open a professional architectural studio. But soon after their launch, the bills piled up and they were forced to modify their plans. First, they began offering preparatory classes for students applying to university; then they extended their workshops to include drawing and painting.
Download: MP3
They were surprised by what they discovered: public interest that exceeded all expectations. Today, co-founder Nina Mainerová runs not one Fine Art Studio but five. And painting and drawing have long supplanted the studio's original architectural focus.
The co-founder explains:
"When we first went ahead with our idea, everyone warned us not to open the studio, saying that we'd soon we'd find ourselves up to our necks in debt. But that only made me dig in my heels even more. We basically launched the project on debt, without any initial investment. And soon, with more and more bills arriving, we realised that we had to offer different services and it went from being a studio of architecture to the fine arts. Luckily, many people were attracted by the idea: at first we had maybe 30 or 40 students a week. Today we have hundreds."
Mainerová stresses that the aim of the studio is to teach anyone interested the necessary skills to paint and draw and the studio offers a wide array of courses catering to clients of all ages: from children to young artists and more experienced professionals. Students' reasons for attending may vary: for some drawing is a hobby or a form of relaxation, while for others it is a chance to improve their skills – a more serious pursuit. In short, there is something for everyone and tailoring courses to individual needs is one of the challenges. Nina Mainerová again:
Nina Mainerová"Obviously our students vary in terms of experience and background. You have mums on maternity leave, lawyers, bankers, professional graphic designers who work with computers and so on. Each group is completely different. For teachers it is interesting to prepare classes and tailor elements to individual expectations and tastes. Students should be able to look forward to classes, working in areas they appreciate."
Chelsea Jennings of Ohio is an attendee at the Fine Art Studio who is looking to expand on courses she took back in the United States: she told me how she had, so far, enjoyed her classes in Prague:
"I came to the school about six weeks ago and so I have only had a few classes so far but I have really enjoyed it. I was recommended the school by a friend who has been coming here for a semester. Because it's early days, I have only done drawing but I am looking forward to trying painting soon."..."


text:
The nation's No. 2 fullback prospect, Portsmouth (Ohio) West's Trevon Pendleton, has picked up two scholarship offers thus far and has at least a half dozen BCS Conference showing interest. He knows his senior season will be important if he is to add to his scholarship totals.
"I have offers, but I want to get as many opportunities as I can and have a wide variety to pick from," Pendleton said. "It really motivates me. I'm a really driven person and I'm not going to stop until I get it."
Air Force and Ball State are the two schools that have already extended an offer to Pendleton. Additionally, Arkansas, Michigan State, Boston College, Bowling Green, Cincinnati, Minnesota and LSU are showing interest. Pendleton has been taking steps throughout the summer to turn that interest into scholarship offers.
Article Continues Below
"My highlight film did not have much blocking on it, so I went back and made just a blocking tape," Pendleton said. "I've been sending that out to a lot of schools that wanted to see that. Other than that, they want to come watch me in person."
Additionally, Pendleton attended college camps at Ohio State, Cincinnati, Michigan State, Toledo, Bowling Green and Arkansas. Following those appearances he feels three of the schools are the most interested and he detailed his recruitment with those programs.
"Arkansas - I went down there and had a really good camp," Pendleton said. "The coach seemed to like me and I've been keeping in a lot of contact with them.
"Michigan State - I had a really great camp up there and ran really well. I've been talking to them quite a lot and later this week I will send my blocking tape out to them because that's what they are waiting to see.
"Cincinnati - I went down there for defense at first, but they have decided to recruit me as a running back. I've been talking to them quite a bit."
Pendleton is not overlooking the two programs that have offered a scholarship - Air Force and Ball State. He plans to see both schools at some point this fall.
"They are both really great schools," Pendleton said. "I haven't gotten a chance to visit them, but I do plan on visiting both schools. I've talked to the coaches on the phone, but to take it further I really need to go visit the schools."
Besides Air Force and Ball State, Pendleton expects to attend games at Arkansas, Michigan State, Wisconsin and Toledo this fall. He has already made plans to attend Toledo's opening game of the season against Arizona.
Pendleton will also be juggling his responsibilities to his team this fall. As a junior he rushed for 1,471 yards and 20 touchdowns on offense and tallied 96 tackles including 25 for loss and eight sacks on defense. He will be reprising both roles this fall for Portsmouth West and he is being looked at on both sides of the football by colleges.
"Most BCS schools are looking at me on offense, but I have been getting a lot of MAC and Conference USA looks at linebacker," Pendleton reported. "There's a lot of talk of running me in bigger back sets, and some are talking fullback."


text:
If you are browsing this section it probably means you are keen to learn more about joining the ABC team. As one of Qatar's top Information Technology Products and Services providers ABC may just be the next career move you are looking for.
When we are on the look out for team members to join us we will post available vacancies here. You are welcome to take a look at any openings we have currently listed and get in touch with us or post your CV in order to let us know your background and experience. Should there be a job opening that suits your profile ABC will get in touch with you to explore the possibilities


text:
My order arrived as hoped for and that`s the bottom line. Quick delivery to Canada also. Thanks MJM and I will return someday.
Read More ->
I feel like a bum because I haven't written about MJM's amazing service yet- and I've ordered a lot from this site. It's the only site I use to...
Read More ->


text:
Children's Videos > Arts & Crafts DVDs > Interactive
To The Rescue DVD by Crazy Crafts - In Stock
Our Price: $8.99 Final Clearance!
Tell a Friend about this product!
Description:TO THE RESCUE allows kids to embark on three grand adventures. First, you join Happy, a small plane who learns that his modest size has advantages. "Diggers" tells a story about a small construction digger who learns the value of his unique gifts. "The Sea Sick Canoe" features a talking canoe suffering from motion sickness, who must overcome his plight.
Show #1: Happy Copter Rescue
Show #2: Diggers
Show #3: The Sea Sick Canoe
More Titles by Crazy Crafts:
Recently Added Products
Home |
About Us |
Customer Service |
Privacy Policy |
Terms |
Shipping |
Testimonials |
Return Policy |
Affiliate Program
Drop Shipping | Special Orders | Fundraising | Schools/Libraries | Resources | Sell To Us | Wholesale | Volunteer Work
Advertising | Toy Brands | eBay Store | Find us on Facebook
KidsCDs.org LLC - 177 Breakneck Road, Suite 86 - Highland Lakes, NJ 07422 USA
Family/Kid Safe Website - ICRA


text:
Since building computers from scratch are cheaper than buying
computers from companies like Dell, Compaq, Etc, buy all the parts of
your new computer at SMI Computer store. My...
All reviews seem positive
From family friendly trips with kid friendly activities to local plumbers lawyers, spas, and contractors. Judy's Book has millions of listings and reviews for the best and not so great. Whether you're looking for a specific business or just trying to discover great places we make it easy. We're a family oriented site focusing on bringing trusted reviews and recommendations to moms and others. Green and Sustainable places are becoming more relevant to Judy's Book users, have a favorite place? Write a review and tell users why it's Green!


text:
Valued up to: $2149.99
$ 1649.98 - $ 1749.98 + Free Shipping!
Buy 2 or more and save!
Save Up to 4% off with Instant Check!
Need more time/lower payments? Apply Now
Assembly Available! Just look for the 'Assembled' option when adding this item to your cart. Learn more.
Get on the trails even faster with our new assembled model! The Mid XRX/R A is assembled by professionals and is 99% complete, reducing assembly time from approximately 2 hours to about 20 minutes! Just add the roll bars, head rests and battery, and you're ready to go! See the support tab for more information about typical setup of an unassembled model. The assembled GoKart is recrated in a sturdy steel frame for shipping.
CARB Approved Available! Just look for the 'CARB Approved' option when adding this item to your cart. Learn more.
This vehicle is also available in a CARB approved model that meets or exceeds guidelines established by the California Air Resources Board and can be sold in the state of California. CARB approved vehicles have modified engines and exhaust systems designed to reduce emissions.
TrailMaster's newest Mid sized XRX go kart now comes with reverse for easier handling on and off the trails! Meet the all new Mid XRX/R! This go kart hits the trails with a powerful 200cc engine, a full front and rear suspension and a tough, all welded steel frame for extra durability. Electric start, rear hydraulic disc brakes, 5-point safety harnesses and an adjustable seat make the XRX/R easy to ride for novice and seasoned drivers alike. Comes in several colors.
Our Standard Service and Support Package is included with every vehicle we sell!
|Shipping Insurance
|Return Period
|60 Days
|60 Days
|Online and Email
|Online and Email
|12 Months
|12 Months
|Non-Normal Wear Parts*
|6 Months
|12 Months
|Normal Wear Parts**
|7 Days
|30 Days
|Parts Shipping †
|Not Included
|Return Shipping †
|Not Included
|50% Paid
|Restocking Fee † †
|Not Included
|Not Included
|$59.98 per vehicle
* Non-Normal Wear Parts are defined as components of the vehicle that are engineered and intended to last the useful
life of the vehicle itself. See a complete definition and partial list of non-Normal Wear Parts in the Service Pack documentation.
** Normal Wear parts are defined as parts that have a limited useful life as a result of deterioration due to natural forces that act upon them under average, everyday use. See a complete definition and partial list of Normal Wear Parts in the Service Pack documentation.
*** Free parts shipping includes standard ground shipping only.
† Shipping costs, where applicable to be paid, are paid only for the period for which the shipped item is warranted. For example, free parts shipping applies only during the period for which the shipped parts are warranted according to the plan chosen.
† † Restocking fees include return handling, restocking and original shipping charges and vary depending on the vehicle being returned.
See complete Service Pack details.
Note: The products shown in these videos may not be identical to the product sold on this page. However, they contain general information that may prove helpful. Viewing them is highly recommended.


text:
I am a dreamer, a planner, a researcher. I collect recipes, cookbooks and ideas for meals fervently. I am always stashing away a little gem of information for just the right time.
I am a bit of a perfectionist. I have trouble creating a plan for tomorrow because I'm so busy trying to figure out how to make today perfect.
Menu planning is something I have trouble with. I am usually satisfied when I get up from the table after a meal, but that satisfaction feels far away when I'm going over the menu in my head... especially when planning something for days away.
I'd like to keep a record of meals here; nothing formal, just a list really. Something I can look back to when I'm trying to remember what tasted good this time last year. We'll start with last night.
A Veg-Focused Burger Dinner
for a (cold but) sunny Wednesday in March
Griddled spicy black bean veggie burgers with smoked havarti
on sesame-seeded toasted egg buns
with shredded red leaf lettuce and sliced salted tomato,
topped with homemade avocado-ranch sauce.
Spiced sweet potato wedges.
Broccoli salad from the grocery deli - our favorite, with raisins, cashews, bacon bits.
Homebrewed Irish Red on draft.
Later, standing in the kitchen, a few spoonfuls from a pint of Mitchell's Edmund Fitzgerald porter chocolate chunk ice cream. One of the greats in NE Ohio.
Procurement/prep notes:
- Veggie burgers from Heinen's frozen section, griddled on cast iron, flipped, coasted to done in the oven.
- Avocado ranch (aka goddess) sauce was the highlight - from the sweet potato recipe in The Sprouted Kitchen cookbook, meant as a dipping sauce for the potatoes.
- Used coconut oil on the sweet potatoes for the first time - smelled delish in the oven. Annoying to melt it first though. Spices on the s.p.f's were really nice - smoked paprika, garlic powder, chipotle, and pulverized rosemary.


text:
The stylish, space saving Cupola collection provides sociable seating that's luxuriously comfortable, supportive and fantastic value for money. The soft fabric upholstery is easy to care for and also durable, ideal for modern family life. Cupola belongs at the heart of your home, whether you're reclining on a lazy Sunday or gathering family and friends together.
The browser you are using does not support our magic.
To continue browsing Furniture Village, please install the latest version of any of the browsers listed below.