The present disclosure relates to the field of computers, and specifically to the use of databases in computers. Still more particularly, the present disclosure relates to a context-based database.
A database is a collection of data. Examples of database types include relational databases, graph databases, network databases, and object-oriented databases. Each type of database presents data in a non-dynamic manner, in which the data is statically stored.
A processor-implemented method, system, and/or computer program product derives and utilizes a context object to generate a synthetic context-based object. A context object for a non-contextual data object is derived by contextually searching a document that contains multiple instances of the non-contextual data object. The non-contextual data object is associated with the derived context object to define a synthetic context-based object, where the non-contextual data object ambiguously relates to multiple subject-matters, and where the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object. The synthetic context-based object is then associated with at least one specific data store in a data structure, where the at least one specific data store holds data that is associated with data contained in the non-contextual data object and the context object, and where the data structure contains heterogeneous data stores that hold data of different formats as compared to one another. A dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects is then constructed for handling requests for data stores.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including, but not limited to, wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing. In one embodiment, instructions are stored on a computer readable storage device (e.g., a CD-ROM), which does not include propagation media.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the present invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
With reference now to the figures, and in particular to
Exemplary computer 102 includes a processor 104 that is coupled to a system bus 106. Processor 104 may utilize one or more processors, each of which has one or more processor cores. A video adapter 108, which drives/supports a display 110, is also coupled to system bus 106. System bus 106 is coupled via a bus bridge 112 to an input/output (I/O) bus 114. An I/O interface 116 is coupled to I/O bus 114. I/O interface 116 affords communication with various I/O devices, including a keyboard 118, a mouse 120, a media tray 122 (which may include storage devices such as CD-ROM drives, multi-media interfaces, etc.), a printer 124, and external USB port(s) 126. While the format of the ports connected to I/O interface 116 may be any known to those skilled in the art of computer architecture, in one embodiment some or all of these ports are universal serial bus (USB) ports.
As depicted, computer 102 is able to communicate with a software deploying server 150, using a network interface 130. Network interface 130 is a hardware network interface, such as a network interface card (NIC), etc. Network 128 may be an external network such as the Internet, or an internal network such as an Ethernet or a virtual private network (VPN).
A hard drive interface 132 is also coupled to system bus 106. Hard drive interface 132 interfaces with a hard drive 134. In one embodiment, hard drive 134 populates a system memory 136, which is also coupled to system bus 106. System memory is defined as a lowest level of volatile memory in computer 102. This volatile memory includes additional higher levels of volatile memory (not shown), including, but not limited to, cache memory, registers and buffers. Data that populates system memory 136 includes computer 102's operating system (OS) 138 and application programs 144.
OS 138 includes a shell 140, for providing transparent user access to resources such as application programs 144. Generally, shell 140 is a program that provides an interpreter and an interface between the user and the operating system. More specifically, shell 140 executes commands that are entered into a command line user interface or from a file. Thus, shell 140, also called a command processor, is generally the highest level of the operating system software hierarchy and serves as a command interpreter. The shell provides a system prompt, interprets commands entered by keyboard, mouse, or other user input media, and sends the interpreted command(s) to the appropriate lower levels of the operating system (e.g., a kernel 142) for processing. Note that while shell 140 is a text-based, line-oriented user interface, the present invention will equally well support other user interface modes, such as graphical, voice, gestural, etc.
As depicted, OS 138 also includes kernel 142, which includes lower levels of functionality for OS 138, including providing essential services required by other parts of OS 138 and application programs 144, including memory management, process and task management, disk management, and mouse and keyboard management.
Application programs 144 include a renderer, shown in exemplary manner as a browser 146. Browser 146 includes program modules and instructions enabling a world wide web (WWW) client (i.e., computer 102) to send and receive network messages to the Internet using hypertext transfer protocol (HTTP) messaging, thus enabling communication with software deploying server 150 and other computer systems.
Application programs 144 in computer 102's system memory (as well as software deploying server 150's system memory) also include a synthetic context-based object library logic (SCBOPL) 148. SCBOPL 148 includes code for implementing the processes described below, including those described in
The data storage system 152 stores an electronic data structure, which may be audio files, video files, website content, text files, etc. In one embodiment, computer 102 contains the synthetic context-based object database described herein, while data storage system 152 contains the non-contextual data object database, context object database, and data structure described herein. For example, in one embodiment, synthetic context-based object database 202 depicted in
Note that the hardware elements depicted in computer 102 are not intended to be exhaustive, but rather are representative to highlight essential components required by the present invention. For instance, computer 102 may include alternate memory storage devices such as magnetic cassettes, digital versatile disks (DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present invention.
Note that SCBOPL 148 is able to generate and/or utilize some or all of the databases depicted in the context-based system referenced in
With reference now to
Within system 200 is a synthetic context-based object database 202, which contains multiple synthetic context-based objects 204a-204n (thus indicating an “n” quantity of objects, where “n” is an integer). Each of the synthetic context-based objects 204a-204n is defined by at least one non-contextual data object and at least one context object. That is, at least one non-contextual data object is associated with at least one context object to define one or more of the synthetic context-based objects 204a-204n. The non-contextual data object ambiguously relates to multiple subject-matters, and the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object.
Note that the data in the context objects are not merely attributes or descriptors of the data/objects described by the non-contextual data objects. Rather, the context objects provide additional information about the non-contextual data objects in order to give these non-contextual data objects meaning Thus, the context objects do not merely describe something, but rather they define what something is. Without the context objects, the non-contextual data objects contain data that is meaningless; with the context objects, the non-contextual data objects become meaningful.
For example, assume that a non-contextual data object database 206 includes multiple non-contextual data objects 208r-208t (thus indicating a “t” quantity of objects, where “t” is an integer). However, data within each of these non-contextual data objects 208r-208t by itself is ambiguous, since it has no context. That is, the data within each of the non-contextual data objects 208r-208t is data that, standing alone, has no meaning, and thus is ambiguous with regards to its subject-matter. In order to give the data within each of the non-contextual data objects 208r-208t meaning, they are given context, which is provided by data contained within one or more of the context objects 210x-210z (thus indicating a “z” quantity of objects, where “z” is an integer) stored within a context object database 212. For example, if a pointer 214a points the non-contextual data object 208r to the synthetic context-based object 204a, while a pointer 216a points the context object 210x to the synthetic context-based object 204a, thus associating the non-contextual data object 208r and the context object 210x with the synthetic context-based object 204a (e.g., storing or otherwise associating the data within the non-contextual data object 208r and the context object 210x in the synthetic context-based object 204a), the data within the non-contextual data object 208r now has been given unambiguous meaning by the data within the context object 210x. This contextual meaning is thus stored within (or otherwise associated with) the synthetic context-based object 204a.
Similarly, if a pointer 214b associates data within the non-contextual data object 208s with the synthetic context-based object 204b, while the pointer 216c associates data within the context object 210z with the synthetic context-based object 204b, then the data within the non-contextual data object 208s is now given meaning by the data in the context object 210z. This contextual meaning is thus stored within (or otherwise associated with) the synthetic context-based object 204b.
Note that more than one context object can give meaning to a particular non-contextual data object. For example, both context object 210x and context object 210y can point to the synthetic context-based object 204a, thus providing compound context meaning to the non-contextual data object 208r shown in
Note also that while the pointers 214a-214b and 216a-216c are logically shown pointing towards one or more of the synthetic context-based objects 204a-204n, in one embodiment the synthetic context-based objects 204a-204n actually point to the non-contextual data objects 208r-208t and the context objects 210x-210z. That is, in one embodiment the synthetic context-based objects 204a-204n locate the non-contextual data objects 208r-208t and the context objects 210x-210z through the use of the pointers 214a-214b and 216a-216c.
Consider now an exemplary case depicted in
In the example shown in
Associated with the synthetic context-based object 304b is a context object 310z, which provides the context/datum of “music” to the term “rock” provided by the non-contextual data object 308r. Thus, the synthetic context-based object 304a defines “rock” as that which is related to the subject-matter “geology”, including minerals and/or gemstones, while synthetic context-based object 304b defines “rock” as that which is related to the subject-matter “entertainment”, including music.
In one embodiment, the data within a non-contextual data object is even more meaningless if it is merely a combinations of numbers and/or letters. For example, consider the data “104-106” contained within a non-contextual data object 408r depicted in
In the example shown in
Associated with the synthetic context-based object 404b is a context object 410y, which provides the context/data of “degrees on the Fahrenheit scale” and “human” to the term/values “104-106” provided by the non-contextual data object 408r. Thus, the synthetic context-based object 404b now defines term/values “104-106” as that which is related to the subject matter of “human fever”. Similarly, associated with the synthetic context-based object 404n is a context object 410z, which provides the context/data of “deep oceanography” to the term/values “104-106” provided by the non-contextual data object 408r. In this case, the generator of the synthetic context-based object database 202 determines that high numbers of atmospheres are used to define deep ocean pressures. Thus, the synthetic context-based object 404n now defines term/values “104-106” as that which is related to the subject matter of deep oceanography.
In one embodiment, the non-contextual data object may provide enough self-context to identify what the datum is, but not what it means and/or is used for. For example, consider the datum “statin” contained within the non-contextual data object 508r shown in
Associated with the synthetic context-based object 504b is a context object 510y, which provides the context/datum of “antioxidant” to the term “statin” provided by the non-contextual data object 508r. That is, a statin has properties both as a cholesterol reducer as well as an antioxidant. Thus, a statin can be considered in the context of reducing cholesterol (i.e., as described by the subject-matter of synthetic context-based object 504a), or it may considered in the context of being an antioxidant (i.e., as related to the subject-matter of synthetic context-based object 504b). Similarly, a statin can also be an anti-inflammatory medicine. Thus, associated with the synthetic context-based object 504b is a context object 510y, which provides the context/data of “antioxidant” to the term “statin” provided by the non-contextual data object 508r. This combination identifies the subject-matter of the synthetic context-based object 504b as “tissue inflammation”. Similarly, associated with the synthetic context-based object 504n is the context object 510z, which provides the context/data of “anti-inflammatory medication” to the term “statin” provided by the non-contextual data object 508r. This combination identifies the subject-matter of the synthetic context-based object 504n as “tissue inflammation”.
Once the synthetic context-based objects are defined, they can be linked to data stores. A data store is defined as a data repository of a set of integrated data, such as text files, video files, webpages, etc. With reference now to
That is, in one embodiment, the data structure 604 is a database of text documents (represented by one or more of the data stores 602m-602p), such as journal articles, webpage articles, electronically-stored business/medical/operational notes, etc.
In one embodiment, the data structure 604 is a database of text, audio, video, multimedia, etc. files (represented by one or more of the data stores 602m-602p) that are stored in a hierarchical manner, such as in a tree diagram, a lightweight directory access protocol (LDAP) folder, etc.
In one embodiment, the data structure 604 is a relational database, which is a collection of data items organized through a set of formally described tables. A table is made up of one or more rows, known as “tuples”. Each of the tuples (represented by one or more of the data stores 602m-602p) share common attributes, which in the table are described by column headings. Each tuple also includes a key, which may be a primary key or a foreign key. A primary key is an identifier (e.g., a letter, number, symbol, etc.) that is stored in a first data cell of a local tuple. A foreign key is typically identical to the primary key, except that it is stored in a first data cell of a remote tuple, thus allowing the local tuple to be logically linked to the foreign tuple.
In one embodiment, the data structure 604 is an object oriented database, which stores objects (represented by one or more of the data stores 602m-602p). As understood by those skilled in the art of computer software, an object contains both attributes, which are data (i.e., integers, strings, real numbers, references to another object, etc.), as well as methods, which are similar to procedures/functions, and which define the behavior of the object. Thus, the object oriented database contains both executable code and data.
In one embodiment, the data structure 604 is a spreadsheet, which is made up of rows and columns of cells (represented by one or more of the data stores 602m-602p). Each cell (represented by one or more of the data stores 602m-602p) contains numeric or text data, or a formula to calculate a value based on the content of one or more of the other cells in the spreadsheet.
In one embodiment, the data structure 604 is a collection of universal resource locators (URLs) for identifying a webpage, in which each URL (or a collection of URLs) is represented by one or more of the data stores 602m-602p.
These described types of data stores are exemplary, and are not to be construed as limiting what types of data stores are found within data structure 604.
Note that the data structure 604 is homogenous in one embodiment, while data structure 604 is heterogeneous in another embodiment. For example, assume in a first example that data structure 604 is a relational database, and all of the data stores 602m-602p are tuples. In this first example, data structure 604 is homogenous, since all of the data stores 602m-602p are of the same type. However, assume in a second example that data store 602m is a text document, data store 602m is an MRI image, data store 602p is a tuple from a relational database, etc. In this second example, data structure 604 is a heterogeneous data structure, since it contains data stores that are of different formats.
As described in
Assume that a user is using a computer such as requesting computer 702, which may be the user computer 154 shown in
Similarly, if the requester sends a request 706 to the synthetic context-based object 304b, then data from the data store 602p regarding rock music is retrieved and sent to the requester 702.
Note that in one embodiment of the present invention, a library of synthetic context-based objects is constructed to facilitate the user of the synthetic context-based objects when searching a data structure. In one embodiment, this library is horizontally constrained, such that synthetic context-based objects within a same dimension are placed within a same library. For example, consider the synthetic context-based object database 800 depicted in
The synthetic context-based object database 900 depicted in
Thus, it is the presence of the same non-contextual data object in a synthetic context-based object that defines the horizontal library, while it is the presence of the same context object in a synthetic context-based object that defines the vertical library.
With reference now to
As described in block 1006, the synthetic context-based object is associated with at least one specific data store. This at least one specific data store contains data that is associated with data contained in the non-contextual data object and the context object. That is, the data in the data store may be identical to that found in the non-contextual data object and the context object (i.e., the terms “rock” and “mineral” are in both the data store as well as the respective non-contextual data object and context object); it may be synonymous to that found in the non-contextual data object and the context object (i.e., the terms “rock” and “mineral” are the respective non-contextual data object and context object while synonyms “stone” and “element” are in the data store); and/or it may simply be deemed related by virtue of a lookup table that has been previously created (i.e., the term “rock” is mapped to the term “stone” and/or the term “mineral” is mapped to the term “elements” in a lookup table or similar associative data structure).
In one embodiment, the terms in the data store are identified by data mining a data structure in order to locate the data from the non-contextual data object and the context object in one or more data stores. Thus, this data mining locates at least one specific data store that contains data contained in the non-contextual data object and the context object.
In one embodiment, the data store is a text document. In this embodiment, the data mining entails searching the text document for text data that is part of the synthetic context-based object, and then associating the text document that contains this text data with the synthetic context-based object.
In one embodiment, the data store is a video file. In this embodiment, the data mining entails searching metadata associated with the video file for text data that is part of the synthetic context-based object, and then associating the video file having this metadata with the synthetic context-based object.
In one embodiment, the data store is a web page. In this embodiment, the data mining entails searching the web page for text data that is part of the synthetic context-based object, and then associating the web page that contains this text data with the synthetic context-based object.
Note that in one embodiment, the specific subject-matter for a particular data store in the data structure is exclusive to only that particular data store. That is, only one data store is mapped to a particular synthetic context-based object, such that there is a one-to-one relationship between each synthetic context-based object and each data store. Note further that in another embodiment, the specific subject-matter for a particular data store in the data structure overlaps at least one other data store. That is, multiple data stores are mapped to a particular synthetic context-based object, such that there is a one-to-many relationship between a particular synthetic context-based object and multiple data stores.
With reference now to block 1008, a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects is then constructed, where synthetic context-based objects within a same dimension of the dimensionally constrained hierarchical synthetic context-based object library share data. If the shared data is from a same non-contextual data object, then the dimensionally constrained hierarchical synthetic context-based object library is a horizontal library, in which synthetic context-based objects within the same horizontal dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different context objects. If the shared data is from a same context object, then the dimensionally constrained hierarchical synthetic context-based object library is a vertical library, in which synthetic context-based objects within the same vertical dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different non-contextual data objects.
With reference now to block 1010, a request for at least one data store that is associated with synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library is then received (e.g., by computer 102 shown in
The requesting computer 702 sends a request 1104 to the first vertical library 922 described in
As described in block 1012, at least one specific data store that is associated with synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library are then returned to the requester. In one embodiment, pointers similar to (or the same as) pointers 1110, 1112, and 1114 are used to return the data in these data stores to the requesting computer. Thus, the user/requesting system does not have to perform a search of all of the data structure 604, using data mining and associative logic, in order to find the data that the user desires. Rather, making an association between the user and a particular vertical library of synthetic context-based objects provides a rapid gateway from the requesting computer 702 to the desired data store.
The process ends at terminator block 1014.
As described herein, the present process utilizes one or more context objects. An exemplary process, executed by a processor, for deriving the requisite context objects is presented in
In one embodiment, two context objects within a document may be deemed similarly appropriate for one non-contextual data object. A search/analysis of the document may reveal enough instances of both a first context object and a second context object to satisfy the minimum validity threshold for assigning a context object to a non-contextual data object to create an appropriate synthetic context-based object. In this embodiment, the processor may assign a correct context object to the non-contextual data object based on which context object (of the first and second context objects) appears most often in the document (i.e., which context object is used more frequently). The context object with the greater number of instances of use in the document is therefore determined to be the correct context object to define a synthetic context-based object based on a particular non-contextual data object.
Alternatively, in one embodiment, if two context objects are determined to both meet the minimum validity threshold for defining a single non-contextual data object, the processor may determine that both or neither of the resulting synthetic context-based objects are appropriate. That is, rather than requiring that a single context object be chosen as the correct context object for a particular non-contextual data object, both context objects that meet the minimum validity threshold are assigned to that particular non-contextual data object by the processor. In another embodiment, the processor may instead determine that neither context object is the correct context object for that particular non-contextual data object (despite both context objects meeting the minimum validity threshold) and require that a third context object, that better meets the minimum validity threshold requirements, be searched for, in order to create a synthetic context-based object that more accurately describes the context of the data.
In one embodiment, the search/analysis of the document (i.e., a text document, video file, audio file, etc.) is performed by contextually examining the data proximate to the non-contextual data object within the document. For example, assume that the non-contextual data object is “3.14”. Within one paragraph, “3.14” is used as part of a math formula. Therefore, “3.14” is initially assumed to be relevant to calculating the area or circumference of a circle. However, in another paragraph within the document, “3.14” is used to describe a price of a stock. Additional instances of “3.14” are also used within passages related to business investments and finance. Thus, the original assumption that “3.14” describes a number used to calculate the area or circumference of a circle was incorrect. However, if the minimum validity threshold were low enough (e.g., 50%), then a context object of “circle area” or “circle circumference” would likely be assigned to “3.14”. However, if the minimum validity threshold were higher (e.g., 95%), then the single association of “3.14” with a math formula would not reach this level, thus requiring that the scope of search of the document be expanded, such that the proper context object (i.e., “stock price”) is derived.
Note that if the document is a video or audio file, the document is searched by first performing audio-to-text conversion, and then searching for the text.
In one embodiment, the expanded search of the document is performed using a Map/Reduce function. Map/Reduce is a data search routine that is used to search for and quantify data located in very large volumes of data. As the name implies, there are two functions in a map/reduce routine. The map function reads data incidents (e.g., each word in a text document) from a set of one or more documents (e.g., text documents, web pages, e-mails, text messages, tweets, etc.), and then maps those data incidents to a set of dynamically generated intermediate pairs (identifier, quantity). These intermediate pairs of mapped data are then sent to a reduce function, which recursively operates on the intermediate pairs to generate a value that indicates how many times each data incident occurred in all of the searched documents.
In one embodiment in which Map/Reduce is used to derive the context object, a progressively higher number of processors are used to execute the evaluations of the subsequently lower-level partitions of the document. For example, assume that a first pass at evaluating a single line in a document uses a single processor. If this first pass does not produce a context object that meets the minimum validity threshold described above, then the full paragraph is evaluated by four processors in a second pass. If this second pass does not produce a context object that meets the minimum validity threshold, then sixteen processors are assigned to evaluate the entire chapter, etc.
In one embodiment, the minimum validity threshold described herein is not for a single context object, but for a set of multiple context objects. For example, assume that context objects 210x and 210y both provide context to non-contextual data object 208r depicted in
In one embodiment, the probability that a set of one or more context objects accurately provides context to a non-contextual data object is historically based. That is, assume that in 95% of past documents, a particular context object has been shown to provide the accurate context (i.e., provides correct meaning) to a particular non-contextual data object if that particular context object is used in proximity to (i.e., within 10 words) that particular non-contextual data object more than three times. Thus, if this particular context object is used more than three times in proximity to this particular non-contextual data object within the current document, then there is an assumption that this particularly context object has a 95% probability (likelihood) of accurately providing the proper context to this particular non-contextual data object.
In one embodiment, the probability that a set of one or more context objects accurately provides context to a non-contextual data object is established using Bayesian probabilities. For example, consider the Bayesian probability formula of:
where:
For example, assume that past evaluations have determined that the probability that the context object is within ten words of the non-contextual data object more than a certain number of times in a paragraph of a book whenever the context object provides the accurate context to the non-contextual data object is 60%; the probability that context object provides an accurate context to the non-contextual data object, regardless of any other conditions, is 5%; and the probability that the non-contextual data object is within ten words of the non-contextual data object more than a certain number of times in the document, regardless of any other conditions, is 10%.
According to these values, the probability that a context objects provide an accurate context to the non-contextual data object given that this context object is within ten words of the non-contextual data object more than a certain number of times in the single paragraph is 3%:
In this first scenario, if the minimum validity threshold is 95%, then there is not enough support to assume that this context object is valid. Thus, a further search for the context object within ten words of the non-contextual data object is made on an entire page/chapter. In this scenario, past evaluations have determined that the probability that the context object is within ten words of the non-contextual data object more than a certain number of times in an entire page/chapter of a book whenever the context object provides the accurate context to the non-contextual data object is 78%; the probability that context object provides an accurate context to the non-contextual data object, regardless of any other conditions, is still 5%; and the probability that the non-contextual data object is within ten words of the non-contextual data object more than a certain number of times in the document, regardless of any other conditions, is now 4%.
According to these values, the probability that a context object provides an accurate context to the non-contextual data object given that this context object is within ten words of the non-contextual data object more than a certain number of times in the entire page/chapter is 98%:
In this second scenario, the additional search/analysis of the entire page or chapter deems this particular context object to accurately provide context to the non-contextual data object.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the present invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of various embodiments of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the present invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the present invention. The embodiment was chosen and described in order to best explain the principles of the present invention and the practical application, and to enable others of ordinary skill in the art to understand the present invention for various embodiments with various modifications as are suited to the particular use contemplated.
Note further that any methods described in the present disclosure may be implemented through the use of a VHDL (VHSIC Hardware Description Language) program and a VHDL chip. VHDL is an exemplary design-entry language for Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), and other similar electronic devices. Thus, any software-implemented method described herein may be emulated by a hardware-based VHDL program, which is then applied to a VHDL chip, such as a FPGA.
Having thus described embodiments of the present invention of the present application in detail and by reference to illustrative embodiments thereof, it will be apparent that modifications and variations are possible without departing from the scope of the present invention defined in the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5450535 | North | Sep 1995 | A |
5664179 | Tucker | Sep 1997 | A |
5689620 | Kopec et al. | Nov 1997 | A |
5701460 | Kaplan et al. | Dec 1997 | A |
5943663 | Mouradian | Aug 1999 | A |
5974427 | Reiter | Oct 1999 | A |
6167405 | Rosensteel et al. | Dec 2000 | A |
6199064 | Schindler | Mar 2001 | B1 |
6269365 | Kiyoki et al. | Jul 2001 | B1 |
6275833 | Nakamura et al. | Aug 2001 | B1 |
6314555 | Ndumu et al. | Nov 2001 | B1 |
6334156 | Matsuoka et al. | Dec 2001 | B1 |
6353818 | Carino, Jr. | Mar 2002 | B1 |
6381611 | Roberge et al. | Apr 2002 | B1 |
6405162 | Segond et al. | Jun 2002 | B1 |
6424969 | Gruenwald | Jul 2002 | B1 |
6553371 | Gutierrez-Rivas et al. | Apr 2003 | B2 |
6633868 | Min | Oct 2003 | B1 |
6735593 | Williams | May 2004 | B1 |
6768986 | Cras et al. | Jul 2004 | B2 |
6925470 | Sangudi et al. | Aug 2005 | B1 |
6990480 | Burt | Jan 2006 | B1 |
7019740 | Georgalas | Mar 2006 | B2 |
7047253 | Murthy et al. | May 2006 | B1 |
7058628 | Page | Jun 2006 | B1 |
7103836 | Nakamura et al. | Sep 2006 | B1 |
7152070 | Musick et al. | Dec 2006 | B1 |
7191183 | Goldstein | Mar 2007 | B1 |
7209923 | Cooper | Apr 2007 | B1 |
7337174 | Craig | Feb 2008 | B1 |
7441264 | Himmel et al. | Oct 2008 | B2 |
7477165 | Fux | Jan 2009 | B2 |
7493253 | Ceusters et al. | Feb 2009 | B1 |
7503007 | Goodman et al. | Mar 2009 | B2 |
7523118 | Friedlander et al. | Apr 2009 | B2 |
7523123 | Yang et al. | Apr 2009 | B2 |
7571163 | Trask | Aug 2009 | B2 |
7679534 | Kay et al. | Mar 2010 | B2 |
7702605 | Friedlander et al. | Apr 2010 | B2 |
7748036 | Speirs, III et al. | Jun 2010 | B2 |
7752154 | Friedlander et al. | Jul 2010 | B2 |
7778955 | Kuji | Aug 2010 | B2 |
7783586 | Friedlander et al. | Aug 2010 | B2 |
7788202 | Friedlander et al. | Aug 2010 | B2 |
7788203 | Friedlander et al. | Aug 2010 | B2 |
7792774 | Friedlander et al. | Sep 2010 | B2 |
7792776 | Friedlander et al. | Sep 2010 | B2 |
7792783 | Friedlander et al. | Sep 2010 | B2 |
7797319 | Piedmonte | Sep 2010 | B2 |
7805390 | Friedlander et al. | Sep 2010 | B2 |
7805391 | Friedlander et al. | Sep 2010 | B2 |
7809660 | Friedlander et al. | Oct 2010 | B2 |
7853611 | Friedlander et al. | Dec 2010 | B2 |
7870113 | Gruenwald | Jan 2011 | B2 |
7877682 | Aegerter | Jan 2011 | B2 |
7925610 | Elbaz et al. | Apr 2011 | B2 |
7930262 | Friedlander et al. | Apr 2011 | B2 |
7940959 | Rubenstein | May 2011 | B2 |
7953686 | Friedlander et al. | May 2011 | B2 |
7970759 | Friedlander et al. | Jun 2011 | B2 |
7996373 | Zoppas et al. | Aug 2011 | B1 |
7996393 | Nanno et al. | Aug 2011 | B1 |
8032508 | Martinez et al. | Oct 2011 | B2 |
8046358 | Thattil | Oct 2011 | B2 |
8055603 | Angell et al. | Nov 2011 | B2 |
8069188 | Larson et al. | Nov 2011 | B2 |
8086614 | Novy | Dec 2011 | B2 |
8095726 | O'Connell et al. | Jan 2012 | B1 |
8145582 | Angell et al. | Mar 2012 | B2 |
8150882 | Meek et al. | Apr 2012 | B2 |
8155382 | Rubenstein | Apr 2012 | B2 |
8161048 | Procopiuc et al. | Apr 2012 | B2 |
8199982 | Fueyo et al. | Jun 2012 | B2 |
8234285 | Cohen | Jul 2012 | B1 |
8250581 | Blanding et al. | Aug 2012 | B1 |
8341626 | Gardner et al. | Dec 2012 | B1 |
8447273 | Friedlander et al. | May 2013 | B1 |
8457355 | Brown et al. | Jun 2013 | B2 |
8489641 | Seefeld et al. | Jul 2013 | B1 |
8620958 | Adams | Dec 2013 | B1 |
8799323 | Nevin, III | Aug 2014 | B2 |
8849907 | Hession et al. | Sep 2014 | B1 |
8914413 | Adams et al. | Dec 2014 | B2 |
8983981 | Adams et al. | Mar 2015 | B2 |
20010051881 | Filler | Dec 2001 | A1 |
20020091677 | Sridhar | Jul 2002 | A1 |
20020111792 | Cherny | Aug 2002 | A1 |
20020184401 | Kadel et al. | Dec 2002 | A1 |
20030065626 | Allen | Apr 2003 | A1 |
20030088576 | Hattori et al. | May 2003 | A1 |
20030149562 | Walther | Aug 2003 | A1 |
20030149934 | Worden | Aug 2003 | A1 |
20030212664 | Breining et al. | Nov 2003 | A1 |
20030212851 | Drescher et al. | Nov 2003 | A1 |
20040036716 | Jordahl | Feb 2004 | A1 |
20040111410 | Burgoon et al. | Jun 2004 | A1 |
20040153461 | Brown et al. | Aug 2004 | A1 |
20040162838 | Murayama et al. | Aug 2004 | A1 |
20040249789 | Kapoor et al. | Dec 2004 | A1 |
20050050030 | Gudbjartsson et al. | Mar 2005 | A1 |
20050165866 | Bohannon et al. | Jul 2005 | A1 |
20050181350 | Benja-Athon | Aug 2005 | A1 |
20050188088 | Fellenstein et al. | Aug 2005 | A1 |
20050222890 | Cheng et al. | Oct 2005 | A1 |
20050273730 | Card et al. | Dec 2005 | A1 |
20060004851 | Gold et al. | Jan 2006 | A1 |
20060036568 | Moore et al. | Feb 2006 | A1 |
20060190195 | Watanabe et al. | Aug 2006 | A1 |
20060197762 | Smith et al. | Sep 2006 | A1 |
20060200253 | Hoffberg et al. | Sep 2006 | A1 |
20060256010 | Tanygin et al. | Nov 2006 | A1 |
20060271586 | Federighi et al. | Nov 2006 | A1 |
20060290697 | Madden et al. | Dec 2006 | A1 |
20070006321 | Bantz et al. | Jan 2007 | A1 |
20070016614 | Novy | Jan 2007 | A1 |
20070038651 | Bernstein et al. | Feb 2007 | A1 |
20070067343 | Mihaila et al. | Mar 2007 | A1 |
20070073734 | Doan et al. | Mar 2007 | A1 |
20070079356 | Grinstein | Apr 2007 | A1 |
20070088663 | Donahue | Apr 2007 | A1 |
20070130182 | Forney | Jun 2007 | A1 |
20070136048 | Richardson-Bunbury et al. | Jun 2007 | A1 |
20070174840 | Sharma et al. | Jul 2007 | A1 |
20070185850 | Walters et al. | Aug 2007 | A1 |
20070239710 | Jing et al. | Oct 2007 | A1 |
20070282916 | Albahari et al. | Dec 2007 | A1 |
20070300077 | Mani et al. | Dec 2007 | A1 |
20080065655 | Chakravarthy et al. | Mar 2008 | A1 |
20080066175 | Dillaway et al. | Mar 2008 | A1 |
20080086442 | Dasdan et al. | Apr 2008 | A1 |
20080091503 | Schirmer et al. | Apr 2008 | A1 |
20080133474 | Hsiao et al. | Jun 2008 | A1 |
20080147780 | Trevor et al. | Jun 2008 | A1 |
20080159317 | Iselborn et al. | Jul 2008 | A1 |
20080172715 | Geiger et al. | Jul 2008 | A1 |
20080208813 | Friedlander et al. | Aug 2008 | A1 |
20080208838 | Friedlander et al. | Aug 2008 | A1 |
20080208901 | Friedlander et al. | Aug 2008 | A1 |
20080281801 | Larson et al. | Nov 2008 | A1 |
20080306926 | Friedlander et al. | Dec 2008 | A1 |
20090024553 | Angell et al. | Jan 2009 | A1 |
20090064300 | Bagepalli et al. | Mar 2009 | A1 |
20090080408 | Natoli et al. | Mar 2009 | A1 |
20090125546 | Iborra et al. | May 2009 | A1 |
20090144609 | Liang et al. | Jun 2009 | A1 |
20090164649 | Kawato | Jun 2009 | A1 |
20090165110 | Becker et al. | Jun 2009 | A1 |
20090177484 | Davis et al. | Jul 2009 | A1 |
20090182707 | Kinyon et al. | Jul 2009 | A1 |
20090287676 | Dasdan | Nov 2009 | A1 |
20090299988 | Hamilton, II et al. | Dec 2009 | A1 |
20090327632 | Glaizel et al. | Dec 2009 | A1 |
20100030780 | Eshghi et al. | Feb 2010 | A1 |
20100070640 | Allen et al. | Mar 2010 | A1 |
20100077033 | Lowry | Mar 2010 | A1 |
20100088322 | Chowdhury et al. | Apr 2010 | A1 |
20100125604 | Martinez et al. | May 2010 | A1 |
20100125605 | Nair et al. | May 2010 | A1 |
20100131293 | Linthicum et al. | May 2010 | A1 |
20100131379 | Dorais et al. | May 2010 | A1 |
20100169137 | Jastrebski et al. | Jul 2010 | A1 |
20100169758 | Thomsen | Jul 2010 | A1 |
20100174692 | Meyer et al. | Jul 2010 | A1 |
20100179933 | Bai et al. | Jul 2010 | A1 |
20100191743 | Perronnin et al. | Jul 2010 | A1 |
20100191747 | Ji et al. | Jul 2010 | A1 |
20100241644 | Jackson et al. | Sep 2010 | A1 |
20100257198 | Cohen et al. | Oct 2010 | A1 |
20100268747 | Kern et al. | Oct 2010 | A1 |
20100274785 | Procopiuc et al. | Oct 2010 | A1 |
20110040724 | Dircz | Feb 2011 | A1 |
20110066649 | Berlyant et al. | Mar 2011 | A1 |
20110077048 | Busch | Mar 2011 | A1 |
20110087678 | Frieden et al. | Apr 2011 | A1 |
20110093479 | Fuchs | Apr 2011 | A1 |
20110098056 | Rhoads et al. | Apr 2011 | A1 |
20110123087 | Nie et al. | May 2011 | A1 |
20110137882 | Weerasinghe | Jun 2011 | A1 |
20110161073 | Lesher | Jun 2011 | A1 |
20110194744 | Wang et al. | Aug 2011 | A1 |
20110208688 | Ivanov et al. | Aug 2011 | A1 |
20110246483 | Darr et al. | Oct 2011 | A1 |
20110246498 | Forster | Oct 2011 | A1 |
20110252045 | Garg | Oct 2011 | A1 |
20110282888 | Koperski et al. | Nov 2011 | A1 |
20110299427 | Chu et al. | Dec 2011 | A1 |
20110301967 | Friedlander et al. | Dec 2011 | A1 |
20110314155 | Narayanaswamy et al. | Dec 2011 | A1 |
20120004891 | Rameau et al. | Jan 2012 | A1 |
20120005239 | Nevin, III | Jan 2012 | A1 |
20120016715 | Brown et al. | Jan 2012 | A1 |
20120023141 | Holster | Jan 2012 | A1 |
20120072468 | Anthony et al. | Mar 2012 | A1 |
20120079493 | Friedlander et al. | Mar 2012 | A1 |
20120109640 | Anisimovich et al. | May 2012 | A1 |
20120110004 | Meijer | May 2012 | A1 |
20120110016 | Phillips | May 2012 | A1 |
20120131139 | Siripurapu et al. | May 2012 | A1 |
20120131468 | Friedlander et al. | May 2012 | A1 |
20120166373 | Sweeney et al. | Jun 2012 | A1 |
20120191704 | Jones | Jul 2012 | A1 |
20120209858 | Lamba et al. | Aug 2012 | A1 |
20120221439 | Sundaresan et al. | Aug 2012 | A1 |
20120233194 | Ohyu et al. | Sep 2012 | A1 |
20120239761 | Linner et al. | Sep 2012 | A1 |
20120240080 | O'Malley | Sep 2012 | A1 |
20120246148 | Dror | Sep 2012 | A1 |
20120259841 | Hsiao et al. | Oct 2012 | A1 |
20120278897 | Ang et al. | Nov 2012 | A1 |
20120281830 | Stewart et al. | Nov 2012 | A1 |
20120290950 | Rapaport et al. | Nov 2012 | A1 |
20120297278 | Gattani et al. | Nov 2012 | A1 |
20120311587 | Li et al. | Dec 2012 | A1 |
20120316821 | Levermore et al. | Dec 2012 | A1 |
20120330958 | Xu et al. | Dec 2012 | A1 |
20130019084 | Orchard et al. | Jan 2013 | A1 |
20130031302 | Byom et al. | Jan 2013 | A1 |
20130060696 | Martin et al. | Mar 2013 | A1 |
20130103389 | Gattani et al. | Apr 2013 | A1 |
20130124564 | Oztekin et al. | May 2013 | A1 |
20130173292 | Friedlander et al. | Jul 2013 | A1 |
20130173585 | Friedlander et al. | Jul 2013 | A1 |
20130191392 | Kumar | Jul 2013 | A1 |
20130238667 | Carvalho et al. | Sep 2013 | A1 |
20130246562 | Chong et al. | Sep 2013 | A1 |
20130254202 | Friedlander et al. | Sep 2013 | A1 |
20130291098 | Chung et al. | Oct 2013 | A1 |
20130311473 | Safovich et al. | Nov 2013 | A1 |
20130326412 | Treiser | Dec 2013 | A1 |
20130339379 | Ferrari et al. | Dec 2013 | A1 |
20140006411 | Boldyrev et al. | Jan 2014 | A1 |
20140012884 | Bornea et al. | Jan 2014 | A1 |
20140025702 | Curtiss et al. | Jan 2014 | A1 |
20140074833 | Adams et al. | Mar 2014 | A1 |
20140074885 | Adams et al. | Mar 2014 | A1 |
20140074886 | Medelyan | Mar 2014 | A1 |
20140074892 | Adams et al. | Mar 2014 | A1 |
20140081939 | Adams et al. | Mar 2014 | A1 |
20140172417 | Monk, II | Jun 2014 | A1 |
20140184500 | Adams et al. | Jul 2014 | A1 |
20140188960 | Adams et al. | Jul 2014 | A1 |
20140214865 | Adams et al. | Jul 2014 | A1 |
20140214871 | Adams et al. | Jul 2014 | A1 |
20140250111 | Morton et al. | Sep 2014 | A1 |
20140344718 | Rapaport et al. | Nov 2014 | A1 |
Number | Date | Country |
---|---|---|
101866342 | Oct 2010 | CN |
102201043 | Sep 2011 | CN |
102236701 | Nov 2011 | CN |
102385483 | Mar 2012 | CN |
1566752 | Aug 2005 | EP |
1843259 | Oct 2007 | EP |
2006086179 | Aug 2006 | WO |
2007044763 | Apr 2007 | WO |
Entry |
---|
U.S. Appl. No. 13/610,523—Non-Final Office Action mailed Apr. 30, 2015. |
U.S. Appl. No. 13/540,267—Non-Final Office Action mailed Jun. 4, 2015. |
U.S. Appl. No. 13/609,710—Examiner's Answer mailed Jun. 9, 2015. |
U.S. Appl. No. 13/780,779—Non-Final Office Action mailed Apr. 3, 2015. |
U.S. Appl. No. 13/896,461—Non-Final Office Action mailed Apr. 21, 2015. |
Graham Pryor, “Attitudes and Aspirations in a Diverse World: The Project Store Perspective on Scientific Repositories”. UKOLN, University of Bath, Digital Curation Center. The International Journal of Digital Curation, Issue 1, vol. 2, 2007. Nov. 2006. |
Filippova, Katja and Keith B. Hall, “Improved Video Categorization From Text Metadata and User Comments”. Proceedings of the 34th International SCM SIGIR Conference on Research and Development in Information Retrieval. ACM, 2011. |
U.S. Appl. No. 13/896,506 Non-Final Office Action Mailed Oct. 26, 2015. |
U.S. Appl. No. 13/342,305, filed Jan. 3, 2012. |
U.S. Appl. No. 13/562,714, filed Jul. 31, 2012. |
U.S. Appl. No. 13/861,058 Non-Final Office Action Mailed Apr. 25, 2016. |
Faulkner, Paul, “Common Patterns for Synthetic Events in Websphere Business Events,” Jan. 15, 2011, http://www.ibm.com/developerworks/websphere/bpmjournal/1101—faulkner2/1101—faulkner2.html, pp. 1-6. |
Evaggelio Pitoura et al., “Context in Databases”, University of Ioannina, Greece, 2004, pp. 1-19. |
Avinash Kaushik, “End of Dumb Tables in Web Analytics Tools! Hello: Weighted Sort”, Sep. 7, 2010, www.kaushik.net, pp. 1-15. |
Lorenzo Alberton, “Graphs in the Database: SQL Meets Social Networks,” Techportal, Sep. 7, 2009, http://techportal.inviqa.com/2009/09/07/graphs-in-the-database-sql-meets-social-networks/, pp. 1-11. |
Visual Paradigm, “DB Visual Architect 4.0 Designer's Guide: Chapter 6—Mapping Object Model to Data Model and Vice Versa”, 2007, pp. 6-2-6-26. |
U.S. Appl. No. 13/609,710—Non-Final Office Action Mailed Jan. 27, 2014. |
U.S. Appl. No. 13/540,295—Non-Final Office Action Mailed Jan. 30, 2014. |
U.S. Appl. No. 13/540,230—Non-Final Office Action Mailed Jan. 30, 2014. |
U.S. Appl. No. 13/540,267—Non-Final Office Action Mailed Feb. 4, 2014. |
U.S. Appl. No. 13/628,853—Notice of Allowance Mailed Mar. 4, 2014. |
U.S. Appl. No. 13/595,356—Non-Final Office Action Mailed Apr. 14, 2014. |
“Ninth New Collegiate Dictionary”, Merriam-Webster Inc., 1991, pp. 77 and 242. |
“The American Heritage College Dictionary”, Fourth Edition, Houghton Mifflin Company, 2004, pp. 44 and 262. |
U.S. Appl. No. 13/680,832—Non-Final Office Action Mailed Apr. 8, 2014. |
U.S. Appl. No. 13/592,905—Notice of Allowance Mailed Oct. 25, 2013. |
U.S. Appl. No. 13/342,406—Non-Final Office Action Mailed Sep. 27, 2013. |
U.S. Appl. No. 13/610,347—Non-Final Office Action Mailed Jul. 19, 2013. |
U.S. Appl. No. 13/610,347—Notice of Allowance Mailed Aug. 19, 2013. |
M.J. Flynn, et al., “Sparse Distributed Memory Principles of Operation”, Research Institute for Advanced Computer Science, 1989, pp. 1-60. |
P. Kanerva, “Hyperdimensional Computing: An Introduction to Computing in Distributed Representation With High-Dimensional Random Vectors”, Springer Science+Business Media, LLC, Cogn Comput, 1, 2009, pp. 139-159. |
P. Kanerva, “What We Mean When We Say “What's the Dollar of Mexico?”: Prototypes and Mapping in Concept Space”, Quantum Informatics for Cognitive, Social, and Semantic Processes: Papers From the AAAI Fall Symposium, Association for the Advancement of Artificial Intelligence, 2010, pp. 2-6. |
M. Yu, et al., “Secure and Robust Error Correction for Physical Unclonable Functions”, Verifying Physical Trustworthiness of ICS and Systems, IEEE Design & Test of Computers, IEEE, Jan./Feb. 2010, pp. 48-64. |
A. Jin, et al., “Biohashing: Two Factor Authentication Featuring Fingerprint Data and Tokenised Random Number,” Pattern Recognition 37, Elsevier Ltd., 2004, pp. 2245-2255. |
N. Saxena et al., “Data remanence effects on memory-based entropy collection for RFID systems”, International Journal of Information Security 10.4 (2011), pp. 213-222. |
A. Birrell et al., “A design for high-performance flash disks.” ACM SIGOPS Operating Systems Review 41.2 (2007), pp. 88-93. |
Richard Saling, “How to Give a Great Presentation! From the HP Learning Center”, Jul. 28, 2008, <http://rsaling.wordpress.com/2008/07/28/how-to-give-a-great-presentation/>, pp. 1-28. |
K. Matterhorn, “How to Share Data Between a Host Computer & Virtual Machine,” Ehow, pp. 1-3, <http://www.ehow.com/how—7385388—share-host-computer-virtual-machine.html>, Retrieved Feb. 17, 2013. |
W. Caid et al., “Context Vector-Based Text Retrieval”, Fair Isaac Corporation, Aug. 2003, pp. 1-20. |
Anonymous “Fraud Detection Using Data Analytics in the Banking Industry,” ACL Services Ltd., 2010, pp. 1-9 <http://www.acl.com/pdfs/DP—Fraud—detection—BANKING.pdf>. |
J. Cheng et al., “Context-Aware Object Connection Discovery in Large Graphs”, Data Engineering, 2009. ICDE '09. IEEE 25th International Conferen. |
R. Angles et al., “Survey of Graph Database Models”, ACM Computing Surveys, vol. 40, No. 1, Article 1, Feb. 2008, pp. 1-65. |
U.S. Appl. No. 13/592,905—Non-Final Office Action Mailed May 8, 2013. |
U.S. Appl. No. 13/628,853—Non-Final Office Action Mailed Nov. 7, 2013. |
U.S. Appl. No. 13/342,406—Notice of Allowance Mailed Mar. 20, 2014. |
U.S. Appl. No. 13/755,623—Notice of Allowance Mailed May 27, 2014. |
S. Alam et al., “Interoperability of Security-Enabled Internet of Things”, Springer, Wireless Personal Communications, Dec. 2011, vol. 61, pp. 567-586. |
U.S. Appl. No. 13/648,801—Non-Final Office Action Mailed Jul. 1, 2014. |
U.S. Appl. No. 13/609,710—Final Office Action Mailed Jul. 24, 2014. |
U.S. Appl. No. 13/861,058—Non-Final Office Action mailed Dec. 11, 2014. |
U.S. Appl. No. 13/733,052—Non-Final Office Action mailed Sep. 18, 2014. |
U.S. Appl. No. 13/755,987—Non-Final Office Action mailed Jan. 2, 2015. |
U.S. Appl. No. 13/648,801—Final Office Action mailed Jan. 13, 2015. |
G. Begelman et al., “Automated Tag Clustering: Improving Search and Exploration in the TagSpace”, Collaborative Tagging Workshop, WWW2006, Edinburgh, Scotland, May 2006, pp. 1-29. |
U.S. Appl. No. 13/621,931—Non-Final Office Action mailed Jan. 28, 2015. |
U.S. Appl. No. 13/732,567—Non-Final Office Action mailed Jan. 30, 2015. |
U.S. Appl. No. 14/078,135—Notice of Allowance mailed Feb. 24, 2015. |
U.S. Appl. No. 13/756,051—Notice of Allowance mailed Feb. 27, 2015. |
U.S. Appl. No. 13/732,567—Non-Final Office Action mailed Mar. 26, 2015. |
L. Du et al., “A Unified Object-Oriented Toolkit for Discrete Contextual Computer Vision”, IEEE, IEEE Colloquium on Pattern Recognition, Feb. 1997, pp. 3/1-3/5. (Abstract Only). |
S. Ceri et al., “Model-Driven Development of Context-Aware Web Applications”, ACM, ACM Transactions on Internet Technology, 2007, (Abstract Only). |
U.S. Appl. No. 13/569,366—Non-Final Office Action mailed Jun. 30, 2015. |
U.S. Appl. No. 13/648,801 Examiner's Answer Mailed Oct. 1, 2015. |
U.S. Appl. No. 13/609,710 Decision on Appeal Mailed Nov. 4, 2016. |
U.S. Appl. No. 13/733,066 Examiner'S Answer Mailed Dec. 20, 2016. |
U.S. Appl. No. 13/861,058 Final Office Action Mailed Dec. 29, 2016. |
U.S. Appl. No. 13/648,801 Decision on Appeal Mailed Jan. 18, 2017. |
Number | Date | Country | |
---|---|---|---|
20150227516 A1 | Aug 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13755987 | Jan 2013 | US |
Child | 14697682 | US |