text:
US20100287174A1 - Identifying a level of desirability of hyperlinked information or other user selectable information - Google Patents
Identifying a level of desirability of hyperlinked information or other user selectable information
US20100287174A1
US20100287174A1 US12463808 US46380809A US2010287174A1 US 20100287174 A1 US20100287174 A1 US 20100287174A1 US 12463808 US12463808 US 12463808 US 46380809 A US46380809 A US 46380809A US 2010287174 A1 US2010287174 A1 US 2010287174A1
US12463808
I-Hsuan Yang
Embodiments of methods, apparatuses, or systems relating to identifying a level of desirability of a hyperlink or search query using experience score.
The subject matter disclosed herein relates to identifying a level of desirability of at least a portion of a hyperlinked file or otherwise user-selectable information.
Finding information stored or existing in digital form, such as in the form of binary digital signals, may sometimes be a time-consuming and potentially perilous undertaking. For example, finding information on the Internet, such as by selecting a hyperlink as presented on a web page, or by inputting a search query into an online search field, may result in a user occasionally being presented with hyperlinks associated with files that may be irrelevant, offensive, or which may no longer exist. Similarly, a user may have a somewhat similar finding while searching for information in offline computer applications, such as, for example, by entering a search query into a desktop search application or by accessing a hyperlink presented in an offline document application. Thus, with so much information existing and reposed in digital form, there may be a desire to at least identify information which a user may deem to be desirable or undesirable in a more efficient or cost effective manner.
FIG. 1 is a schematic diagram illustrating a version of a displayed web page with exemplary operatively selectable hyperlinks and an exemplary search query field in accordance with an embodiment.
FIG. 2 is a flow chart depicting an embodiment of a method to identify a level of desirability of a hyperlinked file or other user selectable information, such as a proposed search query.
FIG. 3 is a schematic diagram depicting an embodiment of an exemplary apparatus to identify or estimate a level of desirability of a hyperlinked file or other user selectable information, such as a proposed search query.
FIG. 4 is a schematic diagram depicting an embodiment of an exemplary system to identify or estimate a level of desirability of a hyperlinked file or other user selectable information, such as a proposed search query.
Some portions of the detailed description which follow are presented in terms of algorithms or symbolic representations of operations on binary digital signals which may be stored within a memory of a specific apparatus or special purpose computing device or platform. In the context of this particular specification, the term specific apparatus or the like includes a general purpose computer once it is programmed to perform particular operations pursuant to instructions from program software. Algorithmic descriptions or symbolic representations are examples of techniques used by those of ordinary skill in the signal processing or related arts to convey the substance of their work to others skilled in the art. An algorithm is here, and generally, considered to be a self-consistent sequence of operations or similar signal processing leading to a desired result. In this context, operations or processing involve physical manipulation of physical quantities. Typically, although not necessarily, such quantities may take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared or otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to such signals as bits, data, values, elements, symbols, characters, terms, numbers, numerals, or the like. It should be understood, however, that all of these or similar terms are to be associated with appropriate physical quantities and are merely convenient labels. Unless specifically stated otherwise, as apparent from the following discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing,” “computing,” “calculating,” “determining” or the like refer to actions or processes of a specific apparatus, such as a special purpose computer or a similar special purpose electronic computing device. In the context of this specification, therefore, a special purpose computer or a similar special purpose electronic computing device is capable of manipulating or transforming signals, typically represented as physical electronic or magnetic quantities within memories, registers, or other information storage devices, transmission devices, or display devices of the special purpose computer or similar special purpose electronic computing device.
The terms, “and,” “and/or,” and “or” as used herein may include a variety of meanings that will depend at least in part upon the context in which it is used. Typically, “and/or” as well as “or” if used to associate a list, such as A, B or C, is intended to mean A, B, and C, here used in the inclusive sense, as well as A, B or C, here used in the exclusive sense. Reference throughout this specification to “one embodiment” or “an embodiment” or a “certain embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of claimed subject matter. Thus, the appearances of the phrase “in one embodiment” or “an embodiment” or a “certain embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in one or more embodiments. Embodiments described herein may include machines, devices, engines, or apparatuses that operate using digital signals. Such signals may comprise electronic signals, optical signals, electromagnetic signals, or any form of energy that provides information between locations.
As mentioned previously, there may be a desire to identify information which a user may deem to be desirable or undesirable in a more efficient or cost effective manner.
Currently, for example, in an Internet context, such as on the World Wide Web, one way to gauge the desirability or undesirability of a user accessing a particular hyperlinked file, such as a web page file or other like document, may be to measure a click-through rate. A click-through rate may include a quantitative measure associated with a hyperlink, which quantifies user selective access of the hyperlink (e.g., clicking on the hyperlink through a graphical user interface). Similarly, click-through rates may also be utilized to determine a desirability associated with hyperlinks for offline applications, such as for hyperlinks in document programs, such as Microsoft Word or Microsoft Excel, as non-limiting examples. In a somewhat similar manner as suggested above, a program may determine a click-thorough rate for a particular hyperlink displayed to a user in an offline application in much the same way click-through rates may be calculated for online applications.
In addition to hyperlinks, click-through rates may also be used as a desirability metric for a particular search query. For instance, in online or offline applications, a user may begin inputting a search query and in response a search engine or other program/process may present one or more proposed search queries that the user may select instead of continuing to input their own search query A user's subsequent interaction with one or more of these hyperlinks, or additional attempts to input other search queries, may be tracked by a search engine, search program, or other application, to improve or increase the relevance of search results for that particular query for a subsequent search. Thus, drawing an analogy to click-through rates, a search engine, or other program or application, may track the frequency that a particular proposed search query leads to what a user may deem to be a desirable search result.
While click-through rates may be useful to assess a desirability of a particular hyperlink or even a proposed search query, it may be an insufficient, or less effective, measure in some instances. For example, click-through rates may sometimes indicate that particular hyperlinks, which may be spam or dead links, may be more desirable than they may otherwise be if accessed by a user. To illustrate, in a search engine context—particularly on the Internet—spammed hyperlinks may be prominently displayed (e.g., highly ranked) in a list of search results returned from a search engine or program. This may result in some users accessing this hyperlink, only to find irrelevant, less relevant or even offensive information. Interestingly, since the prominence in which a particular hyperlink may be displayed may be correlated with a click-through rate, an increase in the click-through rate may result in a particular hyperlink being displayed in a more prominent position (e.g., ranked higher) than it was previously.
Another approach that may be used to identify the desirability or undesirability of a user accessing a particular hyperlink may be to use human editors to qualitatively assess the content accessible via a particular hyperlink. In one technique, human editors may input a particular search query into a search field and access one or more hyperlinks from a list of search results that may be displayed in response to a particular search query. In this approach, human editors may qualitatively assess the content and determine, based on their judgment, or other criteria, whether the content may be desirable to a user. Thus, human editors may identify, among other things, bad or dead links, irrelevant or less relevant content, or the like. In addition, human editors may also qualitatively assess the content accessed via a hyperlink for classification purposes, such as, for example, classifying certain content as “adult” or “spam” as just an example. Of course, the technique of using human editors to identify desirable information may be costly, inefficient and—given the vast quantity of information available and being created in various digital mediums—unrealistic. Accordingly, other approaches or techniques may be desired.
With these and other concerns in mind, in accordance with certain aspects of the present description, example implementations may include methods, systems, or apparatuses for identifying a level of desirability (e.g., estimating user desirability or undesirability) of a hyperlinked file or search query using an “experience score”, at least in part. For example, in an embodiment, an experience score may be generated based, at least in part, on accessing binary digital signals relating to one or more user's interaction with one or more hyperlinks or other like user selectable features/information. In another embodiment, an experience score may be generated based, at least in part, on accessing binary digital signals relating to one or more user's inputs of one or more search queries via a search field or other like user interface. In yet another embodiment, a machine learning process may, based at least in part on its training, estimate a desirability of a hyperlink or search query using one or more experience scores, which may then be used to associate with a hyperlink or search query as part of a ranking function, for example. In certain embodiments, an experience score associated with a particular hyperlink or proposed search query may be used to adjust its relevance, aid in its classification as relating to one or more particular categories of content, or may be used for a multitude of other purposes.
As used herein, an “experience score” may be based, at least in part, on at least one of a “skip rate”, a “skip score”, or a combination thereof. For example, in certain embodiments, a “skip rate” may be expressed as a score or value to be associated with a particular hyperlink or search query, where the score or value is associated with an estimated probability that a particular hyperlink or search query may be “skipped” by a user. A particular hyperlink may be considered “skipped”, for example, if within a particular period of time after selecting the hyperlink, a user acts in some manner instead to access or select another hyperlink and/or otherwise to navigate away from the hyperlink. Thus, for example, a user may select (e.g., through a graphical user interface) a hyperlink which is operatively linked to a file thought to be of interest. However, for some reason the user's experience having selected the hyperlink becomes undesirable which leads the user to navigate away (e.g., navigate back to a previous display) from the hyperlinked file. Similarly, a particular search query may be considered “skipped”, for example, if within a particular period of time after inputting the search query, a user acts in some manner instead to input or select another search query (such as search query suggested by a browser, for example). One or more metrics, such as an experience score, may be established to estimate the potential for such a change in the level of desirability of the hyperlink for a user. An experience score may be established, for example, based at least in part on measured data, and/or estimated in some manner, such as by using a machine learning process, and/or the like.
FIG. 1 may serve as a helpful illustration. Web page 100 depicts a displayed web page with exemplary search query field 110 and exemplary search results 160 thereon. In an embodiment, a user may input a search query into search query field 110 which may result in search results 160 (hyperlinks 120-150) being displayed. Here, a user may access (e.g., operatively select) a particular hyperlink, such as hyperlink 120, for example. Once accessed, a user may determine that the experience resulting from accessing hyperlink 120, may not be desirable and, as such, may selectively navigate back, or otherwise return, to web page 100. Similarly, a user may determine that the experience resulting from accessing hyperlink 120 may not be desirable and thus access another hyperlink, such as a hyperlink on displayed web page 100. A user may find the experience resulting from accessing a hyperlink undesirable because the hyperlinked file does not work properly, takes too long to render, or the content displayed may be irrelevant, as just some examples. The duration of time between a user accessing a particular hyperlink and accessing another (or otherwise navigating away), or the time between a user inputting a particular search query and inputting or selecting another, is termed herein as an “experience duration.”
In certain embodiments, to be considered a “skipped” hyperlink, an experience duration for that particular hyperlink may be lower than a threshold period of time, such as 180 seconds, for example. Thus, if a user accessed hyperlink 120 in the above example, and within 180 seconds, accessed another hyperlink, or otherwise navigated away, then hyperlink 120 may be considered skipped.
Of course, in certain embodiments, the threshold time for a particular hyperlink to be considered “skipped” may vary. For example, a longer time period may increase the number of skipped hyperlinks; whereas, a shorter time period may result in the opposite. There may be various advantages or disadvantages associated with certain experience duration thresholds, some of which will be discussed below. Suffice it to say that there may be numerous experience duration thresholds in various embodiments which may serve a variety of purposes; accordingly, claimed subject matter is not to be limited in scope to any particular experience duration threshold.
As mentioned above, an experience score may also be a “skip score.” A “skip score” may be a score or a value which reflects a composite experience duration for a particular hyperlink or search query. Accordingly, in certain embodiments, a plurality of experience durations for a particular hyperlink or a particular search query may be averaged, for example, to determine a “skip score.” Skip rate and skip score, including the various ways they may be determined, and the various factors they may include, will be explained in more detail below. Here, however, it is worth noting that there are a variety of different approaches or techniques to calculate probabilities associated with skip rates and/or composite values, such as an average associated with skip score, which may take into account many different factors. Accordingly, so as to not obscure claimed subject matter, only a few exemplary approaches or techniques will be discussed. Thus, the scope of claimed subject matter is not to be limited to these exemplary approaches or techniques.
FIG. 2 is a flow chart depicting an exemplary embodiment of a method to identify a level of desirability of a hyperlink or search query using an experience score. At block 210, a user may input a search query into a search field via a graphical user interface, such as search query field 110 in FIG. 1. Here, a graphical user interface (GUI) may refer to a program interface that utilizes displayed graphical information to allow a user to control, operate, or otherwise interface with, a special purpose computing platform, for example, and/or other computing platforms, such as platforms which may be networked with a special purpose computing platform, or other devices.
At block 220, in response to a user's input of a search query at block 210, a set of search results, such as hyperlinks 160 in FIG. 1, may be displayed. Of course, in this exemplary embodiment, hyperlinks may be displayed to a user as a set of search results. In certain embodiments, however, one or more hyperlinks may exist in online or offline applications, documents, files, or the like, which may or may not be displayed to a user in response to a user request or as a set of search results. Thus, hyperlinks may be found in a documents program, on a desktop, or on a web page, as just a few non-limiting examples.
At block 230, a search engine, program, or other application or apparatus may track one or more user's interactions with one or more hyperlinks or search queries. For example, as suggested previously in the context of click-through rates, a user's interactions with a hyperlink or search query may be tracked and compiled. This information may be used in substantially real-time, and/or compiled in a database for later use or analysis. Of course, due to the various environments where hyperlinks or search query fields may be found, a wide range of applications, programs, or apparatuses may operate at the client or server level to track or compile this information, for example. A search engine, program, or other application or apparatus may track a user's interaction with a hyperlink or dynamically provided proposed search queries to compile information which may be utilized to determine an experience duration, such as tracking the period of time a user spends on a web page after accessing a particular hyperlink, for example.
At block 240, user interaction information, such as previously described at block 230, may be accessed. At block 250, based at least partially on this information, one or more processes or apparatuses may generate one or more experience scores. In general, experience scores may be generated for search queries, hyperlinks and/or, search query/hyperlink pairs. That is, in various embodiments, one or more experience scores may be generated for a search query, for a hyperlink, or for a search query/hyperlink pair. Some of these various embodiments will be discuss in more detail below; first, however, more discussion of determining skip rates and skip scores is provided.
As mentioned previously, in an embodiment, a skip rate may be associated with score or value that may reflect the probability that a particular hyperlink or search query may be skipped in the future. While there are many ways to determine a probability, one way may be to determine a probability may be to determine a ratio for the number of instances a particular hyperlink or search query has been skipped relative to the number of instances it may be accessed, selected, or inputted. For example, returning briefly to FIG. 1, hyperlink 120 may have been accessed 100 times and may have been skipped 30 of those times. In short, the experience duration was less than a threshold amount for 30 out of the 100 times hyperlink 120 has been accessed. Accordingly, hyperlink 120 may receive a 30% skip rate. Of course, the number of times a hyperlink as been accessed, or skipped, may also vary by a period of time. For example, a skip rate may be determined based on user interactions over a particular day, week, year, etc. Thus, the probability that a particular hyperlink may be skipped may be determined for any particular of time. In an embodiment, hyperlinks with a skip rate greater than or equal to 80% may generally be considered undesirable, as just an example. A skip rate may be determined for a search query in a similar manner as just described.
Likewise, in certain embodiments, hyperlinks less frequently accessed by users may be filtered out to reduce noise. For example, in an embodiment, a skip rate may not be determined for hyperlinks or search queries which may be accessed or inputted less than 60 times in a day period. One rationale behind this approach may be to spend program resources on hyperlinks or search queries which users more frequently access or input, as just an example.
Similarly, at block 250, one or more processes or apparatuses may also determine a skip score. In an embodiment, a composite experience duration for a particular hyperlink or search query may be determined. In certain embodiments, a composite experience duration may be an average value, such as a mean, median or mode value, for a plurality of experience durations over a period of time. Returning briefly to FIG. 1 to illustrate, assume hyperlink 120 has been accessed 100 times in a particular day. An experience duration for at least some, or all, of the 100 times hyperlink 120 has been accessed may be tracked or compiled. A process or apparatus may access this information and determine an average experience duration for hyperlink 120. For example, a skip score for hyperlink 120 may be 40 seconds, as just an example. In addition, similar to a skip rate, a skip score may be determined based on user interaction information for any particular period of time (e.g., an hour, a day, historically, etc). In an embodiment, hyperlinks with a skip score less than or equal to 30 seconds may be considered undesirable, as just an example.
Also, in an embodiment, in order to avoid bias, experience durations exceeding a particular quantity of time may be disregarded in connection with determining a composite value for a skip score. For example, in an embodiment, a “cutoff” value may be established, such as 180 seconds, where experience durations exceeding this cutoff value do not factor into a skip score determination. One rationale behind this approach may be that, since distributions of skip scores tend to be long tail, longer experience durations, such as experience durations exceeding 180 seconds, for example, may result in a less accurate composite value. This may not be the case, however, in other embodiments. For example, in certain embodiments, a composite value for a skip score may not disregard experience duration values. Accordingly, in these embodiments, a composite value for a skip score may factor in any or all experience durations.
Skip score and skip rate are believed to reflect a desirability of a user accessing a particular hyperlinked file or inputting a particular search query for numerous similar and/or dissimilar reasons. For example, both skip score and skip rate may be relatively effective measures of content quality or content relevance. However, it is believed that skip rate, in particular, may better reflect the presence of undesirable content, such as spam, or dead links, for example. It is also believed that skip score, in particular, may better reflect the presence of adult content, for example. Of course, these characteristics may change based on myriad factors, such as values associated with noise or bias filtering, the period of time that user interaction information was compiled or tracked, and/or the method of computation. Accordingly, the above examples or illustrations are merely exemplary and the scope of claimed subject matter is not to be limited to any particular example or illustration.
As mentioned previously, one or more experience scores may be generated for search queries, hyperlinks and/or, search query/hyperlink pairs. To illustrate, suppose a process, apparatus or system has access to the following sample data set: <Query, document/file, experience score>. Here, for sake of simplicity in this illustration, further assume that the above experience score is skip rate information. Thus, a sample data set may appear as:
query 1, hyperlink 1, skipped
query 1, hyperlink 2, not-skipped
query 2, hyperlink 3, skipped
query 2, hyperlink 3, non-skipped
In an environment where the skip score is generated with regard to a search query, the following experience scores may be generated based on the above sample data set: query 1-total 2, skipped 1=0.5 skip rate; query 2-total 2, skipped 1=0.5 skip rate. Similarly, in an environment where the skip score is generated with regard to a document/file, the following experience scores may be generated based on the above sample data set: hyperlink 1-total 1, skipped 1=1 skip rate; hyperlink 2-total 1, skipped 0=0 skip rate; hyperlink 3-total 2, skipped 1=0.5 skip rate. Next, in an environment where the skip score is generated with regard to a paring, the following experience scores may be generated based on the above sample data set: query 1, hyperlink 1-total 1, skipped 1=1 skip rate; query 1, hyperlink 2-total 1, skipped 0=0 skip rate; query 2, hyperlink 3-total 2, skipped 1=0.5 skip rate.
While skip rates and skip scores may be used to show a desirability, they may also be useful to compare a particular hyperlink, search query, or pairing with other hyperlinks, search queries, or pairings. For example, in the above illustration for a search query/hyperlink pairing, it may be seen that for query 1: hyperlink 1 is associated with a 1 skip rate and hyperlink 2 is associated with a 0 skip rate. Thus, comparing hyperlink 1 and 2 for query 1, it may be evident that hyperlink 2 is a more desirable link for query 1, since it is associated with a lower skip rate. Similarly, this comparison may also be performed for a search query. For example, assume search query 1 is associated with a skip rate of 0.5 and query 2 is associated with a skip rate of 1.0. Here, it may be evident that query 1 is more desirable than query 2 since it is associated with a lower skip rate. In an embodiment, search query comparisons such as just described may be useful in a “try also” application, where a search engine, program, or apparatus suggests particular search terms in response to a user inputting a search query.
In addition, at block 250, a composite experience score may be generated for a particular hyperlink which may factor in both a skip rate and a skip score. For example, in certain embodiments, a skip rate and a skip score may be combined, such as skip scores associated with search query/hyperlink pairs, to form a composite experience score. While there may be several approaches to combine one or more experience scores, one approach may be to use a metric produced by a linear regression technique. This approach is described in more detail below.
At block 260, an experience score may be associated with one or more particular hyperlinks or search queries. Here, associating an experience score means that an experience score may be utilized in connection with a particular hyperlink to perform a function. For example, in certain embodiments, an experience score may be associated with a particular hyperlink to adjust its relevance, to classify it as relating to a particular category of content, or for a multitude of other purposes.
To illustrate, returning again to FIG. 1, assume an experience score associated with hyperlink 140 may show that hyperlink 140 may be undesirable. In an embodiment, a search engine, program or other application, may utilize an experience score associated hyperlink 140 to adjust its relevance, such as by removing it from search results 160 or demoting it relative to search results 120, 130 or 150, for example. Similarly, an experience score associated with hyperlink 140 may show that hyperlink 140 may be desirable. Thus, hyperlink 140 may be promoted relative to search results 120 or 130, for example. Accordingly, in an embodiment, a search engine, program or other application may serve or otherwise display experience score adjusted search results, such as depicted by the dashed line in FIG. 1.
Continuing the illustration, assume an experience score associated with hyperlink 140 may show that it may relate a particular category of content. In an embodiment, a search engine, program or other application may utilize an experience score associated with hyperlink 140 to classify it as relating to one or more categories of content, such as relevant content, less relevant content, irrelevant content, adult content, spam content, or dead or non-existent link, for example.
In addition, in certain embodiments, one or more experience scores generated for a particular hyperlink may be associated with that hyperlink. In other embodiments, however, one or more experience scores generated for a particular hyperlink may be associated with one or more other hyperlinks. This may occur, for example, where an experience score generated for a particular hyperlink, such as a parent URL, may be associated with another hyperlink, such as a subordinate URL of the parent URL. This, of course, is merely an example.
FIG. 3. a schematic diagram depicting an embodiment 300 of an apparatus to identify or estimate a desirability of a hyperlink or search query using experience score. Here, apparatus 300 may include a special purpose computing platform, such as a specific client device, and/or the like. Here, apparatus 300 depicts a special purpose computing platform that may include one or more processors, such as processor 310. Furthermore, apparatus 300 may include one or more memory devices, such as storage device 320, memory unit 330, or computer readable medium 250. In addition, apparatus 300 may include one or more network communication adapters, such as network communication adaptor 360. Apparatus 300 may also include a communication bus, such as communication bus 370, operable to allow one or more connected components to communicate under appropriate circumstances.
In an example embodiment, communication adapter 360 may be operable to receive or transmit signals relating to a user's interaction with one or more hyperlinks or search queries, such as by communicating with network 450 in FIG. 4, for example. In addition, as non-limiting examples, communication adapter 360 may be operable to send or receive one or more signals corresponding to an experience score for one or more hyperlinks or search queries.
In an example embodiment, experience score generator/estimator 340 may be operable to perform one or more processes previously described, such as one or more process depicted in FIG. 2. For example, experience score generator/estimator 340 may by operable to access signals relating to a user's interaction with one or more hyperlinks or search queries, generate one or more experience scores, or associate one or more experience scores with one or more hyperlinks or search queries, as non-limiting examples.
In certain embodiments, apparatus 300 may be operable to transmit or receive information relating to, or used by, one or more process or operations, such as one or more processes mention previously, via communication adapter 360, computer readable medium 350, and/or have stored some or all of such information on storage device 320, for example. As an example, computer readable medium 350 may include some form of volatile and/or nonvolatile, removable/non-removable memory, such as an optical or magnetic disk drive, a digital versatile disk, magnetic tape, flash memory, or the like. In certain embodiments, computer readable medium 350 may have stored thereon computer-readable instructions, executable code, and/or other data which may enable a computing platform to perform one or more processes or operations mentioned previously.
In certain example embodiments, apparatus 300 may be operable to store information relating to, or used by, one or more operations mentioned previously, such as signals relating to a user's interaction with one or more hyperlinks or search queries, or signals relating to one or more experience scores, in memory unit 330 and/or storage device 320. It should, however, be noted that these are merely illustrative examples and that claimed subject matter is not limited in this regard. For example, information stored or processed, or operations performed, in apparatus 300 may be performed by other components or devices depicted or not depicted in FIG. 3. To illustrate, operations which may be performed by experience score generator/estimator 340 may be performed by processor 310 in certain embodiments. Furthermore, operations performed by components or devices in apparatus 300 may be performed in distributed computing environments where one or more operations may be performed by remote processing devices which may be linked via a communication network.
In certain embodiments, apparatus 300 may be trained, such as with a machine learning process (e.g., linear regression machine learning technique) to estimate a desirability of a hyperlink or search query. For example, in an embodiment, an apparatus, or program capable of being executed by an apparatus, may be trained based at least in part on user interaction information, such as described previously; additionally or alternatively, an apparatus, or program capable of being executed by an apparatus, may be trained based at least in part on information provided by human editors. In certain instances, an apparatus, or program capable of being executed by an apparatus may estimate a desirability of a particular hyperlink or search query without accessing information provided by human editors. That is, an en embodiment, desirability judgments typically made by human editors may be made automatically based on a learned program or apparatus.
To illustrate, in an embodiment, an apparatus may first be trained on hyperlinks or search queries judged by human editors. Assume, for sake of example, that human editors reviewed a sampling of hyperlinks or search queries, say 13,000 or so, which they judged on a scale, say a desirability scale of 1-5 (with 5 being the highest). Editors may be judging pages for desirability based on some of the characteristics described previously, such as bad links, adult content, etc. In addition, assume that for at least a portion of these hyperlinks or search queries, that one or more experience scores, such as described previously, was generated. For example, in certain embodiments, an apparatus, or program capable of being executed by an apparatus may accesses a search query/hyperlink pairing with their associated skip rate, skip score and editor judgment. Here, by using a linear regression machine learning technique, for example, an apparatus or program may determine which skip scores and skip rates were associated with undesirable search query/hyperlink pairs by human editors. Thus, in certain embodiments, this linear regression may produce a metric which may be applied to search query/hyperlink pairs for which human editorial judgments may not have been made.
In an embodiment, an apparatus, or program capable of being executed by an apparatus, trained based at least in part on human editor judgments for a set of hyperlinks or search queries, such as described above, may estimated a desirability of one or more hyperlinks or search queries. There are numerous ways to do this, which may take into account many different factors or characteristics of hyperlinks or search queries. One way to do this, for example, may be based on the metric produced by the linear regression technique described previously. For example, in certain embodiments, this metric may be the following: Experience scores=−1.1384 (skip rate)+0.0057 (skip score)+2.8492. Here, desirability may be estimated by skip rate and skip score using this metric to produce a composite experience score. In addition, in an embodiment, the quantity 2.8492 may be useful to adjust an experience score into the 1-5 scale judged by human editors. In an embodiment, a composite experience score less than or equal to 2.35 may be considered undesirable, as just an example.
Alternatively, in an embodiments, where this quantity is omitted (e.g., experience score=−1.1384 (skip rate)+0.0057 (skip score)), this metric may be useful for generating composite experience scores which may be used for comparison. For example, in a search query/hyperlink pairing context, a plurality of pairings may be associated with composite experience scores. These scores may be compared as between pairs to determine which pairs are better relative to others; in general, the higher the composite experience score, the more desirable that particular pairing may be in comparisons to the other pairs. These, of course, are merely examples of ways in which a trained apparatus or program may estimate a desirability or perform a comparison.
FIG. 4. is a schematic diagram depicting an embodiment of a system to identify or estimate a desirability of a hyperlink or search query using experience score. In system 400, a computing platform 410 may be communicatively coupled to network 440. Here, in this example, computing platform 410 may be a computing platform associated with one or more users, such as a client device which may be utilized to communicatively couple to network 440. Thus, for example, a user may input a search query or access a hyperlink via a GUI that may be transmitted via computing platform 410 and network 440 to search engine 430.
System 400 may also include experience score generator/estimator 420. Experience score generator/estimator 420, which may be associated with search engine 430, for example, may be communicatively coupled to network 350. Additionally or alternatively, experience score generator/estimator 420 may be communicatively coupled directly to, or be incorporated into, search engine 430 in various embodiments. Experience score generator/estimator 420, in this example, may access signals relating to a users' interaction with one or more hyperlinks or search queries from computing platform 410, search engine 430, or from another device or programs which may be communicatively coupled to network 440. In certain embodiments, experience score generator/estimator 420 may access or have stored thereon signals relating to one or more users' interaction with one or more hyperlinks or search queries, or other information associated with experience score generation, as non-limiting examples. In addition, in certain embodiments, experience score generator/estimator 420 may access or have stored thereon signals relating to human judged hyperlinks or search queries, or other information associated with experience score generation, as non-limiting examples. Experience score generator/estimator 420 may transmit information to, or receive information from, one or more computing platforms communicatively coupled to network 440, such as computing platform 410, search engine 430, or other devices, for example.
In certain embodiments, experience score generator/estimator 420 may be operable to transmit signals via network 440 to search engine 430, or computing platform 410, which may then enable search engine 430 or computing platform 410 to perform one or more process or operations previously described, such as generating an experience score, associating an experience score with a hyperlink or search query, estimating an experience score, or performing other operations or process. For example, experience score generator/estimator 420 may transmit signals relating to one or more experience scores which may be associated with a particular hyperlink or search query. This may enable search engine 430 or computing platform 410 to perform one or more operations, such as suggest one or more search terms, adjust relevancy of one or more hyperlinks, or perform classification operations, as non-limiting examples. Accordingly, in this example, search engine 430 or computing platform 410 may be capable of storing or transmitting signals associated with one or more operations performed to other devices, such as devices which may be communicatively coupled to network 440.
Various embodiments may have a variety of advantages. For example, in an embodiment, an experience score associated with a document/file may show a desirability of that document/file and/or allow a comparison of that document/file against one or more other documents/files. This, for example, may be advantageous for classification and desirability purposes, which may increase search result success and decrease a user's search time and effort.
Similarly, another advantage of an embodiment may be that an experience score associated with a search query may show a desirability of that search query and/or allow a comparison of that search query against one or more other search queries. This may allow a search engine, for example, to construct more efficient and robust navigational query classifiers and to list improved “try also” suggestions, as just some examples.
accessing binary digital signals; said binary digital signals relating to one or more user's interaction with one or more hyperlinks or search queries via a graphical user interface; and
generating at least one experience score, based, at least in part, on said binary digital signals, to be associated with said one or more hyperlinks or search queries.
associating said at least one experience score with said one or more hyperlinks or search queries, wherein said at least one experience score identifies a desirability, at least in part, of a user interacting with said one or more hyperlinks or search queries.
3. The method of claim 2, wherein said associating said at least one experience score with said one or more hyperlinks comprises identifying one or more hyperlinks as undesirable based, at least in part, on a composite experience score associated with said one or more hyperlinks.
4. The method of claim 2, wherein said associating said at least one experience score with said one or more hyperlinks comprises classifying said one or more hyperlinks as relating to one or more categories of content.
5. The method of claim 4, wherein said classifying said one or more hyperlinks as relating to one or more categories of content comprises classifying said one or more hyperlinks as at least one of the following: relevant content, less relevant content, irrelevant content, adult content, spam content, dead or non-existent link, or any combination thereof.
6. The method of claim 2, further comprising displaying said one or more hyperlinks or search queries to a user; said one or more hyperlinks or search queries being experience score adjusted hyperlinks or search queries.
displaying on a special purpose computing platform a set of search results comprising one or more hyperlinks; said one or more hyperlinks being associated with an experience score.
8. The method of claim 7, further comprising, prior to said displaying, adjusting a relevancy of at least one hyperlink of said one or more hyperlinks in said set of search results based, at least in part, on an associated experience score.
9. The method of claim 8, wherein said adjusting a relevancy of at least one hyperlink of said one or more hyperlinks comprises promoting or demoting said at least one hyperlink in said set of set of search results based, at least in part, on an associated experience score.
a special purpose computing platform; said computing platform further comprising:
a storage medium having instructions stored thereon; said storage medium, if said instructions are executed, further instructing said computing platform to generate at least one experience score to be associated with one or more hyperlinks or search queries.
11. The apparatus of claim 10, wherein said experience score comprises at least one of the following: a skip rate, a skip score, or a combination thereof.
12. The apparatus of claim 10, wherein said special purpose computing platform comprises a computing platform communicatively coupled to one or more databases storing, at least in part, binary digital signals relating to one or more previous users' interaction with one or more hyperlinks.
13. The apparatus of claim 10, wherein said special purpose computing platform comprises a server; wherein said server is communicatively coupled to a network of servers.
14. The apparatus of claim 13, wherein said network of servers comprises at least a part of an Internet.
15. An article comprising: a storage medium comprising instructions stored thereon which, if executed by a specific computing platform, are adapted so as to enable said specific computing platform to generate at least one experience score to be associated with one or more hyperlinks or search queries.
estimating an experience score for one or more hyperlinks or search queries via an automated experience score estimator process;
using said experience score for said one or more hyperlinks or search queries as part of a ranking function.
17. The method of claim 16, wherein prior to said estimating, training said automated experience score estimator process, at least in part, within training information using a machine learning technique.
18. The method of claim 17, wherein said training information comprises information based, at least in part, on a set of human judged hyperlinks or information based, at least in part, on a set of human judged search queries.
19. The method of claim 17, wherein said training information comprises information based, at least in part, on experience scores previously generated for a set of hyperlinks or a set of search queries.
20. The method of claim 16, wherein said using said experience score for said one or more hyperlinks or search queries as part of a ranking function further comprises adjusting a relevancy for said one or more hyperlinks or search queries.
US12463808 2009-05-11 2009-05-11 Identifying a level of desirability of hyperlinked information or other user selectable information Abandoned US20100287174A1 (en)
US12463808 US20100287174A1 (en) 2009-05-11 2009-05-11 Identifying a level of desirability of hyperlinked information or other user selectable information
US20100287174A1 true true US20100287174A1 (en) 2010-11-11
ID=43062964
US12463808 Abandoned US20100287174A1 (en) 2009-05-11 2009-05-11 Identifying a level of desirability of hyperlinked information or other user selectable information
US (1) US20100287174A1 (en)
US9015152B1 (en) 2011-06-01 2015-04-21 Google Inc. Managing search results
US20040220915A1 (en) * 2003-05-02 2004-11-04 Kline Scott B. Detection of improper search queries in a wide area network search engine
US20090132517A1 (en) * 2007-11-19 2009-05-21 Blakely Sokoloff Taylor & Zafman LLP Socially-derived relevance in search engine results
US7912836B2 (en) * 2004-11-22 2011-03-22 Truveo, Inc. Method and apparatus for a ranking engine
US7836048B2 (en) * 2007-11-19 2010-11-16 Red Hat, Inc. Socially-derived relevance in search engine results
US7822742B2 (en) * 2008-01-02 2010-10-26 Microsoft Corporation Modifying relevance ranking of search result items
US9594809B2 (en) * 2010-01-28 2017-03-14 Karl Muth System and method for compiling search results using information regarding length of time users spend interacting with individual search results
Shen et al. 2005 Implicit user modeling for personalized search
US8543907B1 (en) 2013-09-24 Context-sensitive optimization level selection
US20080126411A1 (en) 2008-05-29 Demographic prediction using a social link network
US8065296B1 (en) 2011-11-22 Systems and methods for determining a quality of provided items
US20100293179A1 (en) 2010-11-18 Identifying synonyms of entities using web search
US7991206B1 (en) 2011-08-02 Surrogate heuristic identification
US20130159507A1 (en) 2013-06-20 Systems and methods for influence of a user on content shared via 7 encoded uniform resource locator (url) link
Adar et al. 2009 Resonance on the web: web dynamics and revisitation patterns
US20120197732A1 (en) 2012-08-02 Action-aware intent-based behavior targeting
US8370282B1 (en) 2013-02-05 Image quality measures


text:
1662 Book of Common Prayer: Daily Prayer: Morning Prayer: September 24th, Seventeen Sunday After Trinity
Morning Prayer: September 24th, Seventeen Sunday After Trinity
Then shall follow the Psalms in order as they be appointed. [Psalms 116-118]. And at the end of every Psalm throughout the year, and likewise at the end of Benedicite, Benedictus, Magnificat, and Nunc dimittis, shall be repeated,

type: global

value: Blogger is an American online content management system (CMS) which enables multi-user blogs with time-stamped entries. Pyra Labs developed it before being acquired by Google in 2003.


text:
readyforbusking: April 2012
Posted by readyforbusking at 1:52 AM No comments:
Posted by readyforbusking at 1:35 AM No comments:
This is the last night in Graz and it's still raining so I have time to write on the blog about What is worth to visit in Vienna in my opinion.:)
If you just want to walk around you can start from the center(Stephansplatz). In the center there is a huge, beautiful, gothic cathedral,Stephansdom . You will meet in the main walking street with many street artists with different kind of perfomances (spray paintings, puppet show, music and so on).
The whole park belongs to the newest part of Vienna, called Donau City. It's like a future city from 2050. Maybe for other Western-Europeans it's not a big deal to see skycrapers and such modern structures but for me, being an Eastern-European, it's like being in a sci-fi movie.:P
Posted by readyforbusking at 1:21 PM No comments:
These days I 've been trying to find informations about busking in Munich, but what I found it was outdated(like 2007), and it seemed that the law is really strict.
Today while we were searching couch in Munich, we recieve an answer and a nice girl sent us a link about busking laws in Munich. It seems kinda hard how it works and how they give the permission(day by day? or they giving you a date when you can sing a month later?).
For holidays it's different and it doesn't mention any free places...
But here is the link where you can see clearer: busking law in Munich (first pdf)
Posted by readyforbusking at 2:49 PM 3 comments:
Graz, an Italian city in Austria
In the center of the city you need a permit to play. They have a quite clear system for it. You have to go to a certain place at the last monday of any month and you have to pay some money for it. They give a limited numer of permits so the performers go there earlier and wait in a long line. If you go to a policemen he can give you the exact data where and when to go.
So the final conclusion about Vienna is that it's a huge city full of possibilities and if you are good and lucky enough you can make a lot of money:P
Posted by readyforbusking at 2:02 AM 8 comments:
It's raining but that doesn't stop us :)
Yesterday we went to Albertina (a Museum close to Stephansplatz) And saw an exibition of Impressionism and much more. :P After that we went to Stadtpark and found a better place to play until the rain started, but that didn't stop us:P And the photo is the proof of it :)
Posted by readyforbusking at 5:57 AM No comments:
The first days in Vienna
Two days ago we arrived in Vienna. We found a place to stay for the whole week through Couchsurfing. It's a really good site and a brilliant idea to make your trip cheaper. I recommend sending as many couchrequest as you can and as soon as you know where you want to go (around a week before). This way I think you have a bigger chance of finding a couch.
We actually got lucky cause somebody(Sabine) offered us a whole flat where we can stay for a week.In the begining the weather seemed good but yesterday it was really cold and rainy and Valentin got a cold too (I hope it's nothing serious). Today is a lot warmer, but the busking is not as succesful as yesterday.
Though the weather was bad we managed to make close to 30 euros in an hour but we couldn't play more cause our shoses got really wet. The place where we played called Karlsplatz. One of our friends showed us the place. The best time to play there is between 12.00-15.00 and maybe 17.00-19.00.
Playing in Stadtpark
We tried Stadtpark too. It's a nice park in the center and a lot of kids are playing there with their parents. We played next to the bridge. It wasn't that bad but could've been better :P
Next week when we'll get to Graz we'll write more clear cause unfortunately we don't have internet in Vienna and the free wifis are slow.
Posted by readyforbusking at 6:17 AM No comments:
Yesterday and today we finally tried our luck at busking in Szeged. It wasn't at all bad as we expected since it's a small city. Actually it's, from what we can tell, as good or almost as good as Budapest, given that the average amount we made in the two days was 2000 huf/hour(7 euros).
Here is the first video that we made. Sorry for the relatively low sound quality but I was a bit far.
Posted by readyforbusking at 12:07 PM No comments:
Labels: Bremen, Hungary, Szeged, videos
Posted by readyforbusking at 11:13 PM No comments:
Posted by readyforbusking at 1:54 AM No comments:


text:
Patent US6973571 - System, apparatus, and method for performing cryptographic validity services - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Advanced Patent Search | Sign inAdvanced Patent SearchPatentsEmbodiments of the present invention described and shown in the specification and drawings facilitate electronic authentication services for banking and other industries. Authentication services, often using Public Key Infrastructure (PKI) technology, are used to confirm the identity of the sender of...http://www.google.com/patents/US6973571?utm_source=gb-gplus-sharePatent US6973571 - System, apparatus, and method for performing cryptographic validity servicesPublication numberUS6973571 B2Publication typeGrantApplication numberUS 09/897,450Publication dateDec 6, 2005Filing dateJul 3, 2001Priority dateJul 3, 2001Fee statusPaidAlso published asUS20030009665, WO2003005282A2, WO2003005282A3Publication number09897450, 897450, US 6973571 B2, US 6973571B2, US-B2-6973571, US6973571 B2, US6973571B2InventorsElizabeth L. Lee, Phillip R. SchlesingerOriginal AssigneeBank Of America CorporationPatent Citations (35), Non-Patent Citations (1), Referenced by (7), Classifications (19), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetSystem, apparatus, and method for performing cryptographic validity servicesUS 6973571 B2Abstract Embodiments of the present invention described and shown in the specification and drawings facilitate electronic authentication services for banking and other industries. Authentication services, often using Public Key Infrastructure (PKI) technology, are used to confirm the identity of the sender of data and to ensure that the data that was received is identical to the data that was sent. Embodiments of the present invention provide authentication services that may be used by a variety of configurations of entities requesting data authentication and entities responding to those requests. Embodiments of the present invention also support compatibility with commercial data authentication standards, integration with third-party data authentication software such as Secude (for Identrus access), and systems to control data authentication risks.
BACKGROUND OF THE INVENTION This invention relates to electronic transaction applications, and more particularly to systems, methods, and apparatuses that use Public Key Infrastructure (PKI) techniques to authenticate electronic signatures.
DESCRIPTION OF THE RELEVANT ART The business of electronic authentication services has generally been structured by a Trust Model. The Trust Model typically involves participants with four Trust Roles. These roles are Subscribing Customer, Relying Customer, Relying Participant, and Issuing Participant.
The Relying Customer is an entity that desires to determine whether a digital certificate in question was used to sign a specific item of data and if the digital certificate itself is valid. The activity of determining whether a digital certificate was used to sign a specific item of data and if the digital certificate itself is valid is referred to herein as �cryptographic validity services� or �authentication.�
SUMMARY OF THE INVENTION Embodiments of the present invention described and shown in the specification, claims, and drawing facilitate the provision of cryptographic validity services for banking and other industries. Some embodiments of the present invention provide authentication services through an application programming interface to a Relying Customer Service Engine that is coupled to a Relying Participant Service Engine. Embodiments of the present invention also provide configurable risk-control, compatibility with commercial Identrus standards (Identrus is controlled by Identrus LLC, 140 East 45th Street, 16th Floor, New York, N.Y. 10017), and integration with third-party software such as Secude (manufactured by SECUDE Sicherhreitstechnologie, Informationssysteme Gmbh, DovivostraBell, 0-64293, Darnstade, Germany) for Identrus access.
DETAILED DESCRIPTION Interpretation of Terms
6. Configuration Data. In embodiments of the present invention, Configuration Data comprises information for configuring the operation of the invention. Configuration Data may be provided to an entity of the present invention through an external source, for example using the System API described below or as an external data file, or Configuration Data may be built into the entity, for example as a configuration module as is know in the art. As used in this specification, the term �entity� refers to any object that may be placed in communication with any other object, and comprises, for example, persons, organizations, logical structures, physical structures, computer systems, and program modules. In some embodiments where the present invention comprises one or more entities in communication with other entities (within or outside the systems of the present invention), via computer communications networks such as the Internet, the Configuration Data may comprise, for example and as is known in the art:
13. System API. In some embodiments of the present invention, a System Application Programming Interface (API) provides a predefined set of functions for initializing and terminating the operation of the Relying Customer Service Engine of the present invention, and for recording status information for financial audits, billing, and maintenance. As is known in the art, an API is said to be �exposed� when entities external to the entity containing the API are able to make use of the API. For example, in some embodiments depicted in FIG. 6, System API 603 is contained in the Relying Customer Service Engine 402 portion of Validation Services Platform 401. Validation Services Platform 401 exposes System API 603 to Relying Customer Software Application 501. Relying Customer Software Application 501 uses, as is known in the art, System API 603 to control and configure Relying Customer Service Engine 402 via the Control and Configure Service 601 path.
DETAILED DESCRIPTION Acts performed by systems, methods, apparatus elements, and apparatus functions of the present invention may be implemented, as is known in the art, as software running on general purpose computers or special purpose computers, as hardware, or as combinations of software and hardware.
Base64PKCS7�The PKCS7 signature in the same BASE64 String format output by the Identrus ISIL or the Identrus Plugin.
SignedData�A byte array containing the data alleged to have been signed by the PKCS7.
IDENTRUS�VALIDATION�VERSION Version Number of this IdentrusValidation Class. SIGNATURE�VALIDITY PKCS7 Signature IS/IS NOT valid as determined by this Relying Participant. SIGNATURE�DATA�STATUS PKCS7 Signature DOES/NOT match this data. SIGNING�CERT�STATUS Status of the Signing Cert. CA�1�CERT�STATUS Status of the First CA Cert in this chain. CA�n�CERT�STATUS Status of the Nth CA Cert in this chain. SIGNING�CERT�DN Distinguished Name of the Signing Cert. SIGNING�CERT�SERIAL�NO Serial Number of the Signing Cert SIGNING�CERT�ISSUER DN of Issuer. SIGNING�CERT�NOT�VALID�BEFORE First Validity Date SIGNING�CERT�NOT�VALID�AFTER Last Validity Date
SIGNATURE�IS�VALID Returned if Signature is Valid. Otherwise �NO�;
CERTIFICATE�GOOD Certificate is good. CERTIFICATE�UNRECOGNIZED Certificate contains unrecognized content or format. CERTIFICATE�NO�RESPONSE Information not currently available. CERTIFICATE�REVOKED Certificate has been revoked. CERTIFICATE�UNKNOWN Certificate is unknown to the responder.
SIGNATURE�DATA�MATCH Signature matches the data. Otherwise �NO�;
Public void policy(Properties pstatus, byte[ ] pkcs7, byte[ ] SignedData); } The method �policy� is provided a Java Properties object containing all of the known information about the Digital Signature, Digital Certificates and Signed Data. The value for SIGNATURE�IS�VALID must be returned in the Properties object. Any additional values placed into the Properties object will also be returned to the Relying Customer Software Application that invoked the Information API.
The constructor takes a single argument, the Configuration Properties File that, in some embodiments, is supplied by the Relying Participant. This Java Properties file contains configuration specific values such as the Domain Name Server (�DNS�) location of the Relying Participant's validation service, etc.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4879747Mar 21, 1988Nov 7, 1989Leighton Frank TMethod and system for personal identificationUS4995081Nov 6, 1989Feb 19, 1991Leighton Frank TMethod and system for personal identification using proofs of legitimacyUS5016274Nov 8, 1988May 14, 1991Silvio MicaliOn-line/off-line digital signingUS5276737Apr 20, 1992Jan 4, 1994Silvio MicaliFair cryptosystems and methods of useUS5315658Apr 19, 1993May 24, 1994Silvio MicaliFair cryptosystems and methods of useUS5351302May 26, 1993Sep 27, 1994Leighton Frank TMethod for authenticating objects identified by images or other identifying informationUS5420927Feb 1, 1994May 30, 1995Micali; SilvioMethod for certifying public keys in a digital signature schemeUS5499296Aug 22, 1994Mar 12, 1996Micali; SilvioNatural input encryption and method of useUS5519778Sep 26, 1994May 21, 1996Silvio MicaliMethod for enabling users of a cryptosystem to generate and use a private pair key for enciphering communications between the usersUS5537475Feb 1, 1994Jul 16, 1996Micali; SilvioEfficient digital signature algorithm and use thereof technical fieldUS5610982May 15, 1996Mar 11, 1997Micali; SilvioCompact certification with threshold signaturesUS5615269Feb 22, 1996Mar 25, 1997Micali; SilvioIdeal electronic negotiationsUS5629982Aug 20, 1996May 13, 1997Micali; SilvioSimultaneous electronic transactions with visible trusted partiesUS5638447May 15, 1996Jun 10, 1997Micali; SilvioCompact digital signaturesUS5666414Mar 21, 1996Sep 9, 1997Micali; SilvioGuaranteed partial key-escrowUS5666416Nov 16, 1995Sep 9, 1997Micali; SilvioCertificate revocation systemUS5666420Nov 18, 1996Sep 9, 1997Micali; SilvioSimultaneous electronic transactionsUS5677952 *Dec 6, 1994Oct 14, 1997International Business Machines CorporationMethod to protect information on a computer storage deviceUS5717759Jan 31, 1997Feb 10, 1998Micali; SilvioMethod for certifying public keys in a digital signature schemeUS5747759Oct 25, 1996May 5, 1998Behr Gmbh & Co.Control unit for vehicle climate controlUS5790665Jan 17, 1997Aug 4, 1998Micali; SilvioAnonymous information retrieval system (ARS)US5793868Nov 5, 1996Aug 11, 1998Micali; SilvioCertificate revocation systemUS5812670Feb 28, 1996Sep 22, 1998Micali; SilvioTraceable anonymous transactionsUS5963649Dec 17, 1996Oct 5, 1999Nec CorporationMessage authorization system for authorizing message for electronic documentUS6028933 *Apr 17, 1997Feb 22, 2000Lucent Technologies Inc.Encrypting method and apparatus enabling multiple access for multiple services and multiple transmission modes over a broadband communication networkUS6065120 *Dec 9, 1997May 16, 2000Phone.Com, Inc.Method and system for self-provisioning a rendezvous to ensure secure access to information in a database from multiple devicesUS6158003Mar 1, 1999Dec 5, 2000E-Stamp CorporationMethod and system for electronic document certificationUS6173400Jul 31, 1998Jan 9, 2001Sun Microsystems, Inc.Methods and systems for establishing a shared secret using an authentication tokenUS6185684Aug 28, 1998Feb 6, 2001Adobe Systems, Inc.Secured document access control using recipient listsUS6618789 *Apr 6, 2000Sep 9, 2003Sony CorporationSecurity memory card compatible with secure and non-secure data processing systemsUS6636892 *Jun 15, 2000Oct 21, 2003Lv Partners, L.P.Method for conducting a contest using a networkUS6654831 *Mar 7, 2000Nov 25, 2003International Business Machine CorporationUsing multiple controllers together to create data spansUS6754214 *Jul 19, 1999Jun 22, 2004Dunti, LlcCommunication network having packetized security codes and a system for detecting security breach locations within the networkUS6826711 *Feb 13, 2001Nov 30, 2004Avamar Technologies, Inc.System and method for data protection with multidimensional parityUSRE35808Sep 12, 1995May 26, 1998Bankers Trust CompanyFair cryptosystems and methods of use* Cited by examinerNon-Patent CitationsReference1Kline, Charles S., et al. "Digital Signatures: Principles and Implementations," Journal of Telecommunication Networks, pp. 61-81.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS7234158Apr 1, 2002Jun 19, 2007Microsoft CorporationSeparate client state object and user interface domainsUS7296183 *Jan 23, 2004Nov 13, 2007Microsoft CorporationSelectable data field consistency checkingUS7360092 *Apr 28, 2003Apr 15, 2008Microsoft CorporationMarking and identifying web-based authentication formsUS7437551Apr 2, 2004Oct 14, 2008Microsoft CorporationPublic key infrastructure scalability certificate revocation status validationUS7853652 *Jan 18, 2003Dec 14, 2010International Business Machines CorporationInstant messaging system with privacy codesUS8238727 *Jun 3, 2005Aug 7, 2012The Nielsen Company (Us), LlcMethods and apparatus to detect a time-shift event associated with the presentation of media contentUS20090290852 *Jun 3, 2005Nov 26, 2009David Howell WrightMethods and apparatus to detect a time-shift event associated with the presentation of media content* Cited by examinerClassifications U.S. Classification713/168, 705/67, 705/70, 713/170, 713/169International ClassificationH04L29/06, G06F21/00Cooperative ClassificationG06Q20/3674, H04L63/08, H04L63/04, G06F21/31, G06Q20/108, H04L2463/102, G06F2221/2115European ClassificationG06F21/31, H04L63/04, G06Q20/108, H04L63/08, G06Q20/3674Legal EventsDateCodeEventDescriptionMar 18, 2013FPAYFee paymentYear of fee payment: 8May 6, 2009FPAYFee paymentYear of fee payment: 4Oct 22, 2001ASAssignmentOwner name: BANK OF AMERICA CORPORATION, NORTH CAROLINAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LEE, ELIZABETH L.;SCHLESINGER, PHILLIP R.;REEL/FRAME:012270/0953Effective date: 20011015RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google

value: Google Patents is a search engine from Google that indexes patents and patent applications.


text: Sports & Outdoors Sports Fan Shop Clothing Fan Shop > Refine Price $ to $ Go Top brands Rico Industries Franklin Franklin Sports Store availability Sort Best sellers Price: low to high Price: high to low Highest rating New $22.22 List price $29.99 Save $7.77 Team Golf NHL Winnipeg Jets Golf Umbrella Free shipping on orders over $50 Free store pickup $32.86 - $44.99 Franklin Sports NHL Kid's Team Set, Tampa Bay Lightning Free shipping on orders over $50 Free store pickup $4.58 List price $9.99 Save $5.41 SkootZ Wristband, Winnipeg Jets Free shipping on orders over $50 Free store pickup $33.99 Winnipeg Jets Trifold Wallet Sold & Shipped by SportsFanfare $39.99 Winnipeg Jets Umbrella Free shipping on orders over $50 Free store pickup 1 Showing 5 of 5 results Departments Accessories Fan Shop Bags Fan Shop Clothing Fan Shop Jewelry Fan Shop Shipping & Pickup Show all Ship to Home FREE Pickup Sports Team St. Louis Cardinals Chicago Cubs San Francisco Giants Detroit Tigers New York Yankees Green Bay Packers Dallas Cowboys Pittsburgh Steelers Alabama Crimson Tide Baltimore Orioles Denver Broncos Indianapolis Colts Iowa Hawkeyes North Carolina Tar Heels Oakland Raiders Golden State Warriors Boston Red Sox Florida Gators Cleveland Cavaliers Carolina Panthers See more sports teams Category Golf Umbrellas Umbrellas Wallets Sports League NHL Brand Rico Industries Franklin Franklin Sports Skootz Team Golf See more brands Color Blue Black Green Multi Other See more colors Price $ to $ Go $0 - $10 $10 - $15 $15 - $20 $20 - $25 $25 - $50 $50+ Retailer Walmart.com SportsFanfare Popular in Clothing Fan Shop Dress Shoes ST. Louis Cardinals Accessories Dodgers Stone Rings MLB Clothing Mets Baseball Accessories NCAA Apparel Infinity Scarves Compute- app-11030446-8-54868077, DC- prod-dfw3, ENV- prod-a, Ver- 38.0.0, SHA- 997f0b296e5bc4a29aa0e320fda98e6239de69d7, Log- a2ef0688-3c25-1546c42d845000 Site Information Be the first to save! Email Address Sign up Privacy policy Stay connected Mobile apps Help Feedback MoneyCenter Privacy & Security CA Privacy Rights Terms of Use Financial Services Walmart MoneyCenter Walmart Credit Card Apply Now Manage Card Account Product Care Plans Walmart Pay Get to Know Us About Walmart.com Corporate Suppliers Marketplace Careers @Walmartlabs Walmart.com Terms of Use About Our Ads Affiliate Program CA Privacy Rights Privacy & Security Customer Service Returns Policy Product Recalls Int'l Customers Tax Exempt Program Contact Us Feedback In the Spotlight Mother's Day Expand Fitness Exercise Machines Vitamins Ellipticals Treadmills Expand Spring Cleaning Storage Containers Garage Storage Storage Sheds Expand International Sites Argentina Brazil Canada Chile China Japan Mexico United Kingdom © Walmart Stores, Inc. To ensure we’re able to help you as best we can, please include your reference number: Ref:

value: Walmart Inc. ( ; formerly Wal-Mart Stores, Inc.) is an American multinational retail corporation that operates a chain of hypermarkets (also called supercenters), discount department stores, and grocery stores from the United States, headquartered in Bentonville, Arkansas.


text:
Donna Alward, Romance Author: The Construction Zone 13 - Editing
Now you've finished your first draft, and you're incredibly relieved. The bones of your story are down. You've reached the end.
Now it's time to fix and polish so it's ready to send.
The way I used to edit is very different from the way I edit now. Honestly I think it's a skill that's developed over time. The more you write, the better you become, the more you can tell what's working and what's not. What I used to consider "edits" is now more of a polishing stage.
When I edit, I get to the end and if there are scenes that need to be added, I go back and add them where I think they need to be. Once I've done that, I start at the beginning and work my way through. I look for certain things...is my hero strong. Is my conflict solid. I layer a lot. This means I add physical and emotional beats. By the end of the story, I usually have a handful of motivation and conflict layers that I didn't exploit enough in the first half, so the bulk of my layering goes there. This is where my dialogue gets fleshed out so that the scene is fully set.
When I finish a book now, I'm usually a good 4-7k off for word count. During edits and layering, I add 3-5k. I've learned that I send a book in a little short and once my editor is finished with it, I feel like it's tighter and I've cut a bunch of stuff and I end up solidly in the middle of the 5k spread for word count - right on the money.
Once you've gone through and fixed what needs fixing - keeping focus on the romance, making sure the pace is fluid and keeps moving, and that your characters have behaved in the appropriate way for their character and arc, you do a polishing round.
When you polish, you should be looking for repetitive words, repetitive actions, grammar and spelling mistakes, the odd sentence that just seems to fit. This is about prettying up your ms, because now all the heavy work is done.
The best advice I can give is DON'T BE AFRAID TO EDIT. Don't let the delete key scare you. Be brave and do what needs to be done. If you get to a point where you're thoroughly sick of the manuscript or just can't see anymore what needs to be changed, it's time to let an editor have a go.
Next up - sending it off! Queries, synopses, and partials.
Posted by Donna Alward at 2:19 PM


text:
35 results in Home & Garden
This page was last updated: 18-Jul 09:29. Number of bids and bid amounts may be slightly out of date. See each listing for international postage options and costs.

value: eBay Inc. ( EE-bay) is an American multinational e-commerce corporation based in San Jose, California, that facilitates consumer-to-consumer and business-to-consumer sales through its website.


text:
Patent US5953929 - Modular refrigeration unit - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign in<nobr>Advanced Patent Search</nobr>PatentsA refrigeration system includes a base having an inlet opening, an outlet opening, an evaporator pan, a condenser pan, and a compressor mounting surface all integrally formed therein. All of the components of the refrigeration system mount onto the base to from a unitary structure. An evaporator is mounted...http://www.google.com/patents/US5953929?utm_source=gb-gplus-sharePatent US5953929 - Modular refrigeration unitAdvanced Patent SearchPublication numberUS5953929 APublication typeGrantApplication numberUS 09/075,659Publication dateSep 21, 1999Filing dateMay 11, 1998Priority dateMay 11, 1998Fee statusLapsedAlso published asUS6070424, WO1999058914A1Publication number075659, 09075659, US 5953929 A, US 5953929A, US-A-5953929, US5953929 A, US5953929AInventorsJeffrey E. Bauman, Kennard C. Hildreth, III, Johnie J. Cooper, Michael J. Palladino, J. Thomas JablonskyOriginal AssigneeBauman; Jeffrey E., Hildreth, Iii; Kennard C., Cooper; Johnie J., Palladino; Michael J., Jablonsky; J. ThomasExport CitationBiBTeX, EndNote, RefManPatent Citations (2), Referenced by (21), Classifications (18), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetModular refrigeration unitUS 5953929 AAbstract A refrigeration system includes a base having an inlet opening, an outlet opening, an evaporator pan, a condenser pan, and a compressor mounting surface all integrally formed therein. All of the components of the refrigeration system mount onto the base to from a unitary structure. An evaporator is mounted to the base above said evaporator pan. A condenser is mounted to said base above said condenser pan. A compressor mounted to the compressor mounting surface and operatively connected to said evaporator and said condenser. A cover encloses the inlet opening, outlet opening and evaporator. The cover and base include an integral locking mechanism to secure the cover to the base.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5417079 *Jul 14, 1994May 23, 1995The Coca-Cola CompanyModular refrigeration apparatusUS5678421 *Dec 26, 1995Oct 21, 1997Habco Beverage Systems Inc.Refrigeration unit for cold space merchandiser* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6070424 *Mar 3, 1999Jun 6, 2000Victory Refrigeration Company, L.L.C.Modular refrigeration unitUS6155065 *Dec 30, 1997Dec 5, 2000Carrier CorporationEvaporator coil support for a room air conditionerUS6279333Mar 14, 2000Aug 28, 2001Industry Heating And Cooling, Inc.Mobile industrial air cooling apparatusUS6381972Feb 17, 2000May 7, 2002Hussmann CorporationMultiple zone refrigerationUS6578376Jan 31, 2002Jun 17, 2003Matt Alvin ThurmanRefrigeration apparatus and associated methodsUS6615593Jan 31, 2002Sep 9, 2003Matt Alvin ThurmanMethods of reducing energy and maintenance costs associated with a refrigeration systemUS6701739Jun 12, 2002Mar 9, 2004Tecumseh Products CompanyModular refrigeration system for refrigeration applianceUS6957547Sep 17, 2003Oct 25, 2005Delphi Technologies, Inc.Variable capacity condensing unitUS7162882Dec 21, 2004Jan 16, 2007Carrier CorporationMulti-band air curtain separation barrierUS7234320Feb 24, 2006Jun 26, 2007Habco Beverage Systems Inc.Modular refrigeration unit and refrigeratorUS7251954Oct 20, 2003Aug 7, 2007Habco Beverage Systems Inc.Modular refrigeration unit and refrigeratorUS7444832 *May 10, 2005Nov 4, 2008Bsh Home Appllances CorporationCooling appliance with circulated air cooling and cooling air injectionUS7681409Sep 1, 2005Mar 23, 2010Hill Phoenix, Inc.Curtain air admission assemblyUS7874168 *Dec 27, 2005Jan 25, 2011Electrolux Home Products Corporation N.V.Modular refrigeration unit and process for assembling a modular refrigeration unit to a cabinet of a refrigeration applianceUS8522565 *Oct 19, 2010Sep 3, 2013The Veracity Group, Inc.Refrigerator with removable cooling unitUS20110126570 *May 19, 2009Jun 2, 2011Aktiebolaget ElectroluxCold applianceUS20130305770 *May 18, 2012Nov 21, 2013Whirlpool CorporationIce delivery method for modular cooling systemCN101922839A *Aug 5, 2010Dec 22, 2010杭州银都餐饮设备有限公司Front-installed integral refrigerating system module of horizontal refrigeratorCN102740741BNov 22, 2010Jul 30, 2014开利公司冷藏柜除霜水蒸发WO2010112294A2 *Mar 4, 2010Oct 7, 2010BSH Bosch und Siemens Hausger�te GmbHHousehold refrigerator and refrigeration apparatus for a household refrigeratorWO2011100011A1 *Nov 22, 2010Aug 18, 2011Carrier CorporationRefrigerated case defrost water evaporation* Cited by examinerClassifications U.S. Classification62/259.1, 62/272, 62/298, 62/440, 62/237, 62/279, 62/407, 62/448International ClassificationF25D21/14, F25D19/00Cooperative ClassificationF25D2321/1412, F25D2317/0665, F25D2321/143, F25D21/14, F25D2317/0655, F25D19/00European ClassificationF25D21/14, F25D19/00Legal EventsDateCodeEventDescriptionNov 18, 2003FPExpired due to failure to pay maintenance feeEffective date: 20030921Sep 22, 2003LAPSLapse for failure to pay maintenance feesApr 9, 2003REMIMaintenance fee reminder mailedMay 11, 1998ASAssignmentOwner name: VICTORY REFRIGERATION COMPANY, L.L.C., NEW JERSEYFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BAUMAN, JEFFREY E.;HILDRETH, KENNARD C., III;COOPER, JOHNIE J.;AND OTHERS;REEL/FRAME:009161/0988Effective date: 19980511RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google


text:
American Made – Rifling Through The Marketing Messages | Elyria Fence's Blog
Previous Should my posts be set in concrete?
Jeff Lancour
Dec 10, 2012 @ 15:05:11
Congratulations on your effort to buy American. As an American manufacturer of fencing equipment and products it’s important for the customer to know they can have American quality and still get a good price.

value: WordPress (WP, WordPress.org) is a free and open-source content management system (CMS) written in PHP and paired with a MySQL or MariaDB database. Features include a plugin architecture and a template system, referred to within WordPress as Themes.


text:
Patent US7260774 - Method & system for enhanced web page delivery - Google Patentsuche
A system for and method of enhancing web page delivery. The invention provides the ability to control redirection of Web traffic of humans and search engine spiders. It can differentiate between these types of visitors to a Web page, track their movements, log critical information, and analyze the Web...http://www.google.de/patents/US7260774?utm_source=gb-gplus-sharePatent US7260774 - Method & system for enhanced web page delivery
Veröffentlichungsnummer US7260774 B2
Auch veröffentlicht unter US8701016, US20020038350, US20060248452, WO2001084351A2, WO2001084351A3
Veröffentlichungsnummer 09845575, 845575, US 7260774 B2, US 7260774B2, US-B2-7260774, US7260774 B2, US7260774B2
Patentzitate (10), Nichtpatentzitate (1), Referenziert von (34), Klassifizierungen (11), Juristische Ereignisse (15)
US7739592 * 10. Nov. 2005 15. Juni 2010 International Business Machines Corporation Delivery, organization, and management of data capture elements
US7765276 * 16. Juni 2006 27. Juli 2010 Ntt Docomo, Inc. Communication apparatus and browser switching method
US8452865 6. März 2008 28. Mai 2013 Google Inc. System and method for reporting website activity based on inferred attribution methodology
US8458604 6. Juli 2009 4. Juni 2013 Fairwinds Partners Llc Methods and apparatus for determining website validity
US8533297 * 15. Mai 2012 10. Sept. 2013 Facebook, Inc. Setting cookies in conjunction with phased delivery of structured documents
US8595691 * 7. Juni 2010 26. Nov. 2013 Maxymiser Ltd. Method of website optimisation
US8630972 * 21. Juni 2008 14. Jan. 2014 Microsoft Corporation Providing context for web articles
US9348923 * 6. Nov. 2013 24. Mai 2016 International Business Machines Corporation Software asset management using a browser plug-in
US9489178 19. Nov. 2013 8. Nov. 2016 Maxymiser Ltd. Method of website optimisation
US20060288083 * 16. Juni 2006 21. Dez. 2006 Ntt Docomo, Inc. Communication apparatus and browser switching method
US20070106687 * 10. Nov. 2005 10. Mai 2007 International Business Machines Corporation Delivery, organization, and management of data capture elements
US20070136255 * 22. Nov. 2006 14. Juni 2007 Ineomarketing, Inc. System and method for generating, maintaining, and rendering landing and web pages
US20090319449 * 21. Juni 2008 24. Dez. 2009 Microsoft Corporation Providing context for web articles
US20100313183 * 7. Juni 2010 9. Dez. 2010 Maxymiser Ltd. Method of Website Optimisation
US20110004850 * 6. Juli 2009 6. Jan. 2011 Philip Michael Lodico Methods and apparatus for determining website validity
US20120191691 * 7. Apr. 2009 26. Juli 2012 Robert Hansen Method for assessing and improving search engine value and site layout based on passive sniffing and content modification
US20120226785 * 15. Mai 2012 6. Sept. 2012 Changhao Jiang Setting Cookies in Conjunction with Phased Delivery of Structured Documents
US20140149585 * 6. Nov. 2013 29. Mai 2014 International Business Machines Corporation Software asset management using a browser plug-in
US-Klassifikation 715/234, 707/E17.119
Internationale Klassifikation G06Q30/00, G06F15/00, G06F17/30
Unternehmensklassifikation G06F17/30899, G06F17/3089, G06Q30/02


text:
Ruby's Life: The Way of the Pencil
wow! your son is VERY talented :) I went to his blog and saw some of his work. thanks for letting us know about his work... you must be VERY PROUD!!!
I wondered who had done that drawing- I think I asked you! I checked out his blog- what talent! You must be so proud of him.
He does such nice work, he is so talented!


text:
Công Việc Set wikipedia server, Thuê | Freelancer
Set wikipedia server
Bạn cần tìm công việc hoặc người trong lĩnh vực Set wikipedia server?
Cần giúp đỡ với Set wikipedia server? Thuê một freelancer ngay hôm nay! Bạn có chuyên về Set wikipedia server? không? Hãy sử dụng kĩ năng Set wikipedia server? của bạn và bắt đầu kiếm tiền trực tuyến ngay hôm nay! Freelancer là thị trường công việc lớn nhất trên thế giới. Hiện tại có 17.764 công việc đang đợi bạn đặt giá!
Công việc Set wikipedia server:
Need a Doctor's Profile on Wikipedia...! Required : 1. Unique Content for Wikipedia. 2. Create or Update the Wikipedia Page (Login Details Required) 3. Ensure Wikipedia's Notability Guidelines. 4. Crafting a page to adhere to Wiki's Neutral Point of View. 5. Ultimately Posting and Updating the page 2 Article Writing, Wikipedia, Soạn thảo nội dung Jun 22, 2018 Hôm nay6n 22g $23
Wikipedia article Someone with experience with Wikipedia who will write, submit and followup with Wikipedia on article publishing. An initial draft was already made... only when the arrival get published , this project will conceded complete .. 26 Viết quảng cáo, Article Writing, Wikipedia Jun 22, 2018 Hôm nay6n 19g $174
Build server residential proxy Hi , Mình cần dựng 1 server dạng residential để làm thành 1 sll socks5 , Chi tiết có thể trao đổi qua chat với mình nha Chỉ làm việc với người việt thôi vì ta mình ko rành sợ nói ko hiểu kỹ vấn đề 2 Linux, Lập trình C++ Jun 21, 2018 Jun 21, 20185n 17g $930
Need Experienced Wikipedia Topic/Information Article Poster As mentioned above need someone highly expert in editing/posting articles on Wikipedia to post information about few pages. More details will be shared with bidding professionals in this task. Bid if you did posted articles on Wikipedia successfully previously and I will interview you. Only bid if you know their acceptance criteria and information required. Will provide articles and do necessary c... 9 Blog, Article Writing, Tìm kiếm web, Đăng báo, Wikipedia Jun 20, 2018 Jun 20, 20184n 23g $138
Free lance to make wikipedia page I need find somebody make a wikipedia page from an paintman. Is like a gift for him. 5 WIKI, Wikipedia Jun 19, 2018 Jun 19, 20184n 5g $276
Moodle Set-up & Migration Looking for a Moodle expert who can execute a migration project, upload training records from Lotus notes and set up the system to host and track both F2F training events and e-learning. 18 PHP, MySQL, HTML, Quản trị cơ sở dữ liệu, Moodle Jun 19, 2018 Jun 19, 20184n 5g $39
Set up fulfillment by Amazon Hi, this Job is posted for freelance residing in the USA only due to time zoning, If you are not in the USA kindly do not wast your bid. I need to set up an Amazon Store and have the Amazon do part of the fulfillment and I will do the other part of the fulfillment. I have the name and Logo of the business and all banking requirements. 9 Thiết kế trang web, Thiết kế đồ họa Jun 19, 2018 Jun 19, 20183n 21g $292
Need a professional in publishing Wikipedia pages Hi i need my Wikipedia pages published. I will share the details with the shortlisted candidates. Thanks 10 Biên tập, Xuất bản, WIKI, Wikipedia, Soạn thảo nội dung Jun 19, 2018 Jun 19, 20183n 19g $66
Wikipedia Articles, Press Articles, Blog Articles. We are looking for Writers for - Content Wrting Press Article Writing Wikipedia Writing and Uploading 10 Article Writing, Wikipedia, Soạn thảo nội dung Jun 19, 2018 Jun 19, 20183n 13g $113
Move CPanel Accounts in WHM to new Server and Test We are looking for a freelancer with experience with Cpanel/WHM and servers to take care of migrating 10 - 12 Cpanel accounts on WHM to WHM on another server. You must test each domain after transferring and adjust php ini settings and server settings as needed to ensure each account works correctly. Each cpanel account has a Wordpress site so experience with Wordpress may be beneficial for bug ... 56 PHP, Linux, Quản lý website, Web Hosting Jun 18, 2018 Jun 18, 20183n 9g $107
Need a professional in publishing Wikipedia pages Hi i need my Wikipedia pages published. I will share the details with the shortlisted candidates. Thanks 4 Biên tập, Xuất bản, WIKI, Wikipedia, Soạn thảo nội dung Jun 18, 2018 Jun 18, 20183n 1g $170
Set Openstack up 1-	The server has installed Centos 7 and OpenStack (Pike) on it. After 4 months working very well, the RAIDs were deleted by mistake, so now after rebuild the RAIDs when the server starts doesn’t find the RAIDs. I set the RAIDs in the same order. Therefore OpenStack needs to be set up with these new RAIDs. 4 Quản trị hệ thống, Linux, UNIX, Quản trị mạng Jun 18, 2018 Jun 18, 20182n 22g $197
Wikipedia Page Creation and Filing Good Contents. I need a Wikipedia Page Creation and Adding Good Content on it. I need you to design and build my Page. I am an Actor and now making my Debut in Bollywood. 8 WIKI, Tạo Blog, Wikipedia Jun 18, 2018 Jun 18, 20182n 17g $149
Content for My Wikipedia Page and Website. I need you to write Good content for My website & Wikipedia page. I am making My debut In Bollywood Industry and want a Best Content for both Wikipedia Page and My website with Good SEO Keywords. 13 Viết sáng tạo, Soạn thảo nội dung, SEO Writing Jun 18, 2018 Jun 18, 20182n 17g $167
Game Server İnstallation Articles Hi , Steps : 1-)Make a website 2-)designing for the site 3-)Think idea for logo/Create Logo 4-)Vds ( virtual dedicated server) or Vps ( virtual private server) obtain 5-)article writing(illustrated) 6-) Search engine optimization purchase 7-)advertising on the site and fianlly 8-)"income generation" Project Owner : Muhammed Melih ARSLAN 3 Blog, Article Writing, Templates, SEO Writing, Writing Jun 17, 2018 Jun 17, 20182n $115
Wikipedia Page Publish and Create Create and publish a wikipedia page for an Artist. 29 Viết quảng cáo, Xuất bản, Article Writing, Wikipedia Jun 17, 2018 Jun 17, 20181n 21g $191
Help me set up a FiveM server You will need to be able to set up a FiveM server with server side and ensure files are correct and working with what we require. Please contact me if you have any further question 0 Freelance Jun 17, 2018 Jun 17, 20181n 19g -
Set up my LCP Tracker and guild me in the proper use of the program. I am a small painting company that some time do work for the different cities. 1 Giữ sổ kế toán Jun 16, 2018 Jun 16, 201820g 22t $25
I am working on a research project. I am using the Linux system biomix. The research has been done before and the professors have given me their program and codes to set up and rerun it. 2nd step is bringing different features of my choice or create a new feature based off of their features evaluated. 2nd part will bring the whole research on transmembrane helix helix interaction. 1st part. Which is the best classifier and why. Using their data to reproduce the data and then pursue a specific area 1. Setting the Computing environment is what I have been doing 2. Th... 12 Perl, Lập trình C, Python, Linux, UNIX Jun 15, 2018 Jun 15, 2018Đã kết thúc $478
Logo for indie game studio I need a new logo in vector format the game studio name is Ghost roots don't use a font if you don't have the rights ! you can post multiple entries Some logos that I think is cool : [login to view URL] [login to view URL] [login to view URL] 35 Thiết kế đồ họa, Thiết kế logo Jun 6, 2018 Jun 6, 20183n 19g $40
Thuê những Freelancer Set wikipedia server hàng đầu:
set proxy server, wikipedia server, set email server, set mail server ubuntu, set vpn server, set game server, set vpn server debian, set freelancer server, set smtp server, set dns server, set vlc server linux, linux set proxy server, set hosting server, install wikipedia server, set lion server, set dimdim server, set proxy server pdf, set mail server ec2, set smtp server windows 2003, set mail server freebsd, set smtp server windows server 2003, set smtp server bugzilla3, set report server windows 2003, set mail server windows 2003, server set windows server 2013, set mail server php, set project server 2013, set ldap server ubuntu, set proxy server vps windows server, set exchange server 2013, freelancer Set wikipedia server

value: Freelance (sometimes spelled free-lance or free lance), freelancer, or freelance worker, are terms commonly used for a person who is self-employed and not necessarily committed to a particular employer long-term. Freelance workers are sometimes represented by a company or a temporary agency that resells freelance labor to clients; others work independently or use professional associations or websites to get work.


text:
Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms. (Book, 1970) [WorldCat.org]
I thought you might be interested in this item at http://www.worldcat.org/oclc/230879 Title: Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms. Author: Dieter Harms; Karl Lennert Publisher: Berlin, New York, Springer-Verlag, 1970. OCLC:230879
Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms.
Dieter Harms; Karl Lennert
Rate -- Congrès comme sujet.
Deutscher Hämatologenkongress (14th : 1969 : Kiel).
(OCoLC)599699209
Find more information about: Dieter Harms Karl Lennert
xix, 455 pages illustrations
Add tags for "Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms.". Be the first.
<http://www.worldcat.org/oclc/230879> # Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms.
library:oclcnum "230879" ;
library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/3902224495#Place/berlin_new_york> ; # Berlin, New York
schema:about <http://experiment.worldcat.org/entity/work/data/3902224495#Topic/rate_congres_comme_sujet> ; # Rate--Congrès comme sujet
schema:alternateName "Spleen; structure, function, pathology, clinical aspects, therapy" ;
schema:contributor <http://viaf.org/viaf/2945223> ; # Dieter Harms
schema:creator <http://experiment.worldcat.org/entity/work/data/3902224495#Meeting/deutscher_hamatologenkongress_14th_1969_kiel> ; # Deutscher Hämatologenkongress (14th : 1969 : Kiel)
schema:exampleOfWork <http://worldcat.org/entity/work/id/3902224495> ;
schema:isSimilarTo <http://www.worldcat.org/oclc/599699209> ;
schema:name "Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms." ;
schema:productID "230879" ;
schema:publication <http://www.worldcat.org/title/-/oclc/230879#PublicationEvent/berlin_new_york_springer_verlag_1970> ;
schema:publisher <http://experiment.worldcat.org/entity/work/data/3902224495#Agent/springer_verlag> ; # Springer-Verlag
wdrs:describedby <http://www.worldcat.org/title/-/oclc/230879> ;
<http://experiment.worldcat.org/entity/work/data/3902224495#Agent/springer_verlag> # Springer-Verlag
<http://experiment.worldcat.org/entity/work/data/3902224495#Meeting/deutscher_hamatologenkongress_14th_1969_kiel> # Deutscher Hämatologenkongress (14th : 1969 : Kiel)
schema:location <http://experiment.worldcat.org/entity/work/data/3902224495#Place/kiel> ; # Kiel)
schema:name "Deutscher Hämatologenkongress (14th : 1969 : Kiel)" ;
<http://experiment.worldcat.org/entity/work/data/3902224495#Place/berlin_new_york> # Berlin, New York
<http://experiment.worldcat.org/entity/work/data/3902224495#Place/kiel> # Kiel)
<http://experiment.worldcat.org/entity/work/data/3902224495#Topic/rate_congres_comme_sujet> # Rate--Congrès comme sujet
schema:name "Rate--Congrès comme sujet" ;
schema:name "Spleen" ;
<http://viaf.org/viaf/2945223> # Dieter Harms
schema:name "Dieter Harms" ;
<http://www.worldcat.org/oclc/599699209>
rdfs:label "Milz." ;
schema:isSimilarTo <http://www.worldcat.org/oclc/230879> ; # Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms.
<http://www.worldcat.org/title/-/oclc/230879>
schema:about <http://www.worldcat.org/oclc/230879> ; # Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms.
<http://www.worldcat.org/title/-/oclc/230879#PublicationEvent/berlin_new_york_springer_verlag_1970>
schema:location <http://experiment.worldcat.org/entity/work/data/3902224495#Place/berlin_new_york> ; # Berlin, New York
schema:organizer <http://experiment.worldcat.org/entity/work/data/3902224495#Agent/springer_verlag> ; # Springer-Verlag
Die Milz; Strukter, Funktion, Pathologie, Klinik, Therapie. The spleen; structure, function, pathology, clinical aspects, therapy. Editores: Karl Lennert [und] Dieter Harms./Dieter Harms; Karl Lennert;; Berlin, New York, Springer-Verlag, 1970.

value: WorldCat 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:
A steam train takes passengers on a scenic five-hour journey through the San Juan National Forest and along the Animas River
On select rides, a guide shares stories about the railroad's conception and construction, as well as the science behind the old-fashioned techniques that are still used to maintain the train today. Cars range from photo-friendly open-air gondolas to private coaches outfitted with Victorian furnishings. For an even more authentic experience, the railroad offers cab rides. And during the holiday season's Polar Express, the train's chefs, conductor, and North Pole denizens bring Chris Van Allsburg's classic children's book to meticulously detailed life. Customer Reviews

value: Groupon is an American global e-commerce marketplace connecting subscribers with local merchants by offering activities, travel, goods and services in 15 countries. Based in Chicago, Groupon was launched there in November 2008, launching soon after in Boston, New York City and Toronto.