text:
Talk:Clique problem - Wikipedia
Talk:Clique problem
Clique problem has been listed as a Engineering and technology good article under the good article criteria. If you can improve it further, please do, and if it no longer meets these criteria, it can be reassessed.
Review: January 13, 2017.
A fact from Clique problem appeared on Wikipedia's Main Page in the Did you know? column on 21 December 2009 (check views). The text of the entry was as follows: "Did you know
... that the clique problem of programming a computer to find complete subgraphs in an undirected graph was first studied as a way to find groups of people who all know each other in social networks?"
I thought a clique was a fully connected sub-graph? The way it is described here makes me think a clique is two adjacent vertices... --Bryanlharris 19:21, May 7, 2004 (UTC)
Pairwise adjacent means every pair of vertices in the set are adjacent. This is equivalent to your definition. Deco 19:38, 26 Mar 2005 (UTC)
2 Removed proof
3 Algorithm feedback
5 Problem with maximal clique heuristic
7 Some details
8 Accessible head
10 Maximal cliques
10.1 Example implementation
11 Decision tree, help with SVG
12 GA-class
13 Structure and scope
14 What does "m" stand for exactly here? number of edges or vertices?
15 Cliques of fixed size algorithm
16 Tsukiyama algorithm stated incorrectly
I propose we move this to maximum clique problem, which is a commonly used name that is more accurate and specific. I put a redirect in the way, but I'll take care of the move if there's consent. Deco 23:58, 27 May 2005 (UTC)
Seems like a reasonable idea. MathMartin 09:05, 28 May 2005 (UTC)
Removed proof[edit]
I removed the proof that maximum clique is NP-complete and replaced it by an appeal to the NP-completeness of independent set. It was a good proof, but I think it's easier to go through independent set, because there's a lot less edges to talk about filling in. Admittedly the proof on independent set problem isn't all that nice, and any improvement to it would be great. Deco 01:49, 8 Jun 2005 (UTC)
Rewrote independent set problem now. Should be somewhat better. Deco 04:47, 8 Jun 2005 (UTC)
Algorithm feedback[edit]
I suggest a algorithm here. http://insaint03.cafe24.com/clique-en.html I can't be sure it's correct, I need some comment. --insaint 18:36, 26 May 2007 (UTC)
The problem is proven NP-complete, your algorithm runs in O(n^3) - either you deserve $1million prize or the algorithm is wrong. You might try on one of the larger examples given in the link at the bottom of the article and see whether you find the known answer.
Can anyone find a source for the 3-clique algorithm mentioned in version 111018197? Some special cases may be solved in less than exponential time. For k = 3, there exists an O(n1.41) algorithm where n is the number of edges. -- Rampion (talk) 15:27, 16 February 2008 (UTC)
I'm going to go ahead and remove it for now. If anyone wants to restore it, please note the reference. -- Rampion (talk) 15:00, 19 February 2008 (UTC)
Problem with maximal clique heuristic[edit]
This section seems to state that arbitrarily merging cliques will always find a maximal (as opposed to maximum) clique. This is not true. Consider 2 disjoint cliques A and B produced by merging. Assume that there is some edge missing between A and B so that they cannot be merged, but that there are vertices u in A and v in B such that u is adjacent to every vertex in B and v is adjacent to every vertex in A. Then A is contained in A union v and B is contained in B union u, so neither are maximal, but no further merging can be done. Merging in some intelligent order may work, but the algorithm as stated does not necessarily find any maximal cliques. Bjoeris (talk) 16:07, 17 April 2008 (UTC)
It seems wrong indeed. I've removed the passage. --Mellum (talk) 12:11, 12 May 2008 (UTC)
Maybe this is a good time to think about what this article should be called?
Currently, there are at least two problems I know that qualify as Clique problem. One is Algorithms for finding a clique or Computing a clique or Algorithmic aspects of finding a large complete subgraph or its complement. The other is the Party problem or the Ramsey number problem. Both terminologies can be found in the literature, but the algorithmic interpretation of course wins a google fight, though Mathworld uses the Ramsey interpretation.
Currently, Party problem redirects to Clique problem, and that’s something we clearly need to rectify. One solution is to let the current algorithm (under the current headline) describe both interpretations, but I can’t see how that would work. An easy alternative is to just fix the redirect. That being said, I am mildly in favour to a more descriptive, and exclusive, article title. Algorithms for clique or Finding a clique sound good (but not quite perfect) to me. Thore Husfeldt (talk) 13:27, 18 December 2009 (UTC)
I'm not opposed to changing the name. The imperfection in those titles, to me, is that they omit the complexity theoretic side of research on the clique problem, since that's less about finding a clique and more about not finding a clique. One possibility, though it doesn't excite me very much, would be Clique (computer science). One issue is whether we should choose a name such as the one we have now that refers only to cliques, or whether the name should also include independent sets (in which case, there's more material that needs to be added to the article, as the clique and independent set problems are quite different in most graph families and I omitted anything that was only about independent sets in my rewrite). —David Eppstein (talk) 17:15, 18 December 2009 (UTC)
Indeed, approximation algorithms in bounded-degree graphs are a fairly natural example... And let's not forget other models of computation. From the perspective of distributed computing, independent sets and cliques are very different things. On the one hand, finding a maximal independent set is a truly central and classical problem in the field (and also closely related to Graph coloring#Parallel and distributed algorithms). There are many seminal positive and negative results, and numerous reductions to and from maximal (or near-maximum) independent sets. To someone studying distributed computing, independent set problems are as central as, say, SAT and linear programming together to someone studying polynomial-time computation. On the other hand, I can't say much about clique-finding algorithms from the perspective of distributed computing – it isn't even obvious how one should formulate a "clique problem" so that it'd be interesting and relevant from the perspective of distributed computing. Hence if we try to cover all computational aspects of cliques and independent sets in one article, at least from this perspective it'd be strange if the article was called "Clique problem". — Miym (talk) 19:41, 18 December 2009 (UTC)
I think expanding the scope of the article is probably not what we need to do right now. Also, based on the large recent expansion, it looks like we're set to get a link to this article from the front page via "Did you know?" some time in the next week or so, so if we do make a decision on a better name we should probably hold off on changing it until later. —David Eppstein (talk) 08:15, 19 December 2009 (UTC)
I think a reasonable approach would be to merge Independent set problem into Independent set (graph theory), explain the computational aspects that are specific to independent sets in Independent set (graph theory) (or Maximal independent set), and refer to Clique problem for everything else. That way no changes are needed here. — Miym (talk) 11:30, 19 December 2009 (UTC)
I think the last suggestion is reasonable. Let this article be only about cliques (and things that are common to clique and independent set). Things that only apply to independent sets, can go in Independent set (graph theory) or Maximal independent set. The Independent set articles can link to this article for common algorithms. That way we can still call this article "clique problem", and let it be a comprehensive article which has everything there is to know about cliques (from an algorithms and complexity point of view). --Robin (talk) 21:08, 30 December 2009 (UTC)
Figure caption: "Adapted from Sipser." It'd be nice to have a proper citation; we don't have Sipser in the list of references. I guess it refers to the textbook "Introduction to the Theory of Computation", but I don't have it here now.
"Parameterized complexity[33] is the complexity-theoretic study of problems such as finding k-cliques in graphs that are naturally equipped with a small integer parameter k, and for which the problem becomes more difficult as k increases": I guess this should be parsed "... study of problems ... that are naturally equipped with ...", but it's easy to read it "... in graphs that are naturally equipped with ..." Is it just me or should we rephrase this somehow?
"due to the fact that the clique number takes on integer values and is NP-hard to compute, it cannot have a fully polynomial-time approximation scheme": Strictly speaking, shouldn't it be "small integer values" instead of "integer values"?
— Miym (talk) 19:24, 19 December 2009 (UTC)
I handled your second and third points. I'll let Thore address the first since he drew the figure and knows better than I where it came from. —David Eppstein (talk) 20:32, 19 December 2009 (UTC)
Accessible head[edit]
The topic of this article lives on the borderline of what might want to be accessed by a general audience, so I suggest we at least try to give a non-technical introduction in the article head. Here’s just an idea, to get the ball rolling.
The brute force algorithm finds a 4-clique in this 7-vertex graph (the complement of the 7-vertex Path graph) by systematically checking allC(7,4)=35 4-vertex subgraphs for completeness.
In computer science, the clique problem is to find a complete subgraph in a graph, i.e., a set of elements that are pairwise connected. An example is a social network, where the graph’s vertices represent individuals, and the graph’s edges represent mutual acquaintance. To find a largest subset of individuals, all of which know each other, one can systematically inspect all subsets, a process that is too time-consuming to be practical for instances with more than a few dozen individuals. Despite many attempts to find better algorithms for this problem, no significantly better approach is known, and much of the theory about the clique problem is devoted to establish its computational hardness in many models of computation.
What I aim to convey is what the problem is about, what it models, how an algorithm could look, and what kind of phenomenon the theory tries to address. I think the brute-force illustration is pretty informative; it should be clear both what we’re looking for, what the algorithm is doing, and that it would take a long time. An attractive alternative would be instead to illustrate the behaviour of a poly-time algorithm on a restricted graph class; the message here would then have to be that in general, we can’t get this approach to work. Thore Husfeldt (talk) 17:45, 20 December 2009 (UTC)
Your proposed new lede looks good to me. I agree that the existing one is too technical. —David Eppstein (talk) 17:49, 20 December 2009 (UTC)
Name Clique, k-Clique
Input Graph G with n vertices. Integer k.
Output Does G contain a complete subgraph with k vertices?
Running time O(n.792k)
Complexity NP-complete, W[1]-complete
Garey–Johnson GT19
Name Clique number, Maximum Clique
Output \alpha(G)
Approximability O(n log-3 n log log2n)
Inapproximability n1-\epsilon unless P = NP
Input Graph G with n vertices
Output The number of inclusion-maximal cliques in G
Running time O(3n/3)
I made an infobox for Graph coloring once, and maybe we want one here as well. In truth, I still don’t know if this kind of thing is a good idea. It’s certainly a quick way to get some information about the problem (for example, I’ve always found the compendia like Garey–Johnsson or Crescenzi et al. actually useful), but there are lots of problems about what information should go into such a box in the first place. Maybe its just spam or chemistry envy. Thore Husfeldt (talk) 19:22, 20 December 2009 (UTC)
I'm not a huge fan of infoboxes, because it is difficult to convey any nuance in them. For instance, under "decision problem" "running time", you have O(n^k k^2), the running time of the most naive brute force algorithm for the problem. But it doesn't say "running time for the most naive brute force algorithm", it just says "running time". There are algorithms with better worst case running times known (though still with an exponent that's linear in k). And for some algorithms, what we list as the running time isn't necessarily the actual running time of the algorithm even when considered on worst case inputs: it's the best upper bound that we know how to prove, a quite different thing. —David Eppstein (talk) 19:30, 20 December 2009 (UTC)
I think the infobox serves to present the abstracted common properties of problems (like approximability) in a structured way. The most important information here can be fairly condense ("approximation factor: 2" versus several sections of text on the Vertex Cover page that would be vague for someone who just wants the constant). Whoever wants to know more can read the full wikipedia article, go for the technical paper abstracts, or the papers themselves; whichever level of detail they wish to work on. I personally find the highly-condensed resources that Thore listed to be useful and I lament that Wikipedia does not serve that purpose, especially since the general repositories that exist are rarely, if ever, updated and should exist in wiki format.
What David Eppstein explained is precisely how I would interpret the "running time" field -- the best known (proven) upper bound on running time that someone has taken the time to add to Wikipedia, with an somewhat arbitrarily chosen level of detail (e.g. big-oh). I see no problem with the field as it is and, if necessary, a general template explanation or a simple foonote could be given. I see more issues with packing in too much information (e.g. parametrization) or vagueness (e.g. deterministic versus expected or heuristic running time). An example of these issues: [User:C._lorenz/sandbox]. Although I find an arbitrary policy for these problems sufficient for making infoboxes an asset.
Some fields that I am uncertain about are "Input&output" (could be lengthy and perhaps better given in text), "W[1]-complete" in "Complexity" seems like too much detail (we could add a lot more), and "Garey-Johnsson" - is this really useful? —C. lorenz (talk) 16:15, 21 December 2009 (UTC)
I agree on the Garey–Johnsson. It’s there because the original motivation to cook up an infobox in the first place is that I’d like Wikipedia’s entries to be at least as useful and informative as, say, the Maximum Clique entry in the Viggopendium, so I started from that framework, minus the comments. I admit that the Garey–Johnsson number is the clearest example of my chemistry envy. Thore Husfeldt (talk) 16:29, 21 December 2009 (UTC)
I think the infobox can be put in, it does present a lot of useful info in short. I like infoboxes that present the hardness of approximation result along with the best known approximation algorithm so one can compare them. W[1]-completeness might be more detail than needed in an infobox though. --Robin (talk) 05:23, 26 December 2009 (UTC)
^ Nesetril & Poljak (1985)
Maximal cliques[edit]
Since there is so much information about listing all maximal cliques, the article should say somewhere that finding a single maximal clique is really easy (linear time). I don't know where to put this information though. --Robin (talk) 14:47, 21 December 2009 (UTC)
I agree. I guess Maximal cliques could form a section, consisting of the (easy) algorithm for finding one, and the listing/enumeration results. Thore Husfeldt (talk) 13:54, 23 December 2009 (UTC)
I have a more in depth description of the Tsukiyama et al. algorithm along with a C++ implementation. Since I put quite an effort into understanding the tiny details of the algorithm, I'd add it to references so others don't have to. Can some one please advise me if that would be appropriate? (I'm not a regular Wikipedia contributor, so I'm not sure about the rules yet.) Here is the link: http://c0de-x.com/how-to-find-maximal-cliques/ — Preceding unsigned comment added by Devillmeister (talk • contribs) 08:34, 1 June 2013 (UTC)
Question: Perhaps there should be more explanation on why the algorithim for finding a single maximum clique runs in linear time? I cannot immediately see why. Whether you store a graph as an adjacency matrix or an adjacency list the cost of constructing the sub-graph on K vertices is O(K^2) so one cannot just look at sub-graphs. The obvious implementation of the algorithim requires finding the interesection of two sets of integers. If the sets are stored as lists this is O(n+k) and even if they are stored as hash tables its O(min(n,k)) where n,k are the sizes of the sets.
Can someone explain more details of this algorithim and hy its running time is O(n) for non-sparse graphs? (I can see why it is O(n) for sparse graphs). Alternsatively maybe the author means linear in the size of the graph (so vertices ^ 2) in which case I can see the result. — Preceding unsigned comment added by Princess stargirl (talk • contribs) 03:50, 26 October 2014 (UTC)
Decision tree, help with SVG[edit]
I played around with drawing a decision tree, mainly because I think it’s a very accessible model of computation and makes a pretty picture. (Possibly too large.) Something is messed up in the SVG rendering (the file look alright when I let Safari’s SVG engine render it.) Any pointers to what I can do? Thore Husfeldt (talk) 14:03, 23 December 2009 (UTC)
A decision tree of depth 6 for detecting a 3-clique in a 4-vertex graph. No better constructions are possible, in the sense that it matches the lower bound of n(n-1)/2.
What's different between what it looks like here and what it's supposed to look like? —David Eppstein (talk) 17:37, 23 December 2009 (UTC)
If you look closely, I think the arrows don't look right. But when I render it in Firefox, it looks great. I think this is what Thore Husfeldt is referring to. See this blown up png for instance: [1] --Robin (talk) 17:41, 23 December 2009 (UTC)
Since this article is in pretty good shape right now, has pictures, very detailed references, and at least a few editors actively editing it in the last few days, is anyone up for improving this article further and nominating it for GA-class? (Maybe it is more useful to bring 2 articles up to B-class, than one up to GA-class, so perhaps that isn't such a great idea.) --Robin (talk) 19:59, 27 December 2009 (UTC)
I’d be eager to hear David’s opinion on this, he’s got a few GAs under his belt. But in principle I think the article deserves a much higher rating and in many respects proudly stands as an example of what this medium can accomplish.
However, stability is an issue for GA-ing, and I would like to propose at least two larger changes to this article. So ’d like to wait. To tip my hand: 1. I’d like this article to be about Algorithms for clique and independent set (though not necessarily under that title) and 2. I’d like the structure to abandon the current Algorithm—Lower bounds dichotomy (reasons include (a) the lower bounds are mostly hardness results, not lower bounds, (b) some of the issues don’t really benefit from splitting along this fault line, such as circuit complexity, decision trees, the yet-to-be-written section on counting, etc.).
These proposals are connected—for example, I’d want a section each on Clique algorithms for special graph classes and Independent set algorithms for special graph classes, rather than the current awkward things like “finding cliques in the complement of bipartite graphs”—but need somewhat more time than I can devote to them in the next few days, so we’ll have to wait. Thore Husfeldt (talk) 20:19, 27 December 2009 (UTC)
I agree about the lower bound vs algorithms dichotomy. I don't like this split either. For example, instead of splitting the best algorithm and best bounds known for the decision problem, I would prefer a section on the decision problem which gives the best algorithms and gives the NP-completeness proof. Similarly, a section on the approximation problem, which states the best factor achievable and the best hardness result. Some topics are already covered like this, like decision tree complexity and circuit complexity.
I also agree about what the article should be about, but the article title should probably not be Algorithms for clique and independent set. I can't think of a good name off the top of my head.
About the other sections you want to add, that's great. I'm in no hurry at all, and of course we don't have a WP:DEADLINE. I just mentioned this GA-class idea to get everyone's opinions on it. --Robin (talk) 20:40, 27 December 2009 (UTC)
So in this proposed revision, would you have a separate article for hardness results? Or would you include all the current material as well as the algorithmic parts of Independent set (graph theory) and maximal independent set? I think separating out algorithms from hardness makes sense as a way of organizing the material (more sense than splitting cliques from independent sets) but that split could be into separate articles rather than as now separate sections of the same article, and the article we have now is already large and unwieldy. As for calling it "hardness" rather than "lower bounds", I have no objection to that. I do think the hardness bounds are important, though (at least the inapproximability and FPT ones) and wouldn't want to see them tacked on as a disconnected appendix to an article that's mostly about algorithms. As for GA: I think we have enough material here, written at a high enough level of quality, that we should seriously consider this, but a GA review is mostly going to cover low-level issues of grammar and wording; we need to find the best organization for the material ourselves first. —David Eppstein (talk) 20:51, 27 December 2009 (UTC)
I would have hoped to have had more time for a more though-out proposal, but the sections I envision are
Algorithms (exact algorithms for fixed size and maximum cliques) these are agnostic about whether we look for cliques or independent sets
Special graph classes algorithms for cliques, algorithms for indpendent sets. This could also be a subsection of Algorithms
Hardness (NPC, W[1])
Approximation (current 3.3 and 3.6)
Enumeration (listing maximal cliques, #cliques is #P-complete, but FPRASable for some special cases)
Other models of computation (decision trees, circuits)
(never mind the ordering and the titles) So basically it’s about moving some of the current subsections out of the current two-section Upper/Lower bound structure. Thore Husfeldt (talk) 21:28, 27 December 2009 (UTC)
First, making Other models of computation a separate section is a nice idea. That makes it clear that the rest of the article is about algorithms on real computers (or Turing machines). As far as the other secions go, I think there are 3 different clique problems, the decision problem, the optimization problem and the enumeration/counting problem. Each seems to have its own set of algorithms, and hardness results. In that order, the hardness results would be NP-completeness, inapproximability results, and #P-completeness. We do have a lot more to say about the decision problem, since it is well-studied, and is well-studied in several restricted settings: fixed parameter tractability, special graph classes, etc. So I would propose a structure which first deals with the decision problem, including all algorithms for fixed size, max clique, special graph classes, FPTs, etc. and includes all relevant hardness results about the decision problem. This section might be the largest of all. Then a section on the approximation problem, then a section on the counting problem, and then other models.
In short, all I'm saying is that Algorithms + Special graph classes + Hardness, in the suggestion above should be merged into one section with the theme of "decision problem" and hardness results should be presented along with the best algorithms. For instance, after stating that the best algorithm for maximum clique is like O(1.2^n), we give the NP-completeness proof, which explains why the best known algorithm is exponential time. The other sections are fine. But if this proposal will make one section very large compared to the others, or if this view of combining hardness+algorithms isn't shared by others, I'm fine with Thore's proposal above. --Robin (talk) 21:52, 27 December 2009 (UTC)
Re "I think there are 3 different clique problems": There are many more than three algorithmic versions of the problem about which one can find published papers: (1) yes/no, is there a clique of a given size, (2) list all cliques of a given (typically constant) size, (3) find a single maximal clique (not very interesting on a sequential computer but has been studied in parallel algorithms), (4) list all maximal cliques, (5) find a maximum clique, (6) find a minimum-sized maximal clique (more often studied in the complementary form of finding a minimum independent dominating set), (7) count the cliques of a given size (e.g. my WADS'09 paper with Spiro on counting triangles), (8) list all maximal cliques (or maximal independent sets) whose size is smaller than some bound (e.g. my older paper "Small maximal independent sets and faster exact graph coloring"). In addition I could imagine that there might be algorithms for counting maximal cliques or maximum cliques more quickly than listing them all — listing and counting are in general two different things — but I don't know of any published research on that variant. —David Eppstein (talk) 01:27, 28 December 2009 (UTC)
Fair enough, we can have more sections for the problems. I guess my main point is that for a given problem, I would prefer an organization where the best algorithm and hardness result are stated together, rather than in different parts of the article. Organizing results by the problem solved, i.e. listing max cliques or decision version of max ind. set on planar graphs, (rather than the nature of the result — algorithmic or hardness) seems more natural to me. --Robin (talk) 02:28, 28 December 2009 (UTC)
Where would we cover the distributed computing [and parallel computing] aspects: distributed algorithms for finding independent sets, lower bound results for these problems, the connection to distributed graph colouring, other applications of distributed independent set algorithms, etc.? Some possibilities might be:
A subsection on distributed algorithms in the "Other models of computation" section. (Might be a fairly long subsection.)
Together with the centralised algorithms and hardness results when we discuss the relevant problems. (I think the most relevant problems are "find a maximal independent set" and "find a large [near-maximum] independent set", both in general graphs and in special graph classes. I'm worried that covering distributed computing aspects in different places might make the text more difficult to follow.)
Somewhere else, e.g. Independent set (graph theory) + Maximal independent set?
— Miym (talk) 19:39, 30 December 2009 (UTC)
Since I supported the proposal to have only clique-related problems in this article, I would choose option 3. There is a lot of literature on maximal independent sets (and its connection with vertex coloring), which would make a fine addition to an independent set article. Adding it here would make this article too long. Also, the distributed algorithms are really specific to finding an independent set (and not clique), so I think it's fair to put all those results in a different article. --Robin (talk) 02:07, 1 January 2010 (UTC)
Since this discussion stopped (more than a month ago) before reaching a conclusion that we all agree with, I thought I should start the discussion again. So the question is, what is the scope of this article, and how should we structure it?
My viewpoint, in short, is the following: This article should only contain results related to cliques -- maximal cliques, counting cliques, listing cliques, decision trees, monotone circuit complexity of max clique, etc. Results that work for clique and ind. set. should be present in this article. Results that only work for ind. set., like ind. set. on planar graphs, or the distributed computing version should be elsewhere. As for structure, I would suggest a problem-oriented structure, where we list a problem, like "list all maximal cliques" and then present algorithms and hardness results. --Robin (talk) 20:57, 15 February 2010 (UTC)
What does "m" stand for exactly here? number of edges or vertices?[edit]
In the section "Cliques of fixed size" it says:
"In a graph with m vertices..." and in the same paragraph "...the time for this algorithm is proportional to the arboricity of the graph (a(G)) times the number of edges, which is O(m a(G))".
Please, what does "m" now stand for exactly in this context? The number of edges of vertices? It is crucial to make this clear, as in a later paragraph it says "...to find triangles in time O(n2.376), which may be faster than O(m3/2) for sufficiently dense graphs.". It makes quite a difference if one assumes the number of edges to be m or to be n in this scenario.
Thank you. —Preceding unsigned comment added by 93.211.185.46 (talk) 13:15, 17 May 2010 (UTC)
It's the number of edges. I've fixed that now. --Robin (talk) 14:02, 17 May 2010 (UTC)
Cliques of fixed size algorithm[edit]
It says, "there are O(nk) subgraphs..."
I think it's a combination (select k vertices from n), that's: ( n k ) {\displaystyle {\binom {n}{k}}} , that means O(n) (the worst case if k = 1 is n)
--Vojta.jina (talk) 23:16, 21 November 2010 (UTC)
Why should you assume k = 1?? It's certainly not O(n) when k > 1. —David Eppstein (talk) 23:37, 21 November 2010 (UTC)
You are right, my assumption was wrong: k=1 is definitely not the worst case (that's around k = n/2). I guess, I should remove this paragraph. Thanks for pointing this out... --Vojta.jina (talk) 14:42, 28 November 2010 (UTC)
Hi. Whatever the worst case exactly is, "n choose k" is equal to n!/(k!*(n-k)!) and hence much worse than O(n) even if k=1. Even worse than O(n^k), which is mentioned in the article, so I don't see why it says that there. Can someone explain that or change the paragraph? —Preceding unsigned comment added by 129.215.5.255 (talk) 00:41, 10 March 2011 (UTC)
( n k ) = 1 k ! n ⋅ ( n − 1 ) ⋅ ( n − 2 ) … ( n − k + 1 ) ≤ 1 k ! n ⋅ n ⋅ n ⋅ n … n = n k k ! ≤ n k . {\displaystyle {\binom {n}{k}}={\frac {1}{k!}}n\cdot (n-1)\cdot (n-2)\dots (n-k+1)\leq {\frac {1}{k!}}n\cdot n\cdot n\cdot n\dots n={\frac {n^{k}}{k!}}\leq n^{k}.} It's a crude estimate but it's always valid and when k is a constant then it's within a constant factor of the truth. —David Eppstein (talk) 01:13, 10 March 2011 (UTC)
Tsukiyama algorithm stated incorrectly[edit]
The article says that, given the maximal cliques in G\v, the maximal cliques in G are these plus those sets formed from them by adding v and removing nodes not connected to v. Let G={12,13,23,24,34,35,45}. Then the maximal cliques in G\{5} are {123} and {234}. If I add 5 to {123} and remove the nodes not connected to 5 then I get {35}, but this is not maximal in G since it's contained in {345}. I'm guessing that what the article should say is that the cliques of G are the cliques of G\v plus sets formed by adding v to the cliques of G(v), where G(v) is the set of nodes connected to v. --RDBury (talk) 17:24, 19 September 2013 (UTC)
I think I've figured this out. The words "a maximal clique C" in "... each maximal clique in G that does contain v can be formed from a maximal clique C in G \ v by adding v and removing the non-neighbors of v from C," should read "some maximal clique C", not "any maximal clique C" as I was interpreting it. So the lexicographic ordering not only prevents duplicates from appearing, as it states in the next paragraph, but also prevents non-maximal cliques from appearing, since lexicographic maximum implies maximal. I'll try to rephrase this section when a get a firmer grasp on how the algorithm actually works. --RDBury (talk) 21:17, 25 November 2013 (UTC)
Promoted to GA
This review is transcluded from Talk:Clique problem/GA1. The edit link for this section can be used to add comments to the review.
Reviewer: Spinningspark (talk · contribs) 21:38, 26 December 2016 (UTC)
Looking... SpinningSpark 21:38, 26 December 2016 (UTC)
You might consider wikilinking adjacent (graph theory). I know that only goes to the glossary, but that could be a good thing for a reader unfamiliar with the subject. It points them early on to a central place where they can get a quick def of unfamiliar terms.
Added. —David Eppstein (talk) 02:52, 2 January 2017 (UTC)
"worst-case optimal time" (or even "optimal time") is not a phrase found in the article body, nor is it explained or wikilinked.
This is a summarized version of the sourced claim in the first paragraph of subsection "Listing all maximal cliques" that "this provides a worst-case-optimal solution to the problem of listing all maximal cliques". Just before that claim, I added a new clarification "matching the number of cliques that might need to be listed" for why this is optimal. —David Eppstein (talk) 02:52, 2 January 2017 (UTC)
There needs to be a link to big-O notation on first use. Likewise big-theta, big-omega, little-o etc.
The brackets following the big-O etc butts right up. They need a space, or a thin space ( )
I added explanations for the first use of each notation. It turns out that   is far too wide but that {{italics correction}} does the job. Here is a comparison:
O(n) — {{math|''O''(''n'')}}
O(n) — {{math|{{italics correction|''O''}}(''n'')}}
O (n) — {{math|''O'' (''n'')}}
O ( n ) {\displaystyle O(n)} — <math>O(n)</math>
O ( n ) {\displaystyle O\,(n)} — <math>O\,(n)</math> (the LaTeX equivalent of  )
—David Eppstein (talk) 04:38, 2 January 2017 (UTC)
"...reported at the time in major newspapers" is cited to the NYT, but that paper does not say it was reported in other papers. We need either a source saying it directly, cites to several different papers carrying the story, or just say it was reported in NYT.
Changed to just say the NYT. —David Eppstein (talk) 07:59, 3 January 2017 (UTC)
"The clique decision problem is not of practical importance; it is formulated in this way in order to ..." Is this just a reformulation of the k-clique problem?
The problems are different because they have different outputs (a clique vs a boolean). The sentence above the bullets does say that they are closely related. —David Eppstein (talk) 07:59, 3 January 2017 (UTC)
"the one found by the greedy algorithm described above". This is the first mention of greedy algorithm, so it is unclear what this is referring to.
It was referring to "the algorithm described above" (in the same paragraph), and describing it as a greedy algorithm. But I moved the greedy link earlier in the paragraph in hope of making this clearer. —David Eppstein (talk) 01:21, 8 January 2017 (UTC)
"When k is part of the input to the problem, however, the time is exponential." In what sense was k not part of the input in the prior cases?
It was not part of the input in the immediately preceding sentence, which says "whenever k is a fixed constant". Fixed constant means that it is hardcoded into the algorithm rather than being part of the input. I'm at a bit of a loss on how this could be phrased any more clearly; do you have suggestions? —David Eppstein (talk) 01:21, 8 January 2017 (UTC)
Understood. Any of "when k is not fixed...", "when k is variable...", "when k is not a constant..." would have made it clear to me on first reading. I'm not sure how important it is to say "part of the input", but both could be said if necessary "when k is not fixed and forms part of the input..."
Ok, copyedited per your suggestions. —David Eppstein (talk) 23:49, 9 January 2017 (UTC)
"...although the reverse of this order is NP-hard to generate". Interesting, but why is that relevant here?
Because it means that the ordering makes a big difference in whether it's possible to list the cliques efficiently. Edited to clarify what NP-hard means in this case (no polynomial-delay algorithm exists unless P = NP). —David Eppstein (talk) 01:21, 8 January 2017 (UTC)
The sentence beginning "In particular, the planar graphs, and more generally..." is very hard to parse. I had to read it several times before understanding. Can the statements be broken into separate sentences?
Done. —David Eppstein (talk) 01:21, 8 January 2017 (UTC)
Finding maximum cliques in arbitrary graphs
The mention of adiabatic quantum computing concerns me on two counts. Firstly, as far as I am aware, this is still largely speculative, but you wouldn't know that from what is written (or by following the wikilink for that matter). Secondly the ref is a preprint; has this actually been published? I'm not saying don't use preprints as refs, but making solid claims about speculative subjects on the basis of them is a bit iffy. Maybe it could be reworded with "<author> has suggested that..." or some such.
Huh? The adiabatic reference, by Childs Farhi Goldstone and Gutmann, is a journal paper, and always has been listed as such. It had a link to the preprint version for convenience since most readers aren't going to be able to access the official journal version very easily. But I added the link for those who can. (Also, with a notable co-author, it might well pass the "recognized expert" clause of WP:SPS, but as a journal paper I don't think we need to worry about that.) —David Eppstein (talk) 23:49, 9 January 2017 (UTC)
Ok on the source then, but it still remains the case that this is a speculative proposal, no? Nobody has actually found cliques using quantum computers have they? Does a quantum computer capable of doing it actually exist? That's what troubles me about it; it just appears in a list of methods as if it is a real thing. I think some kind of caveat would be in order. SpinningSpark 00:28, 10 January 2017 (UTC)
Added "that have been suggested". —David Eppstein (talk) 07:55, 10 January 2017 (UTC)
Wikilink chromatic number
Done. —David Eppstein (talk) 23:50, 9 January 2017 (UTC)
"Although the approximation ratio of this algorithm is weak, it is the best known to date" Is this sourced to Feige? If not, where?
Feige wouldn't really be a good source for this sort of evaluation of his own work. But I found and added a recent (2015) publication that says the same thing. —David Eppstein (talk) 06:10, 12 January 2017 (UTC)
"Karp's NP-completeness proof is a many-one reduction from the Boolean satisfiability problem for formulas in conjunctive normal form, which was proved NP-complete in the Cook–Levin theorem." Ugh! Too much jargon in one sentence. Although the sentence is understandable after following all the links, it is very difficult for a general reader. This might be another case where the same material would be ok if split into more than one sentence.
Split into three sentences. —David Eppstein (talk) 06:17, 12 January 2017 (UTC)
"CNF" If the article is to use abbreviations, it should give them in brackets after the first use of the term in full.
Done. My usual tendency is just to spell them all out instead of using abbreviations, but I felt that three repetitions of this long phrase in a single paragraph would have been too much. —David Eppstein (talk) 07:57, 10 January 2017 (UTC)
"Supergraph" needs a link or a gloss
Done: supergraph. —David Eppstein (talk) 07:59, 10 January 2017 (UTC)
"for every ε > 0" I'm not seeing a definition of ε.
Changed to "for every real number ε > 0". —David Eppstein (talk) 08:01, 10 January 2017 (UTC)
"However, an invalid proof may sometimes mistakenly be accepted, as long as the probability that a checker makes a mistake of this type is low." The logic of that statement escapes me. If the probability is high then an invalid proof may still be accepted. So surely this just says an invalid proof may sometimes be accepted without qualification? SpinningSpark 16:23, 29 December 2016 (UTC)
I don't understand your confusion here, to be honest. What part of the fact that the checker behaves randomly, that it is required that this random behavior should cause it to have low probability of making certain kinds of mistakes, and that other kinds of mistakes are strictly forbidden, is unclear? Why should the fact that a mistake can sometimes happen allow use to forget about the probability of it happening and just say that mistakes can happen without qualification? What needs to be changed here to make this less confusing? —David Eppstein (talk) 08:06, 12 January 2017 (UTC)
My problem is that I don't think the sentence is quite saying that semantically. If I have understood your reply correctly, the meaning is supposed to be that it can be acceptable for the algorithm to return some false positives provided the probability of doing so is low. What the sentence actually says (apparently) is that false positives only occur when there is a low probability that a checker makes such a mistake. Clearly that interpretation is illogical and not correct, but it hides the correct meaning. This leads me on to the meaning of the following sentence: "An instance of the satisfiability problem should have a valid proof if and only if it is satisfiable." How does that square with the possibility of false positives? SpinningSpark 14:58, 12 January 2017 (UTC)
Ah, I see. I hadn't noticed that ambiguity. Reworded, splitting into two sentences. —David Eppstein (talk) 04:18, 13 January 2017 (UTC)
Thanks for the thorough listing of issues! I plan to work on these over the next week or so, responding to them individually; I'll ping you again when I think I've done. —David Eppstein (talk) 20:04, 29 December 2016 (UTC)
The external links tool is showing a number of deadlinks (three 404 errors page not found, one server not found, and one 301 error redirecting problem.) While deadlinks are not a cause to fail a GA, that's quite a lot and you might want to do something about them. SpinningSpark 15:12, 12 January 2017 (UTC)
@Spinningspark: Done. Is that everything? —David Eppstein (talk) 04:18, 13 January 2017 (UTC)
Yes, that's done, promoting to GA. A pleasure doing business with you. SpinningSpark 14:04, 13 January 2017 (UTC)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Clique_problem&oldid=766999814"
GA-Class Computer science articles
This page was last edited on 23 February 2017, at 10:57.

value: This website is the English-language edition of the free online encyclopedia Wikipedia. It was founded on 15 January 2001 as Wikipedia's first edition and, as of October 2021, has the most articles of any edition, at 6,412,521.


text:
John Lundstrom Obituary - Ankeny, IA | the Des Moines Register
118 N.W. Linden St
More Obituaries for John Lundstrom
John "Swede" Lundstrom
Ankeny - John "Swede" Eric Lundstrom was born April 8, 1929 in Aurora, Illinois, the son of
Katherine Lundstrom Jacobsen. He passed away June 11, 2018 at the age of 89, due to congestive heart failure.
A visitation will be held 10:00 a.m. to noon, Friday, June 15, 2018 at Ankeny Free Church (118 N.W. Linden St). A funeral service will begin at noon.
John was a life-long Ankeny Native, graduating in 1947 and proud to be a veteran of the U.S. Army. He was passionate about sharing his faith and spending time with family and friends. John didn't know a stranger. Throughout the years, John's civic leadership was instrumental in growing the Ankeny community. He started Lundstrom Realty in 1961 and was a realtor for 56 years. He was a dedicated community servant; serving on the School Board, City Council, Polk County Aviation Board, Rotary Club and many other civic organizations. He rarely missed a Thursday night volunteering for over 20 years at the Polk County Jail Ministry.
John is survived by his children Lee (Cindy) Lundstrom, Karla Kasper, Bryan (Peggie) Lundstrom, of Ankeny, Eric (Beth) Lundstrom of Berwick, Linda (Chris) Cook of West Des Moines and Diane Green of Brooklyn Center, Minnesota; 13 Grandchildren, 7 Great grandchildren, step-children, Breanne Brennan of Jacksonville, Florida, Mark (Julie) Brennan, Missie Fenimore and Dawn (Nick) Erickson, of Ankeny, 4 Step-Grandchildren, and 6 step-great grandchildren.
He was preceded in death by his mother, and son-in-law, Andy Kasper.
In lieu of flowers, memorial contributions may be made in his name to the Ankeny Gideons, P.O. Box 732, Ankeny, IA 50021, or the Ankeny Area Historical Society.
"To the Lundstrom Family: We were sorry to hear of Swede's..."
-Bill McQueen
"Sorry to hear of Swede's passing. He was a good guy and I..."

type: global

value: This website is a United States-based website founded in 1998, the world's largest commercial provider of online memorials. The Web site hosts obituaries and memorials for more than 70 percent of all U.S. deaths.


text:
Aaa Notary in South Williamsport, PA with Reviews - YP.com
Aaa Notary in South Williamsport, PA
1. Sharon's Notary, LLC.
2. Freedom Auto Notary Service
800 Race St Suite AWilliamsport, PA 17701
(570) 322-5522
3. Notary Express
1410 Catherine StWilliamsport, PA 17701
(570) 327-1766
4. Hoover Notary & Tag Service
6784 State Route 973 ECogan Station, PA 17728
(570) 506-3567
5. Maneval's A Notary & Tag Service
67 N Main StHughesville, PA 17737
(570) 584-6075
I had no problems when it came to transferring my vehicle title and the staff was very friendly. I won't go anywhere else now that I've had a positi…
6. Womer's Notary Msg & Tag Service
131 S Railroad StHughesville, PA 17737
(570) 584-4928
7. Maneval's A Notary & Tag Service
64 N Main StHughesville, PA 17737
8. Dorman's Tag Services & Notary
1463 Susquehanna TrlNorthumberland, PA 17857
(570) 473-1944
Notaries PublicTags-VehicleBoat Dealers
A+ service, very knowledgeable. Friendly
9. Your Notary & Tag Service
2900 State Route 42Millville, PA 17846
(570) 458-6140
10. Mobile Notary On The Go
205 Ridge RdWinfield, PA 17889
(570) 743-7204
11. M Whitmoyer Notary
20 Brown Hill RdMuncy Valley, PA 17758
(570) 482-2351
12. Riverside Notary and Services
98 D And H AveDanville, PA 17821
(570) 284-4969
13. Wetzel Notary Service
432 Mill St Ste 1Danville, PA 17821
(570) 275-6522
14. Carla A Buma Notary Public
4003 Maple Grove RdStillwater, PA 17878
15. Royer's Notary Service & Used Cars
RR 3Selinsgrove, PA 17870
(570) 837-1894
16. Notary Shop - CLOSED
1332 W Market StLewisburg, PA 17837
(570) 523-7511
17. Blanchard Harry
314 Railway StWilliamsport, PA 17701
(570) 327-9901
18. Nolan's Auto Tags
(570) 322-8903
Nolan's was great to work with on my title work. The staff was very friendly and they are cheaper than other tag places in the area.
From Business: The UPS Store Williamsport offers in-store and online printing, document finishing, a mailbox for all of your mail and packages, notary, packing, shipping, and ev…
20. Cyberstop
(570) 323-3110
21. Wings Express Inc
22. Keystone Tag & Title
3330 Wahoo DrWilliamsport, PA 17701
(570) 321-6300
24. Baier Ronald E
393 Baier LnJersey Shore, PA 17740
25. Carole Wasson Messenger Service
521 Allegheny St Ste 2Jersey Shore, PA 17740
(570) 398-7877
26. Womer Frederick
185 Ajk BlvdLewisburg, PA 17837
In terms of customer service and courtesy this store is rather hit or miss. Sometimes the customer gets prompt, efficient, courteous service. Some…
325 N 10th StLewisburg, PA 17837
29. Kline's Auto Sales & Service
30. Crate & Freight Plus
Notaries PublicNotionsPrinting Services
From Business: We offer- Shipping services,notary services, copy and fax services.

value: This website is a United States-based web site operated by YP Holdings that provides listings for local businesses. In 2013 it was re-branded as YP.com or simply "YP".


text:
See more: x logo design, where to design logo, required logo designer, reference logo design, psd logo for designer, popular logo design, planet logo design, nexus is, new video logo, logo reference design, logo font designer, logo design x, logo design payment, logo design of, logo design n, logo design movie, logo design lettering, logo design in, logo design i, logo design for game
( 2 reviews ) River Grove, United States
Project ID: #146301
Hi,We are a professional Web Development company having expertise in ASP,.NET and PHP with a successful portfolio [login to view URL] and [login to view URL] Please s More
No problem, will design good clear logo, easily recongnisable and look good small or big. Looks good printed.
we can do the logo design as per your requirements and to your fullest satisfaction. we do not hesitate to revise the design till you are satisfied 100%. we do support whenever required and we are available on the mess More

value: This website is an Australian freelance marketplace website, which allows potential employers to post jobs that freelancers can then bid to complete. Founded in 2009, its headquarters is located in Sydney, Australia, though it also has offices in Vancouver, London, Buenos Aires, Manila, and Jakarta.


text:
Patent US6339720 - Early warning apparatus for acute Myocardial Infarction in the first six ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA portable device (8) for recognizing Acute Myocardial Infarction by the patient himself without the help of medical doctors or technicians is described. The invention performs a real-time analysis of the ST segment (9) in an ambulatory electrocardiographic measurement environment to help the patient...http://www.google.com/patents/US6339720?utm_source=gb-gplus-sharePatent US6339720 - Early warning apparatus for acute Myocardial Infarction in the first six hours of painAdvanced Patent SearchPublication numberUS6339720 B1Publication typeGrantApplication numberUS 09/399,320Publication dateJan 15, 2002Filing dateSep 20, 1999Priority dateSep 20, 1999Fee statusLapsedPublication number09399320, 399320, US 6339720 B1, US 6339720B1, US-B1-6339720, US6339720 B1, US6339720B1InventorsFernando Anzellini, Arturo Sesana, Mario GongoraOriginal AssigneeFernando Anzellini, Arturo Sesana, Mario GongoraExport CitationBiBTeX, EndNote, RefManPatent Citations (42), Referenced by (29), Classifications (4), Legal Events (6) External Links: USPTO, USPTO Assignment, EspacenetEarly warning apparatus for acute Myocardial Infarction in the first six hours of pain
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS2315064Jun 13, 1941Mar 30, 1943Standard Oil Dev CoMethod of protecting cellulosic materialsUS3868567Nov 26, 1973Feb 25, 1975Univ WashingtonMeasurement of ST depression of electrocardiogramsUS3991747Aug 5, 1974Nov 16, 1976Albert L. StanlyPortable cardiac monitoring system and methodUS4006737Jan 4, 1974Feb 8, 1977Del Mar Engineering LaboratoriesElectrocardiographic computerUS4073011Aug 25, 1976Feb 7, 1978Del Mar AvionicsElectrocardiographic computerUS4299233Oct 3, 1979Nov 10, 1981Lemelson Jerome HPatient monitoring device and methodUS4318412Nov 15, 1976Mar 9, 1982Gilbert P. HyattArrangement for cardiac electrode implementationUS4362164Sep 11, 1980Dec 7, 1982Hughes Aircraft CompanyElectronic pick-up device for transducing electrical energy and sound energy of the heartUS4546776Sep 13, 1984Oct 15, 1985Bellin Howard TPortable EKG monitoring device for ST deviationUS4628939Nov 10, 1983Dec 16, 1986Hughes Aircraft CompanyMethod and improved apparatus for analyzing heart activityUS4679144Aug 21, 1984Jul 7, 1987Q-Med, Inc.Cardiac signal real time monitor and method of analysisUS4838275Jul 20, 1987Jun 13, 1989Lee Arnold St JHome medical surveillance systemUS4930075Jun 6, 1988May 29, 1990The Board Of Trustees Of The Leland Stanford Junior UniversityTechnique to evaluate myocardial ischemia from ECG parametersUS4957115Mar 25, 1988Sep 18, 1990New England Medical Center Hosp.Device for determining the probability of death of cardiac patientsUS5003983Aug 25, 1988Apr 2, 1991Cortec, Inc.Cardiac monitoring systemUS5042497Jan 30, 1990Aug 27, 1991Cardiac Pacemakers, Inc.Arrhythmia prediction and prevention for implanted devicesUS5058597Apr 17, 1990Oct 22, 1991Terumo Kabushiki KaishaLong-term electrocardiograph for screeningUS5135004Mar 12, 1991Aug 4, 1992Incontrol, Inc.Implantable myocardial ischemia monitor and related methodUS5181519May 17, 1991Jan 26, 1993Caliber Medical CorporationDevice for detecting abnormal heart muscle electrical activityUS5226424May 17, 1991Jul 13, 1993Caliber Medical CorporationLow energy consumptive device for acquisition of data relating to abnormal heart muscle activityUS5235976Dec 13, 1991Aug 17, 1993Cardiac Pacemakers, Inc.Method and apparatus for managing and monitoring cardiac rhythm using active time as the controlling parameterUS5433209Apr 5, 1994Jul 18, 1995Quinton Instrument CompanyRecorder unit for ambulatory ECG monitoring systemUS5456261Dec 16, 1993Oct 10, 1995Marquette Electronics, Inc.Cardiac monitoring and diagnostic systemUS5462504Feb 4, 1994Oct 31, 1995True Fitness Technology Inc.Fitness apparatus with heart rate control system and method of operationUS5464020Apr 4, 1994Nov 7, 1995Lerner; Albert M.Diagnosing and treating subacute cardiac dysfunctionUS5562711Nov 30, 1994Oct 8, 1996Medtronic, Inc.Method and apparatus for rate-responsive cardiac pacingUS5584868Jul 27, 1994Dec 17, 1996Cardiac Pacemakers, Inc.Cardiac stimulating apparatus and method for heart failure therapyUS5662688Aug 14, 1995Sep 2, 1997Cardiac Pacemakers, Inc.Slow gain controlUS5683444Dec 11, 1995Nov 4, 1997Huntley; SteveComposite electrodeUS5685303Feb 9, 1994Nov 11, 1997Bruce L. RollmanApparatus and method for measuring electrical activity of heartUS5713367Jan 26, 1995Feb 3, 1998Cambridge Heart, Inc.Measuring and assessing cardiac electrical stabilityUS5718233Jan 11, 1996Feb 17, 1998New England Medical Center Hospitals, Inc.Continuous monitoring using a predictive instrumentUS5792066Jan 9, 1997Aug 11, 1998Hewlett-Packard CompanyMethod and system for detecting acute myocardial infarctionUS5813979May 9, 1997Sep 29, 1998Wolfer; Donna A.EKG device having individually storable eletrode leadsUS5876351Apr 10, 1997Mar 2, 1999Mitchell RohdePortable modular diagnostic medical deviceDD281957A5 Title not availableDE2315064A1Mar 26, 1973Oct 10, 1974Detlef Dipl Ing BurchardTragbares geraet zur automatischen auswertung des elektrokardiogramms einer person, mit einrichtungen zur speicherung und darstellung der auswerte-ergebnisseDE3633983A1Oct 6, 1986Apr 7, 1988Gerhard Hans Dr Med WasserMethod and device for monitoring the human heartGB2061521A Title not availableJP40517690A Title not availableJPH0564632A Title not availableSU1570709A1 Title not availableReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6532381 *Jan 11, 2001Mar 11, 2003Ge Medical Systems Information Technologies, Inc.Patient monitor for determining a probability that a patient has acute cardiac ischemiaUS6665559 *Dec 29, 2000Dec 16, 2003Ge Medical Systems Information Technologies, Inc.Method and apparatus for perioperative assessment of cardiovascular riskUS7066891 *Dec 20, 2002Jun 27, 2006Medtronic, Inc.Method and apparatus for gauging severity of myocardial ischemic episodesUS7072708 *Dec 2, 2003Jul 4, 2006Inovise Medical, Inc.Differentiating acute myocardial infarction from other ECG abnormalitiesUS7328061Oct 15, 2003Feb 5, 2008Ge Medical Systems Information TechnologiesMethod and apparatus for perioperative assessment of cardiovascular riskUS7558623 *May 26, 2004Jul 7, 2009Angel Medical Systems, Inc.Means and method for the detection of cardiac eventsUS7616980Sep 28, 2006Nov 10, 2009Tyco Healthcare Group LpRadial electrode arrayUS7766830Nov 30, 2004Aug 3, 2010Medtronic Minimed, Inc.System for monitoring physiological characteristicsUS7925323Oct 1, 2009Apr 12, 2011Tyco Healthcare Group LpRadial electrode arrayUS8109883Sep 28, 2006Feb 7, 2012Tyco Healthcare Group LpCable monitoring apparatusUS8180425Dec 5, 2007May 15, 2012Tyco Healthcare Group LpECG lead wire organizer and dispenserUS8238996Dec 5, 2007Aug 7, 2012Tyco Healthcare Group LpElectrode arrayUS8265740Jun 3, 2009Sep 11, 2012Angel Medical Systems, Inc.Means and method for the detection of cardiac eventsUS8457724Oct 30, 2009Jun 4, 2013Siemens Medical Solutions Usa, Inc.System for heart performance characterization and abnormality detectionUS8483812 *Mar 31, 2008Jul 9, 2013Angel Medical Systems, Inc.Cardiac event categorization systemUS8560043May 14, 2012Oct 15, 2013Covidien LpECG lead wire organizer and dispenserUS8571627May 14, 2012Oct 29, 2013Covidien LpECG lead wire organizer and dispenserUS8600499Dec 5, 2006Dec 3, 2013Cardiac Pacemakers, Inc.Method and device for cardiac vasoactive therapyUS8684942Jan 18, 2012Apr 1, 2014Siemens Medical Solutions Usa, Inc.System for cardiac impairment detection based on signal regularityUS8798708Mar 20, 2012Aug 5, 2014Covidien LpPhysiological sensor placement and signal transmission deviceUS8818494Jul 18, 2011Aug 26, 2014Siemens Medical Solutions Usa, Inc.System for ventricular function abnormality detection and characterizationUS8868152Jun 25, 2012Oct 21, 2014Covidien LpElectrode arrayUS8868168Jun 15, 2011Oct 21, 2014Siemens Medical Solutions Usa, Inc.System for cardiac condition characterization using electrophysiological signal dataUS8903480Jan 15, 2013Dec 2, 2014Siemens Medical Solutions Usa, Inc.System for cardiac condition detection using heart waveform area associated analysisUS8965494Oct 16, 2013Feb 24, 2015Angel Medical Systems, Inc.Means and method for the detection of cardiac eventsUS20070249944 *Jun 22, 2007Oct 25, 2007Fischell David RMeans and method for the detection of cardiac eventsUS20110040199 *Aug 12, 2009Feb 17, 2011Bruce HopenfeldHeart rate correction system and methods for the detection of cardiac eventsUS20110112420 *Jun 23, 2009May 12, 2011Dainippon Sumitomo Pharma Co., Ltd.Pain judging deviceUSRE43569 *Apr 26, 2007Aug 7, 2012ECG-Tech Corp.Three dimensional vector cardiograph and method for detecting and monitoring ischemic events* Cited by examinerClassifications U.S. Classification600/517International ClassificationA61B5/0452Cooperative ClassificationA61B5/0452European ClassificationA61B5/0452Legal EventsDateCodeEventDescriptionMar 9, 2010FPExpired due to failure to pay maintenance feeEffective date: 20100115Jan 15, 2010LAPSLapse for failure to pay maintenance feesJul 27, 2009REMIMaintenance fee reminder mailedOct 8, 2005FPAYFee paymentYear of fee payment: 4Oct 8, 2005SULPSurcharge for late paymentAug 3, 2005REMIMaintenance fee reminder mailedRotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
Students bulgaria
MUSATTI (42 SlideShares)
1. ST Sofrony Vrachanski Secondary School E-mail: [email_address] www.sofrony.net 2. Hey, guys!  My name is Dimitrela, I’m 15 and I’m from a small town called Perushtitsa.  3.

I’m a total Lindsay Lohan maniac !! She is absolutely amazing ! 

I enjoy listening to Rock and Punk music. My favourite bands are Three Days Grace, Simple Plan, Papa Roach, Sum 41, Avril Lavigne, Paramore…

I love ONE TREE HILL! My all-time favourite show!  4. I’m addicted to the Twilight Saga!

I adore Rob Pattinson

and I bet u do, too! 

5. I hope to chat with u soon !

Dimitrela

xoxo

6. Hi! My name is Angel , I’m 15 and I live in Plovdiv I play soccer from 3 years and I’m playing volleyball too. I hope we’ll have a good time together! 7. I listen house music and I love going to the disco. I love the tracks of Ahmet Sendil , Dimas , Iv & Grove. 8. Nadejda Ancheva 15 age Plovdiv , Bulgaria 9. ** divanety ..! 10. XOXOX *--I like having fun with my friends. [sun] *--I love going shopping… *--go in for sports…. *--I love listening to music and everything connected with it …. *--I dance in folkdance company….. ……………..!!! NADEJDA ANCHEVA ..:] 11. Hi! I’m Peter and I am 15 years old. I live in Plovdiv ,Bulgaria. . 12. I like listening to old school hip hop and rap. 13. In my free time I like going extreme rollerblading. 14. Hi all! My name is Ralitsa Stancheva, I’m 15 and I’m from Plovdiv. Hi! I’m Mihaela Nedelcheva, a 15-year-old girl from Plovdiv.   15.

In our free time, we like watching comedies, cartoons and surfing the net. We love strolling round town.

We love going to cafes and discos. We enjoy listening to House and Bulgarian folk music. 16. We can’t wait to chat with you!

Best wishes,

Rals & Mishi

xoxo

17. Hi ! My name is Silviq. I’m 16 years old,live in Plovdiv,Bulgaria 18. Аt another time to deal with fitness, home duties, b illiards, walking with friends and much more . . 19. I study geography, economic and tourism.My favorite music styles is R&B,House,Classic and little popfolk ;} More about me in www.google.bg :] byeee. . Skype- nokia52203 20. Hi, my name is Tsvetanka, but my friends call me Sese’. I’m 16 years old, and I’m from Plovdiv, the second largest Bulgarian city. 21. Little information about me:

I’ve been practising folk dancing for 10 years. I study Geography, Economic and Tourism. I like music like: reggaeton, latino, rock,Bulgarian pop music, R.n.B.. And more… I have too many hobbies… hairstyling, spanish, latino dance and music, sports, journalism, Geography and more… and more…

22. Best wishes, Sese’ :] skype - sese1117 23. Hi everyone! My name is Vanya, im 15 and I live in Plovdiv . I’m Teodora, but you can call me Tedi.. Im 15 and I’m from Plovdiv. 24. We love music and comedy films. We like hanging out with friends… 25. Hi all! My name is Plamen and I’m 15. I live in Plovdiv. 26. I listen House Music ( Minimal , Progressive , Tech House ) My fav. dj’s are: deadmau5, lion, dimas and ect. Recommended
MUSATTI 374
MUSATTI 363
MUSATTI 331
MUSATTI 727
MUSATTI 375
MUSATTI 609
MUSATTI 562
"Concorso immagini amiche" -Gruppo 4 IIA
MUSATTI 524
"Concorso immagini amiche" - Gruppo 3_IIA
MUSATTI 428
MUSATTI 805

value: This website is an American hosting service, now owned by Scribd, for professional content including presentations, infographics, documents, and videos. Users can upload files privately or publicly in PowerPoint, Word, PDF, or OpenDocument format.


text:
Kirikou and the sorceress (DVD video, 1998) [WorldCat.org]
I thought you might be interested in this item at http://www.worldcat.org/oclc/60554795 Title: Kirikou and the sorceress Author: Michel Ocelot; Raymond Burlet; Doudou Gueye Thiaw; Youssou N'Dour; Armateurs (Firm); ArtMattan Productions Publisher: New York, NY : Distributed by ArtMattan Productions, 1998. OCLC:60554795
Michel Ocelot; Raymond Burlet; Doudou Gueye Thiaw; Youssou N'Dour; Armateurs (Firm); All authors
New York, NY : Distributed by ArtMattan Productions, 1998.
"This animated film exquisitely recounts the tale of tiny Kirikou, born in an African village on which Karaba the Sorceress has placed a terrible curse. Kirikou sets out on a quest to free his village of the curse and find out the secret of why Karaba is so wicked"--Container.
Michel Ocelot; Raymond Burlet; Doudou Gueye Thiaw; Youssou N'Dour; Armateurs (Firm); ArtMattan Productions.
Find more information about: Michel Ocelot Raymond Burlet Doudou Gueye Thiaw Youssou N'Dour
60554795
French and English soundtracks with English subtitles.
Special features: Comments by filmmaker; Color game; Character presentation.
Original music, Youssou N'Dour.
Voices: Doudou Gueye Thiaw, William Nadylam-Yotnda, Sébastien Hèbrant.
Les Armateurs [and others] présentent un film de Michel Ocelot en collaboration avec Raymond Burlet.
Add tags for "Kirikou and the sorceress". Be the first.
<http://www.worldcat.org/oclc/60554795> # Kirikou and the sorceress
library:oclcnum "60554795" ;
library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/918061241#Place/new_york_ny> ; # New York, NY
schema:about <http://experiment.worldcat.org/entity/work/data/918061241#Place/africa> ; # Africa
schema:about <http://experiment.worldcat.org/entity/work/data/918061241#Topic/foreign_films_france> ; # Foreign films--France
schema:about <http://id.loc.gov/authorities/subjects/sj96006383> ; # Witchcraft
schema:alternateName "Kirikou et la sorcière" ;
schema:contributor <http://viaf.org/viaf/132884590> ; # Armateurs (Firm)
schema:contributor <http://viaf.org/viaf/10099909> ; # Doudou Gueye Thiaw
schema:contributor <http://viaf.org/viaf/39498170> ; # Michel Ocelot
schema:contributor <http://viaf.org/viaf/106860614> ; # Raymond Burlet
schema:description ""This animated film exquisitely recounts the tale of tiny Kirikou, born in an African village on which Karaba the Sorceress has placed a terrible curse. Kirikou sets out on a quest to free his village of the curse and find out the secret of why Karaba is so wicked"--Container." ;
schema:exampleOfWork <http://worldcat.org/entity/work/id/918061241> ;
schema:name "Kirikou and the sorceress" ;
schema:productID "60554795" ;
schema:publication <http://www.worldcat.org/title/-/oclc/60554795#PublicationEvent/new_york_ny_distributed_by_artmattan_productions_1998> ;
schema:publisher <http://experiment.worldcat.org/entity/work/data/918061241#Agent/distributed_by_artmattan_productions> ; # Distributed by ArtMattan Productions
wdrs:describedby <http://www.worldcat.org/title/-/oclc/60554795> ;
<http://experiment.worldcat.org/entity/work/data/918061241#Agent/distributed_by_artmattan_productions> # Distributed by ArtMattan Productions
<http://experiment.worldcat.org/entity/work/data/918061241#Place/africa> # Africa
<http://experiment.worldcat.org/entity/work/data/918061241#Place/new_york_ny> # New York, NY
<http://experiment.worldcat.org/entity/work/data/918061241#Topic/foreign_films_france> # Foreign films--France
<http://id.loc.gov/authorities/subjects/sj96006383> # Witchcraft
<http://viaf.org/viaf/10099909> # Doudou Gueye Thiaw
schema:familyName "Thiaw" ;
schema:givenName "Doudou Gueye" ;
schema:name "Doudou Gueye Thiaw" ;
<http://viaf.org/viaf/106860614> # Raymond Burlet
schema:familyName "Burlet" ;
schema:name "Raymond Burlet" ;
<http://viaf.org/viaf/132884590> # Armateurs (Firm)
schema:name "Armateurs (Firm)" ;
<http://www.worldcat.org/title/-/oclc/60554795>
schema:about <http://www.worldcat.org/oclc/60554795> ; # Kirikou and the sorceress
<http://www.worldcat.org/title/-/oclc/60554795#PublicationEvent/new_york_ny_distributed_by_artmattan_productions_1998>
schema:location <http://experiment.worldcat.org/entity/work/data/918061241#Place/new_york_ny> ; # New York, NY
schema:organizer <http://experiment.worldcat.org/entity/work/data/918061241#Agent/distributed_by_artmattan_productions> ; # Distributed by ArtMattan Productions
Kirikou and the sorceress/Michel Ocelot; Raymond Burlet; Doudou Gueye Thiaw; Youssou N'Dour; Armateurs (Firm); ArtMattan Productions.;; New York, NY : Distributed by ArtMattan Productions, 1998.

value: This website is a union catalog that itemizes the collections of 15,637 libraries in 107 countries that participate in the OCLC global cooperative. It is operated by OCLC, Inc.


text:
Roses Postcards Vintage Papers Ephemera Decoupage French
Roses Postcards Vintage Papers Ephemera Decoupage French printable 6 x 4 inch Instant Download digital collage sheet D110
4 digital images Vintage Papers Postcards Roses
I made journal covers with parchment bags for my Scrapbooking club members. I printed them on ivory sketch paper, tore the images out and separated the words and writing sections. They have beautiful detail and vintage tones.
Reviewed by Cat Carver
Gorgeous files thank you so much!
Chalkboard Postcards Roses Flowers Floral Botanical 6 x 4 inch Instant Download digital collage sheet D125
Chalkboard Roses French Flowers Vintage 6 x 4 inch Instant Download digital collage sheet D153
Roses Postcards Vintage Papers Flowers printable Ephemera Botanical Card 6 x 4 inch Instant Download digital collage sheet D279
Joyeux Noel French Christmas Vintage Papers Ephemera Joyeux Noel 6 x 4 inch printable Instant Download digital collage sheet D207
Ephemera Postcards Carte Postale French 6 x 4 inch Instant Download digital collage sheet D138
Postcards Carte Postale printable Ephemera Journal French Cards France 4x6 inch Instant Download digital collage sheet D295
Roses and Postcards Women's Apron
ephemera postcards
postcards decoupage

value: This website is an American e-commerce company focused on handmade or vintage items and craft supplies.


text:
Ciara joins her boyfriend Future for a romantic dinner after returning from her trip to Dubai | Daily Mail Online
Published: 17:14 EDT, 27 February 2013 | Updated: 02:42 EDT, 28 February 2013
Ciara's back in town and in the arms of her boyfriend.
The 27-year-old R&B star and her beau Future, aka Nayvadius Cash, were spotted at Mastro's Steakhouse in Beverly Hills, California on Tuesday.
Showing affection, Ciara Princess Harris cozied up to Future, linking her left hand around his right arm.
Cozied up: Ciara and her boyfriend Future were snapped linking arms as they enjoyed a night at Mastro's Steakhouse in Beverly Hills, California on Tuesday
Getting glammed up for their night out on the town, she revealed some skin in a sheer black button-down blouse that lay over her black brazier, and paired with her skintight leather pants.
She and her boyfriend also appeared to be wearing matching metal bracelets on their right wrists.
Matching bracelets: The couple showed their affection by wearing the same metal bracelets on their right wrists
Opting for a monochrome black outfit of a button-down pressed shirt, sleek pants and lace-up ankle boots, Future's outfit coordinated with Ciara's,
Trying to stay low key, the couple mostly kept their eyes on the ground during their stroll, and Future wore gradient-lens sunglasses, even covering his face with his left hand at one point.
This is the first time that the couple has been snapped together since Ciara returned from her trip to Dubai.
Dressing for date night: The R&B star wore a sheer black blouse and fur shall, as she styled her hair in a sophisticated top knot
On Friday, she shared pictures of her adventures, including a shot of her her proudly posing on a camel.
'My Ace Yoli Was Wit Me! We got to ride a camel for the 1st time!:) it was so cool!..#Dubai,' the Grammy winner tweeted to her 3.2 million followers, along with the photo.
But her rapper boyfriend was absent from the photos, until she posted a picture of him riding an elevator on Saturday.
'My Ace Yoli Was Wit Me! We got to ride a camel for the 1st time!:) it was so cool!..#Dubai,' the Grammy winner tweeted to her 3.2 million followers last week
Ciara joins her boyfriend Future for a romantic dinner after returning from her trip to Dubai

value: This website is the website of the Daily Mail, a newspaper in the United Kingdom, and of its sister paper The Mail on Sunday. MailOnline is a division of dmg media, which is owned by Daily Mail and General Trust plc.


text:
Brian Walton finishes explaining which Cardinals players may join the Major League roster in September and which others may not. - St. Louis - Scout
Matt Holliday, Aledmys Diaz (Jeff Curry/USA TODAY Sports Images) Brian Walton finishes explaining which Cardinals players may join the Major League roster in September and which others may not.Brian Walton08/23/2016Brian Walton finishes explaining which St. Louis Cardinals players may join the Major League roster in September and why and which others may not.In Part 1 of this two-part series, I explained in detail why the St. Louis Cardinals should not need significant minor league call-ups in September. In a nutshell, the reason is that as many as eight major leaguers are working to come off the disabled list and rejoin St. Louis for the final month.
Because of a very tight 40-man roster and the eight other potential additions, I am predicting two call-ups, both of whom have St. Louis experience and are already on the 40-man – Dean Kiekhefer and Miguel Socolovich.
Here is a table illustrating how the active St. Louis roster would grow to the very considerable size of 35 players in the above scenario.
September adds (10)
60-day DL return (3)
15-day DL return (5)
Minors on 40-man (2)
60-day DL adds (1)
Because three of the eight injured Cardinals are currently on the 60-day disabled list, the fact the 40-man roster is full and just one current player not yet on the 40-man is clearly out for the season (Seth Maness), two other players would have to come off the current 40-man just to allow all eight to be activated.
In this case, the openings would have to be sourced from the five remaining 40-man roster players who I predict will not be called up. They are listed in the order in which I think they would be removed from the 40-man. In this scenario, I see infielder Dean Anna and outfielder Anthony Garcia most likely to lose their 40-man spots.
No Sept. promotion (5)
Minors on 40-man (two 40-man removals 1. Dean Anna
needed) 2. Anthony Garcia
4. Michael Ohlman
5. Mike Mayers
The gap between being brought up to St. Louis in September and being taken off the 40-man roster could be very thin indeed, especially for the above five.
If one wanted to look at the list of five from the bottom up, they would be the next-most likely September additions, in my opinion. They would begin with starting pitcher Mike Mayers, followed by the man who would essentially be the fourth catcher for the final month in Michael Ohlman and finally, outfielder Jose Martinez, an offensive leader of the Memphis lineup since being purchased from Kansas City in May.
I see three other players currently at Triple-A Memphis who could be viable candidates for addition to the 40-man roster and to make major league debuts in September – if it wasn’t for the space crunch, that is. Fortunately, the Arizona Fall League prospect showcase offers an ideal – and even perhaps a better - alternative for catcher Carson Kelly, outfielder Harrison Bader and left-handed reliever Ryan Sherriff to continue to improve. That is my best guess where the trio will finish their 2016 seasons.
Top promotion candidates
(to Arizona Fall League?)
Some may also see infielder Breyvic Valera and first baseman-outfielder David Washington as potential 40-man candidates, but I consider them a tier below the aforementioned group. Further, given the roster crunch and my sense that their MLB futures are unlikely, I don’t see them being added in September, without a wave of unexpected injuries in St. Louis. A more likely scenario
In my opinion, the above example is too optimistic in its view that all eight injured Cardinals will return in September. The reality is that the clock is ticking on the 2016 schedule. The minor league regular season has less than two weeks remaining, meaning most of the injured major leaguers may be trying to come back without the benefit of playing minor league rehab games first.
Three of them, however, are already on that path. Lance Lynn and Brayan Pena are currently playing in rehab games at A-Advanced Palm Beach, and Jordan Walden is apparently right behind. That makes their chances to reach St. Louis next month considerably better. They are the three on the 60-day DL currently, needing the aforementioned three 40-man spots.
However, we know very little about the potential recovery plans for pitchers Michael Wacha and Trevor Rosenthal. If they don’t start throwing very soon, I think their returns would have to move to the doubtful category. In fact, they may already be there.
The return of the injured Matts – Adams and Holliday – also is up for debate. The former has a shoulder injury about which nothing of substance has been communicated and the latter is trying to come back from thumb surgery conducted within the last week.
The best chance of returning among the injured players not yet rehabbing seems to be shortstop Aledmys Diaz. I say that because his hairline thumb fracture occurred back on July 31 - though the Cardinals’ original hope of the rookie returning at the beginning of September feels unlikely to me.
As you can tell by the quick summaries above, there is a non-zero chance that at least several of the five of the 15-day DL players do not make it back at all in 2016. As long as that total is two or more, then Anna and Garcia would not have to lose their 40-man roster spots. I still don’t think the pair would be called up, however. In fact, I think the Cardinals would be quite satisfied competing in September with 33 players instead of 35.
As mentioned above, Mayers would have the best chance of joining the September promotions if both Rosenthal and Wacha cannot return, for example. But again, I am not predicting that at this time.
However, just to carry this scenario one step further, if Rosenthal and Wacha cannot make it back, they could be moved to the 60-day DL themselves, creating room to add two more players, such from the group of Kelly, Bader and Sherriff. I still think the three will be Arizona-bound, instead, though.
Another factor that could change matters is new injuries to others the rest of the way. If the Cardinals’ unfortunate run of bad luck that began earlier in August continues, one or more of the non-call-ups could find their status changing.
When all is said and done, I think at least Wacha and Rosenthal will not make it back this season, with Holliday and Adams the next least likely to return. Moving the two pitchers plus Maness to the 60-day DL would create the three openings on the 40-man roster to accommodate the returns of Lynn, Walden and Pena. I predict only current 40-man roster players Kiekhefer and Socolovich will be promoted from Memphis in September and no first-time 40-man additions will be made. This would get St. Louis to 33 active players.
September adds (8)
15-day DL return (3)
60-day DL adds (3)
© 2016 The Cardinal Nation, thecardinalnation.com and scout.com. All rights reserved. This material may not be published, broadcast, rewritten or redistributed. Share on Facebook Share on TwitterTrending on ScoutGrad Transfers Candidates Visit This WeekendLISTEN: Combine Questions On O-Line ProspectsAU Spring Preview 17: Tight Ends/H-backsUNC-UVa: Roy Williams PostgameNavy Modernizes Sub-Launched Nuclear WarheadThe Cardinal Nation Top StoriesCardinals MLB Notebook: Week of Feb. 20-26Last week’s St. Louis Cardinals news includes the first two spring games, an international free agent signing, team-building, return of a team Hall of Famer and more.by Marilyn GreenThe Cardinal NationYesterday at 6:50 PMCards’ New Cuban Pipeline Can Seek Out DiazThe St. Louis Cardinals have spent $5.5 million on Cuban free agents this year alone and could go higher. They already have a trailblazer in their clubhouse in shortstop Aledmys…by Brian WaltonThe Cardinal NationSaturday at 6:34 AMCardinals Sign Cuban OF Jose Adolis GarciaThe St. Louis Cardinals have added a Cuban outfielder on a minor league contract with an invitation to Major League camp.by St. Louis Cardinals press releaseThe Cardinal NationFriday at 5:29 PM2017 Cardinals Prospects: What the Others SayOur ninth annual analysis and consolidation of national top 10 lists of St. Louis Cardinals prospects from seven different national entities – comparing them to our own list, of…by Brian WaltonThe Cardinal NationFriday at 8:01 AMScout's Top-100 MLB Prospects: Players 80-71Scout.com unveils its 2017 top-100 MLB prospects ranking. Here is an in-depth look on each of the players from 80-71.by Jeff Ellis / Taylor Blake WardScouting BaseballThursday at 7:37 PM2017 Cards Minors Spring Training SchedulesTriple-A, Double-A and Single-A schedules for St. Louis Cardinals prospects during 2017 spring training in Florida.by Brian WaltonThe Cardinal Nation02/01/2017Buy-Low Candidate: Cards OF Randal GrichukAfter failing to meet the high expectations placed upon him in 2016 by Fantasy owners, St. Louis Cardinals OF Randal Grichuk and his big-time power potential are being drafted at a…by Adam RonisScout FantasyFriday at 8:47 AMMaking Odds on Cardinals Non-Roster InviteesSeveral among the St. Louis Cardinals’ 27 non-roster invitees to big league camp seem to have a reasonable chance to make St. Louis out of spring camp.by Brian WaltonThe Cardinal NationThursday at 5:00 AMRising, Falling Stock of 2017 Cards ProspectsOur annual in-depth breakdown of year-to-year changes in the lists of those invited to the St. Louis Cardinals’ various spring camps.by Brian WaltonThe Cardinal NationWednesday at 6:14 AMCardinals 2017 Photo Day: Position PlayersHeadshots of 31 St. Louis Cardinals position players and five coaches from the team’s annual photo day in Major League camp.by The Cardinal Nation staffThe Cardinal Nation02/20/2017St. Louis Cardinals 2017 Photo Day: PitchersHeadshots of 35 St. Louis Cardinals hurlers and five coaches from the team’s annual photo day in Major League camp.by The Cardinal Nation staffThe Cardinal Nation02/20/2017Cardinals MLB Notebook: Week of Feb. 13-19Last week’s St. Louis Cardinals news includes a season-ending injury, a rare arbitration hearing, a suspension and more – all in the first week of spring training camp.by Marilyn GreenThe Cardinal Nation02/20/2017Load More

value: This website is an integrated sports publishing company that produces Internet content covering hundreds of professional and college teams across America. The company was founded in 2001 and was acquired by Fox Sports in 2005.


text:
Kyoto Express in Fayetteville, North Carolina with Reviews & Ratings - YP.comFind People•Advertise With UsBrowseFind PeopleFeatured CollectionsRestaurantsAutomotiveHome ImprovementHealth & WellnessAttorneysPeople Searched For...Personal Injury Attorney Las VegasPersonal Injury Attorney DenverWater Removal AtlantaCriminal Attorney West Palm BeachWater Damage PhoenixWater Heaters Las VegasAc Repair DallasWater Damage ScottsdaleWater Damage AtlantaAccident Attorney AustinWater Damage Las VegasAuto Accident Lawyer DallasAuto Accident Attorney DallasPlumbing DenverPersonal Injury Lawyer Boca RatonAll Popular CitiesHoustonSan AntonioPhoenixLas VegasMiamiLos AngelesChicagoDallasOrlandoAtlantaPhiladelphiaOklahoma CityIndianapolisCharlotteMemphisJacksonvilleAdvertise with usWe have plenty of solutions to help you grow your businessWhat do you want to find?Search by business name, or keywordnearWhere? Address, ZIP Code, or NeighborhoodMy current locationSearchSign In•JoinHomeFayetteville, NCKyoto ExpressFayetteville Kyoto ExpressSort:Most RelevantMost RelevantDistanceRatingName (A - Z)FiltersFiltersMore NeighborhoodsDouglas ByrdDowntown FayettevilleE. E. SmithJack BrittPine ForestSeventy-FirstSouth ViewTerry SanfordWestoverDoneClear AllMore CategoriesAmericanAsianBarbecueBuffetCaterersChineseFamily StyleFast FoodFish & Seafood MarketsIce Cream & Frozen DessertsJapaneseKoreanMediterraneanMexicanSandwich ShopsSeafoodSushi BarsTake OutThaiDoneClear AllCategoryAsian RestaurantsJapanese RestaurantsTake Out RestaurantsMore »FeaturesBook A TableCouponsNeighborhoodsWestoverDouglas ByrdJack BrittMore »Sponsored LinksBuy on eBay Today!Find Great ProductsLow Prices, New, and Usedwww.ebay.comHealth & BeautyGet The Latest GadgetsFind The Latest DesignersStyles For Your HomeBaby ItemsAdd to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?1. Kyoto Express(1)1808 Owen DrFayetteville, NC 28304(910) 483-5915Japanese RestaurantsRestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?2. Kyoto Express3915 Ramsey St Ste 107Fayetteville, NC 28311(910) 488-9066Japanese RestaurantsRestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?3. Kyoto Express - CLOSED6828 Thames DrFayetteville, NC 28306(910) 425-5995Japanese RestaurantsRestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?4. Kyoto Fantasy Express2043 Skibo RdFayetteville, NC 28314(910) 764-3278Japanese RestaurantsRestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?5. Kyoto Fantasy Express7711 S Raeford Rd Ste 105Fayetteville, NC 28304(910) 868-6989Japanese RestaurantsRestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?6. Asian Express RestaurantMenu(5)528 S Reilly Rd Ste 113Fayetteville, NC 28314(910) 864-5556RestaurantsAsian RestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?7. Asian Express Restaurant(3)2622 Hope Mills RdFayetteville, NC 28306(910) 426-9828RestaurantsAsian RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?8. Mikoto Express1400 Walter Reed RdFayetteville, NC 28304(910) 829-9533Japanese RestaurantsRestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?9. J & S ExpressMenu7071 Raeford Rd Suite CFayetteville, NC 28304(910) 860-8338Japanese RestaurantsRestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?10. Miyabi Express(1)508 N McPherson Church RdFayetteville, NC 28303(910) 568-5466Japanese RestaurantsRestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?11. Panda ExpressMenu(1)585 Cross Creek MallFayetteville, NC 28303(910) 487-7932RestaurantsTake Out RestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?12. Egg Roll Express Restaurant - CLOSED3401 Raeford Rd Ste DFayetteville, NC 28303(910) 867-4200RestaurantsAsian RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?13. Seafood ExpressMenu936 Brighton RdFayetteville, NC 28314(910) 486-5883RestaurantsSeafood RestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?14. Miyabi Jr Express4747 Ramsey StFayetteville, NC 28311(910) 339-0636RestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?15. Japan Express - CLOSED5316 Sandstone DrFayetteville, NC 28311(910) 864-8800Japanese RestaurantsRestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?16. China Express1738 Bingham DrFayetteville, NC 28304(910) 425-1393RestaurantsChinese RestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?17. Dubai Express RestaurantMenu155 Bonanza DrFayetteville, NC 28303(910) 487-0412RestaurantsMediterranean RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?18. Bangkok Express5430 Camden Rd Ste 101Fayetteville, NC 28306(910) 424-8828RestaurantsThai RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?19. Asian Express6415 Camden Rd Ste 101Fayetteville, NC 28306(910) 491-2980RestaurantsAsian RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?20. Thai House Express(1)316 N Eastern Blvd # 212Fayetteville, NC 28301(910) 823-2222RestaurantsThai RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?21. Siam Express(1)6257 Raeford Rd Ste 1Fayetteville, NC 28304(910) 826-0600RestaurantsThai RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?22. Yummy Express(1)6441 Yadkin RdFayetteville, NC 28303(910) 826-2340RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?23. E Tae Won ExpressMenu(1)594 S Reilly Rd Ste 100Fayetteville, NC 28314(910) 867-1077RestaurantsKorean RestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?24. Yoshi Thai Express350 N Eastern Blvd Ste 200Fayetteville, NC 28301(910) 703-8633Japanese RestaurantsRestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?25. Japan Express - CLOSED155 Bonanza Dr Ste 115Fayetteville, NC 28303(910) 864-8800Japanese RestaurantsRestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?26. Ichiban Express3350 Footbridge LnFayetteville, NC 28306(910) 339-5070Japanese RestaurantsRestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?27. Tokyo's Express3114 N Main St Ste 102Hope Mills, NC 28348(910) 423-2700Japanese RestaurantsRestaurantsWebsiteDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?28. Hibachi Express(1)1195 N Bragg BlvdSpring Lake, NC 28390(910) 436-2907Japanese RestaurantsRestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?29. Muncheez Express5609 Fayetteville RdRaeford, NC 28376(910) 904-0321RestaurantsDirectionsMore InfoRooms & Rates »Add to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?30. China Express(1)1659 Buffalo Lake RdSanford, NC 27332(919) 499-0885RestaurantsChinese RestaurantsDirectionsMore InfoRooms & Rates »Sponsored LinksShowing1-30
of 41results12NextIf we're missing a business and you'd like to make a suggestion, please do! Add a business.Add a New CollectionOops! There was a problem saving the new custom collection.Please try again.Collection Name cannot be emptyUpload a Photo(optional)Remaining Characters: 100Remaining Characters: 500CancelSaveMap ViewFeatured Japanese Restaurantsin Fayetteville, North CarolinaAdd to mybookRemove from mybookAdded to your food collection!Error when adding to food collectionThis business was removed from the food collectionInaccurate Result?Shogun Buffet And Hibachi Grill220 Jackson CtLumb, NC 28538(910) 272-1500WebsiteVirtual TourDirectionsMore InfoSponsored Fayetteville Kyoto expressPhoneWebsiteMoreAboutAbout UsSite FeedbackContact UsAdvertise with UsCareers - We're HiringEngineering BlogLegal


text:
Patent US7187376 - Displaying views on computer screens - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsMethods and apparatus for displaying views in computer windows. If a user links to a new view while there are unsaved changes in the current view, the system may offer the user to display the new view in a separate window. In other aspects, the system displays the new view in a separate window if there...http://www.google.com/patents/US7187376?utm_source=gb-gplus-sharePatent US7187376 - Displaying views on computer screensAdvanced Patent SearchPublication numberUS7187376 B2Publication typeGrantApplication numberUS 10/232,948Publication dateMar 6, 2007Filing dateAug 30, 2002Priority dateJun 4, 2002Fee statusPaidAlso published asEP1516265A2, US20030222919, WO2003102912A2, WO2003102912A3Publication number10232948, 232948, US 7187376 B2, US 7187376B2, US-B2-7187376, US7187376 B2, US7187376B2InventorsRainer BrendleOriginal AssigneeSap AktiengesellschaftExport CitationBiBTeX, EndNote, RefManPatent Citations (15), Non-Patent Citations (8), Referenced by (4), Classifications (9), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetDisplaying views on computer screens
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5715415Jun 5, 1996Feb 3, 1998Microsoft CorporationComputer application with help pane integrated into workspaceUS5933140Jun 30, 1997Aug 3, 1999Sun Microsystems, Inc.Child window containing context-based help and a miniaturized web pageUS6098081May 6, 1996Aug 1, 2000Microsoft CorporationHypermedia navigation using soft hyperlinksUS6134552Jan 28, 1998Oct 17, 2000Sap AktiengesellschaftKnowledge provider with logical hyperlinksUS6314422Dec 9, 1997Nov 6, 2001Chrysler CorporationMethod for softlinking between documents in a vehicle diagnostic systemUS7137072 *Oct 17, 2002Nov 14, 2006Sun Microsystems, Inc.Method and system for managing documents modified while being viewed in a browser windowUS20020054123Feb 9, 1998May 9, 2002Ralph E. WaldenAccess of online information featuring automatic hide/show functionUS20030222919 *Aug 30, 2002Dec 4, 2003Rainer BrendleDisplaying views on computer screensUS20060248442 *Apr 29, 2005Nov 2, 2006Rosenstein Justin MWeb page authoring tool for structured documentsEP0889418A2Jun 26, 1998Jan 7, 1999Sun Microsystems Inc.Abstract URL resolution via relocation serviceEP0961202A1Dec 10, 1998Dec 1, 1999Hewlett-Packard CompanySharing of web session environment informationEP1221661A2Jan 2, 2002Jul 10, 2002Openwave Systems Inc.Method and apparatus for dynamically updating a HTML based user interfaceWO2000055711A1Mar 16, 2000Sep 21, 2000Neill Damien OSystem and method for implementing a computer help functionWO2001009714A2Jul 28, 2000Feb 8, 2001Respondtv IncMethod, apparatus, and computer program product for deferred completion of multi-step user transaction applicationsWO2001057718A2Jan 31, 2001Aug 9, 2001America Online IncSystem and process for delivering and rendering scalable web pages* Cited by examinerNon-Patent CitationsReference1"How to Force a New Window In Mosaic 2.4"[online],Google Groups Nov. 12, 1994, [Retrieved on Apr. 7, 2006]. Retrieved from the Internet: URL:http://groups.google.com/groups/comp.infosystems.www.providers/browse<SUB>-</SUB>thread/thread/4cce598a9499030e/3b0c60f69f4ac4ed.2Gralla, "How Hypertext Works," How the Internet Works, Sixth Edition, Copyright 2002 by Que, Chapter 24, pp. 148-151.3http://forums.devshed.com/t13437/s.html-"Discussion Forums" Apr. 12-15, 2001, retreived from Internet on Sep. 17, 2003.4 *Mastering Microsoft Office 2000 Professional Edition. Courter et al. p. 30. Sybex. 1999.5 *Microsoft Internet Explorer. Version 6. 1995-2001. Figs. 1-6.6 *Microsoft Internet Explorer. Version 6. Copyright 1995-2001. Figures 4-5.7 *Microsoft Word 2000. Copyrignt 1983-1999. Figures 1-3.8Smith et al. "Guidelines for Designing User Interface Software" the MITRE Corporation, obtained from the Internet on Nov. 25, 2004 at http://www.dfki.de/{jameson/hcida/papers/smith-mosier.pdf>, document dated Aug. 1986.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS8205150Jan 22, 2007Jun 19, 2012Cfph, LlcDocument changesUS8694881Aug 17, 2009Apr 8, 2014Cfph, LlcViewing file modificationsUS8984409 *Sep 9, 2010Mar 17, 2015Salesforce.Com, Inc.Service cloud consoleUS20110225500 *Sep 9, 2010Sep 15, 2011Salesforce.Com, Inc.Service Cloud Console* Cited by examinerClassifications U.S. Classification345/418, 715/700International ClassificationG06F17/30, G06T1/00, G09G5/00, G06F3/048, G06F3/033Cooperative ClassificationG06F3/0481European ClassificationG06F3/0481Legal EventsDateCodeEventDescriptionAug 27, 2014FPAYFee paymentYear of fee payment: 8Aug 26, 2014ASAssignmentOwner name: SAP SE, GERMANYEffective date: 20140707Free format text: CHANGE OF NAME;ASSIGNOR:SAP AG;REEL/FRAME:033625/0334Sep 2, 2010FPAYFee paymentYear of fee payment: 4Jun 9, 2003ASAssignmentOwner name: SAP AKTIENGESELLSCHAFT, GERMANYFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BRENDLE, RAINER;REEL/FRAME:013717/0614Effective date: 20030515RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services