System and method for detecting confidential information emails

Information

  • Patent Grant
  • 10356032
  • Patent Number
    10,356,032
  • Date Filed
    Thursday, December 26, 2013
    10 years ago
  • Date Issued
    Tuesday, July 16, 2019
    5 years ago
Abstract
Systems and methods are disclosed for detecting confidential information emails. In accordance with one implementation, a method is provided for detecting confidential information emails. The method includes obtaining a sender address of an electronic message, the sender address comprising a first username and a first domain name, and obtaining at least one recipient address of the electronic message, the recipient address comprising a second username and a second domain name. The method also includes determining whether the recipient address and the sender address are different addresses of a user, and based on the determination, flagging the electronic message.
Description
BACKGROUND

Intellectual property is one of several key assets held by companies today. Accordingly, companies are always looking for ways to control their confidential and trade-secret information and to ensure that it is not disseminated to third parties. Most of that information is stored in a digital format nowadays, and can typically be accessed from electronic devices (e.g., desktops, laptops, tablet computers, smart phones, etc.) that are often provided by the company to its employees. While a company has some control and oversight over its own electronic devices, it loses any such control once the confidential information leaves the company device and is transferred to another device, such as a personal email account. Accordingly, identifying such transfer of confidential information can help the company better protect its intellectual property.





BRIEF DESCRIPTION OF THE DRAWINGS

Reference will now be made to the accompanying drawings which illustrate exemplary embodiments of the present disclosure. In the drawings:



FIG. 1 is a block diagram of an exemplary system, consistent with embodiments of the present disclosure;



FIG. 2 is a flowchart of an exemplary method for detecting confidential information emails, consistent with embodiments of the present disclosure;



FIG. 3 is a block diagram of an exemplary data fusion system, consistent with embodiments of the present disclosure;



FIG. 4 is block diagram of an exemplary electronic device with which embodiments of the present disclosure can be implemented.





DESCRIPTION OF EXEMPLARY EMBODIMENTS

As discussed above, it is a major concern of a company when confidential information is transferred (moved or copied) from a company device to another device. In such a situation, it is particularly concerning where a company employee sends information from his company device or account to his personal device or account. One example of this is an employee sending an email from the employee's corporate email account (accessing it either from a company device or another device) to the employee's personal email account. Such activity is particularly suspicious because it may indicate that an employee is deliberately transferring the information away from the company device or account, in order to later share it with a third party or otherwise misappropriate it. Therefore, it would be advantageous to have a system and a method for detecting emails sent from an employee's corporate email account to the employee's personal email account.


Reference will now be made in detail to several exemplary embodiments of the present disclosure, including those illustrated in the accompanying drawings. Whenever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.


Reference is now made to FIG. 1, which illustrates, in block diagram form, an exemplary system 100. As shown in FIG. 1, system 100 can include, for example, an electronic device 110 coupled either directly or through a network 170 to a database 180, which is coupled either directly or through a network 160 to a corporate email server 140. System 100 can also include a sender device 120 that is coupled either directly or through a network 130 to corporate email server 140, which is coupled through a network 150 to one or more external email servers 190.


Database 180 can be any type of database that stores digital data. Database 180 can include an email database (not shown) storing email data obtained from corporate email server 140. Database 180 can also include a name database (not shown) storing name data in association with email address data. Database 180 can also include a nickname database (not shown) storing nickname data in association with name data. For example, the nickname database can include the following nicknames in association with the name Richard: Rich, Richie, Ricky, and Dick. The three databases discussed above are illustrated as being part of the same database 180, but it is appreciated that the three devices may or may not be a part of the same physical device, and can be located on different physical devices (e.g., servers) and on different networks. Moreover, it is appreciated that the information stored in the email database, name the database, and the nickname database can be accumulated in less than three databases. In some embodiments, database 180 can be implemented as a data fusion system 300, described in more detail below in FIG. 3, discussed in detail below.


The email database can store email data of all emails sent from sender device or process (e.g. automated emails) through corporate email server 140 or only some of those emails. For example, the email database can store all emails sent through corporate email server 140 within the last predefined period of time (e.g., the last day, the last week, etc.)


In some embodiments, database 180 can be stored on a separate server which can be accessed by electronic device 110 either directly or through network 170. In other embodiments, database 180 can be physically stored on corporate email server 140. In yet other embodiments, database 180 can be physically stored on electronic device 110. In some embodiments, parts of database 180 can be omitted. For example, database 180 may not include the email database, and the electronic device can obtain and process email data from corporate email server 140 in real time, as the emails are being sent.


Corporate email server 140 can be any type of an email server such as a Microsoft Exchange Server, Novell Groupwise, Open-Xchange, or any other email server that supports sending, storing, and/or receiving of emails. Corporate email server 140 can receive outgoing email data from sender device 120, identify, based on the outgoing email data, an appropriate external email server 190, and send the outgoing email data to the identified external email server 190. Corporate email server 140 could also be one or more servers in a chain of email servers that route messages from the sender to the external email server.


External email server 190 can be any type of one or more email servers that can be accessed by users directly or remotely (e.g., via the Internet), receive and store incoming emails, and/or send outgoing emails. Examples of external email servers 190 include popular servers open to the public, such as Gmail, Yahoo Mail, Hotmail, as well as proprietary email servers serving one or a limited number of users, such as an email server running on a user's personal computer.


An email server, such as corporate email server 140 or external email server 190, can be associated with one or more IP addresses (e.g., “68.142.240.31”) that uniquely identify the server within its network (e.g., the Internet). An email server can also be associated with one or more domain names (e.g., “yahoo.com”). For brevity purposes, IP addresses and domain names will be collectively referred to herein as “domain names.”


Electronic device 110 can be one or more electronic devices of any type that can obtain email data from corporate email server 140 either directly (not shown) or through database 180. Exemplary embodiments of electronic device 110 are discussed in more detail below, in connection with FIG. 4.


Networks 130, 150, 160, and 170, can each be any type of wireless and/or wired network such as a local area network (LAN) and/or a wide area network (WAN) (e.g., the Internet).


Sender device 120 can be a stationary electronic device (e.g., a PC) or a mobile electronic device (e.g., a cellular phone, a smartphone, a tablet, a netbook, a laptop, a PDA, etc.) or any other type of electronic device having a processor and capable of receiving input data, such as email data, from a user, and communicating with corporate email server 140, either directly or through network 130. Sender device 120 can be owned by a company and provided for an employee for the duration of employment, or it can be the employee's personal device. Sender device 120 can have an email client application that can facilitate receiving input data from the user and communicating with corporate email server 140. The email client application can be a standalone application such as Microsoft Outlook, an internet browser providing access to corporate email server 140 through web protocols (e.g., HTTP or HTTPS) or any other type of application.


In some embodiments, sender device 120 receives email data from a user (e.g., using the email client application), processes and optionally modifies the email data, and sends the (optionally modified) email data to corporate email server 140. Upon receiving the email data, corporate email server 140 can optionally modify the email data, identify, based on the email data, one or more external email servers to which the email data should be sent, and send a copy of the (optionally modified) email data to each of the identified external email servers. Corporate email server 140 can send the email data using a Simple Mail Transfer Protocol (SMTP), or using any other protocol suitable for sending email data. Each of the identified external email servers, upon receiving the email data can identify, based on the email data, one or more recipient users, and store the received email data in association with the identified recipient users. The recipient users can then log into their respective accounts at the identified external email servers, and retrieve the email data. The logging in and the retrieval can be implemented via protocols such as Post Office Protocol (POP), Internet Message Access Protocol (IMAP), via a web application, or using any other suitable method.


The email data can include, among other things, a subject, a body, one or more attachments (files), header information, one or more recipient addresses and a sender address.


Each recipient addresses can include, for example, a local part, an “at” sign (“@”), and a domain part. For example, in the electronic address “john.doe123@yahoo.com” the local part is “john.doe123” and the domain part is “yahoo.com”. In some embodiments, the domain part of the recipient address can be associated with a particular external email server 190. For instance, in the above example, domain part “yahoo.com” is associated with an external email server belonging to Yahoo! Inc. In some embodiments, the local part of the recipient address can correspond to a username associated with one of the users of the external email servers associated with the domain part. For instance, in the above example, local part “john.doe123” can correspond to the username of a user (e.g., named John Doe) that has an email account on the external email server belonging to Yahoo! Inc. Accordingly, for purposes of brevity, the local part is hereinafter referred to as the “username.”


The one or more recipient addresses within the email data can be entered by the user (e.g., from sender device 120 via the email client application) who can specify the addresses, for example, by typing them in manually, or by selecting them from an address book. In some embodiments, the user can designate each recipient addresses as a “TO” address, a “CC” address, or a “BCC” address.


As discussed above, corporate email server 140 can identify, based on the email data, one or more external email servers, and send each of these external email servers a copy of the email data. In some embodiments, corporate email server 140 identifies the external email servers by retrieving the recipient addresses from the email data, and determining (e.g., using a database) which external email servers are associated with the domain parts of the recipient addresses.


As discussed above, in addition to the one or more recipient addresses, the email data can include a sender address. The sender address can be input by the user manually, or it can be automatically added to the email data by either sender device 120 or corporate email server 140. In some embodiments, the sender address can have a local part (a username), an “at” (“@”) sign, and a domain part, similarly to the recipient address, discussed above. In some embodiments, the domain part of the sender address can be associated with and uniquely identify corporate email server 140, either of the employee's company or one of its subsidiaries, parent, or sibling companies, or any other company associated with the employee's company. For example, a domain name associated with corporate email server of corporation Example can be “example.com”. The username in the sender address is associated with the user sending the email data (e.g., a company employee).


In some embodiments, the username in the sender address can correspond to the user's real name. In addition, the username can be formatted in accordance with a predetermined format. The format can dictate, for example, that the username include the first and the last name of the user and be separated by a period (e.g., “john.doe”). As another example, the format can dictate that the username include the first initial and the last name of the user (e.g., “j.doe”) or the first name and the last initial (e.g., “john.d”). Other formatting examples include “john,” “jdoe,” doej,” johnd,” “djohn,” and so forth. In yet other examples, the username can include additional characters such as underscores (“_”), dashes (“-”), digits (e.g., “john.doe1” and “john.doe2” where there are two or more employees named John Doe) or middle initials (again, for the scenario where there are several employees with the same first and last names).


Electronic device 110 can obtain the email that is being sent or was sent through corporate email server 140. In some embodiments, electronic device 110 can receive the email data in real time, simultaneously (or substantially simultaneously) with it being received by corporate email server 140 from sender device 120 and sent over to one or more external email servers 190. In other embodiments, the electronic device can obtain the email data from database 180. Database 180 can be updated (e.g., by corporate email server 140) any time an email is being sent through corporate email server 140, and database 180 can temporarily or permanently store email data of one or more such emails.


Referring now to FIG. 2, a flowchart representing an exemplary method 200 for detecting confidential information emails is presented. Method 200 can be performed by one or more electronic devices, such as electronic device 110. While method 200 and the other following embodiments described herein can be performed by multiple electronic devices, for purposes of simplicity and without limitation, these embodiments will be explained with respect to a single electronic device. While the flowchart discloses the following steps in a particular order, it will be appreciated that at least some of the steps can be moved, modified, or deleted where appropriate, consistent with the teachings of the present disclosure.


At step 210, the electronic device obtains an electronic message (e.g., an email). The electronic message can be obtained from any source, such as a database (e.g., the email database in database 180) that contains one or more electronic messages. After obtaining the electronic message, the electronic device extracts from the electronic message a sender address and one or more recipient addresses. As discussed above, the sender address and the recipient addresses can each include a username portion and a domain name portion.


At step 220, the electronic device determines whether the electronic message was sent from a company address to a non-company address. To make this determination, the electronic device can obtain a list of one or more domain names associated with a given company (or companies associated therewith), or more particularly, domain names associated with one or more corporate email servers associated with the company (or companies associated therewith). The electronic device can then determine whether the domain name portion of the sender address is within the list of domain names associated with the company. If not, the electronic message was probably not sent from a corporate account, and the electronic device can discard this electronic message and end the method.


Still referring to step 220, the electronic device can also determine whether the electronic message has more than one recipient address. Since most suspicious messages are those sent to one recipient, messages that have multiple recipient addresses can be discarded and the electronic device can end the method. In some embodiments (not shown), the electronic device may not discard such messages, accounting for the possibility that the user has several personal accounts and that the user sent confidential information to more than one personal account or to a group of co-conspirators. For brevity purposes, and without limiting the scope of the disclosure, it will be assumed in the following examples that a message with multiple recipients is not a suspicious electronic message and is discarded at step 220.


Still referring to step 220, the electronic device can determine whether the (only) recipient address has a domain name that is within the list of domain names associated with the company. Because this indicates that the message was sent to someone within the company, such message can be discarded and the method can end. It will be appreciated that the above determinations of step 220 can be performed in any order. If the answer to all these determinations is “no,” the method can proceed to step 230.


At step 230, the electronic device can determine whether the username of the sender address does not conform to any predefined format for all usernames associated with the company's employees. If the sender's username does not conform to the predefined company format this can mean, for example, that the message was automatically generated by a company computer. For example, it could be an automatic message sent from a sender address “donotreply@example.com.” So if the username does not conform to the format, the electronic device can discard the electronic message and the method can end. For example, if a company has a predefined format dictating that all company usernames must include a period (“.”), the electronic device can discard all messages whose sender address username does not include a period. Another example of a predefined format can be that all usernames must start with one alphabetic character, must be followed by a period, followed by at least two alphabetic characters, and followed by any number of alphanumeric characters. If the company does not have a predefined format or if the sender's username does conform to the predefined format, the method can proceed to step 240.


At step 240, the electronic device can obtain, based on the sender address, the sender's first name, middle name, last name, and any nicknames (or synonyms) of the first name. In some embodiments, the electronic device can obtain the sender's first, middle, and last names by extracting them from the sender address. For example, if the predefined company format discussed above is <first name>.<last name>@<company domain> then the first and last name (but not the middle name) of the sender can be extracted from the sender address.


In other embodiments, for higher reliability, the electronic device can obtain the first and last name of the sender by querying a database (e.g., the name database) that stores all employee usernames in association with their full names. The electronic device can send to the database the sender's username and receive back the sender's first name, last name, and optionally, a middle name or a middle initial.


Still referring to step 240, the electronic device can also obtain one or more nicknames associated with the sender's first name, for example, by querying a database (e.g., the nickname database). For purposes of brevity, the obtained first name and the obtained nicknames (if any) are collectively referred to as the sender's “first names.” In some embodiments (not shown), in addition to retrieving nicknames for the first name, the electronic device can also obtain nicknames for the sender's middle name, and perform the next steps on nicknames that include the first name, the middle name, and any synonyms thereof.


At step 250, the electronic device can determine whether the recipient's username (the username portion of the recipient address) includes any of sender's first names obtained at step 240 or sender's initials. The electronic device can first remove from the recipient's username any non-alphabetic characters (e.g., digits, punctuation characters, spaces, etc.). The electronic device can then determine whether the remaining username includes sender's last name, and if so, remove the last name from the username. In some embodiments, if the electronic device determines that the last name is not included, it can further determine whether the remaining username either starts or ends with the sender's last initial, and if so, remove the last initial. The electronic device can then determine whether the remaining portion of the username corresponds to any of the first names (which includes any corresponding nicknames) of the sender. If it does, there is a high probability that the sender is sending the message to his own account (on an external email server), because the chances of someone sending a message to another person with the same first name are relatively low. Accordingly, if the remaining portion of the recipient's username corresponds to any of the first names, the electronic device can move to step 280.


If the remaining portion of the username does not contain any of the sender's first names, the electronic device can further determine whether the remaining portion of the username consists only of the sender's first initial (first letter of the first name or any corresponding nickname), of any combination of the sender's first initial and last initial, or of any combination of any two or all three of: the sender's first initial, last initial, and middle initial. If so, the electronic device can move to step 280. Otherwise, the method proceeds to step 260. In some embodiments, before proceeding to step 260, the processor further determines whether the remaining portion of the username includes the sender's first and last initials with one or two other characters (which could be initials) in between, and if so, the electronic device can move to step 280. Otherwise, the method proceeds to step 260.


At step 260, the electronic device can determine whether the username includes some first name other than any of sender's first names. For example, the electronic device can query the name database and/or the nickname databases to obtain all possible first names and their nicknames, and determine whether the remaining portion of the recipient's username includes any of those. If so, the electronic device can discard this message (as the recipient is likely to be a family member) and the method can end. Otherwise, the method proceeds to step 270.


At step 270, the electronic device can determine whether the recipient domain name includes the sender's last name. Because a person may have a personal domain name and personal domain names often include the person's last name (e.g., “smith.com,” “thesmiths.net,” etc.) a recipient domain name including the sender's last name can indicate that the message was sent to the sender's personal account. However, in some embodiments, if the employee has a last name shorter than a predefined threshold (e.g., 4 characters), step 270 can be skipped, as it could result in too many false positives (e.g. a last name “mai” could result in all emails sent to gmail.com being flagged).


If the electronic device determines, at step 270, that the recipient's domain name includes neither the sender's last name, it can discard the electronic message and the method can end. Otherwise, the electronic device can proceed to step 280.


In some embodiments, the electronic device can account for the possibility that the recipient's and/or the sender's first, middle, or last names can be misspelled. In these embodiments, when the electronic device determines in any of the steps of method 200 whether an email address (either recipient's or sender's, either in the username portion or the domain name portion) includes a particular name (either recipient's or sender's, either the last, the first, or the middle name) instead of determining whether the address includes the exact name, the processor can determine whether the address includes a string that is similar to the particular name. For example, the processor can determine whether the address includes a string that is within a predetermined edit distance, such as Levenshtein distance, from the particular name. For example, at step 270, the electronic device can determine whether the recipient domain name includes a string that is within a Levenshtein distance of 2 from the user's last name. Thus, the electronic device can determine that domain name “smitz.com” is similar to the sender's last name Smith, because “smitz” is within a Levenshtein distance of 1 from “smith.” It is appreciated that any string operations (e.g., comparisons) in this and other steps of method 200 may or may not be case sensitive, encoding sensitive, or transliteration sensitive. For example, the processor can determine that the character “U” is equivalent to “u” and to “ü”.


At step 280, the electronic device flags the electronic message. The flagging can include, for example, providing an indication (e.g., to an operator operating the electronic device) that the electronic message is “suspicious” and requires further review. For example, the electronic device can be coupled to a display, and can show on that display information identifying the electronic message (or the entire electronic message), and an indication to the operator that the identified electronic message is suspicious and needs to be evaluated for any confidential content inappropriately sent to an external server. The flagging can also include, for example, storing a copy of the electronic message in a predefined location, modifying the email database to indicate that this particular electronic message is suspicious and needs to be further evaluated, and/or flagging the electronic message as suspicious in an existing alerting or monitoring system. After step 280 the method can end.


After ending method 200, the electronic device can check if there are any additional unprocessed electronic messages in the database (e.g., database 180) and if so, perform method 200 on the next electronic message in the database. Moreover, in order to minimize processing, it is appreciated that method 200 can be performed across multiple electronic messages sent by a single sender address or received by a recipient address. For example, if there are several electronic messages sent by a single sender address to one or more recipient addresses, determination step 250 could be performed for all electronic messages from that single sender address before proceeding to determination step 260, where all remaining messages that have not been reported can be processed.


Furthermore, because, as discussed below, method 200 can be performed by one or more electronic devices, and because method 200 can process each electronic message in isolation, different electronic messages can be processed by different electronic devices, thereby spreading the computational load and reducing latency between the time that a message is sent and the time that method 200 is applied to it. For example, each new message can be given for processing to the first device that is not busy processing another message at the time.


In addition, because the method can determine whether the electronic message is suspicious or not based only on the recipient and/or sender addresses, and does not have to consider the electronic message's subject line, body, attachments, headers or any other information, the method can be performed in a minimal time and with minimal resources, allowing the processing of millions and even billions of emails within reasonable times.


As discussed above, database 180 can, in some embodiments, be implemented as a data fusion system. In some embodiments, electronic device 110 and network 170 can also be included in the data fusion system. FIG. 3 shows, in block diagram form, an exemplary data fusion system 300, consistent with embodiments of the present disclosure. Among other things, system 300 facilitates transformation of one or more data sources, such as data sources 330, into an object model 360, whose semantics are defined by an ontology 350. The transformation can be performed for a variety of reasons. For example, a database administrator can wish to import data from data sources 330 into a database 370 for persistently storing object model 360. As another example, a data presentation component (not depicted) can transform input data from data sources 330 “on the fly” into object model 360. Object model 360 can then be utilized, in conjunction with ontology 350, for analysis through graphs and/or other data visualization techniques.


System 300 comprises a definition component 310 and a translation component 320, both implemented by one or more processors on one or more computing devices executing hardware and/or software-based logic for providing various functionality described herein. As will be appreciated from the present disclosure, system 300 can comprise fewer or additional components that provide various functionalities described herein. Such components are, for clarity, omitted from FIG. 3. Moreover, the component(s) of system 300 responsible for providing various functionalities can further vary from embodiment to embodiment.


Definition component 310 generates and/or modifies ontology 350 and a schema map 340. Exemplary embodiments for defining an ontology (such as ontology 350) are described in U.S. Pat. No. 7,962,495 (the '495 Patent), issued Jun. 14, 2011, the entire contents of which are expressly incorporated herein by reference. Among other things, the '495 patent describes embodiments that define a dynamic ontology for use in creating data in a database. For creating a database ontology, one or more object types are created where each object type can include one or more properties. The attributes of object types or property types of the ontology can be edited or modified at any time. And for each property type, at least one parser definition is created. The attributes of a parser definition can be edited or modified at any time.


In some embodiments, each property type is declared to be representative of one or more object types. A property type is representative of an object type when the property type is intuitively associated with the object type. For example, a property type of “Social Security Number” may be representative of an object type “Person” but not representative of an object type “Business.”


In some embodiments, each property type has one or more components and a base type. In some embodiments, a property type may comprise a string, a date, a number, or a composite type consisting of two or more string, date, or number elements. Thus, property types are extensible and can represent complex data structures. Further, a parser definition can reference a component of a complex property type as a unit or token.


An example of a property having multiple components is a Name property having a Last Name component and a First Name component. An example of raw input data is “Smith, Jane.” An example parser definition specifies an association of imported input data to object property components as follows: {LAST_NAME}, {FIRST_NAME}→Name:Last, Name:First. In some embodiments, the association {LAST_NAME}, {FIRST_NAME} is defined in a parser definition using regular expression symbology. The association {LAST_NAME}, {FIRST_NAME} indicates that a last name string followed by a first name string comprises valid input data for a property of type Name. In contrast, input data of “Smith Jane” would not be valid for the specified parser definition, but a user could create a second parser definition that does match input data of “Smith Jane.” The definition Name:Last, Name:First specifies that matching input data values map to components named “Last” and “First” of the Name property.


As a result, parsing the input data using the parser definition results in assigning the value “Smith” to the Name:Last component of the Name property, and the value “Jane” to the Name:First component of the Name property.


Referring to FIG. 3, schema map 340 can define how various elements of schemas 335 for data sources 330 map to various elements of ontology 350. Definition component 310 receives, calculates, extracts, or otherwise identifies schemas 335 for data sources 330. Schemas 335 define the structure of data sources 330—for example, the names and other characteristics of tables, files, columns, fields, properties, and so forth. Definition component 310 furthermore optionally identifies sample data 336 from data sources 330. Definition component 310 can further identify object type, relationship, and property definitions from ontology 350, if any already exist. Definition component 310 can further identify pre-existing mappings from schema map 340, if such mappings exist.


Based on the identified information, definition component 310 can generate a graphical interface 315. Graphical interface 315 can be presented to users of a computing device via any suitable output mechanism (e.g., a display screen, an image projection, etc.), and can further accept input from users of the computing device via any suitable input mechanism (e.g., a keyboard, a mouse, a touch screen interface). Graphical interface 315 features a visual workspace that visually depicts representations of the elements of ontology 350 for which mappings are defined in schema map 340. Graphical interface 315 also includes controls for adding new elements to schema map 340 and/or ontology 350, including objects, properties of objects, and relationships, via the visual workspace. After elements of ontology 350 are represented in the visual workspace, graphical interface 315 can further provide controls in association with the representations that allow for modifying the elements of ontology 350 and identifying how the elements of ontology 350 correspond to elements of schemas 335. Optionally, the graphical interface 315 can further utilize sample data 336 to provide the user with a preview of object model 360 as the user defines schema map 340. In response to the input via the various controls of graphical interface 315, definition component 310 can generate and/or modify ontology 350 and schema map 340.


In some embodiments, graphical interface 315 can provide an interface providing a user with the ability to add structure to an unstructured document stored in data sources 330 by tagging one or more portions (e.g., text) within the document. Defining tags and applying these tags to a portion of the document can create object, properties, or links creating a relationship between one or more objects and/or properties.


Transformation component 320 can be invoked after schema map 340 and ontology 350 have been defined or redefined. Transformation component 320 identifies schema map 340 and ontology 350. Transformation component 320 further reads data sources 330 and identifies schemas 335 for data sources 330. For each element of ontology 350 described in schema map 340, transformation component 320 iterates through some or all of the data items of data sources 330, generating elements of object model 360 in the manner specified by schema map 340. In some embodiments, transformation component 320 can store a representation of each generated element of object model 360 in a database 370. In some embodiments, transformation component 320 is further configured to synchronize changes in object model 360 back to data sources 330.


Data sources 330 can be one or more sources of data, including, without limitation, spreadsheet files, databases, email folders, document collections, media collections, contact directories, and so forth. Data sources 330 can include structured data (e.g., a database, a .csv file, or any tab delimited or fixed-width file), semi-structured data (e.g., an email, an email server, or forms such as a suspicious activity report or currency transaction report), or unstructured data (e.g., encoded files such as PDF, sound, and image files). Data sources 330 can include data structures stored persistently in non-volatile memory. Data sources 330 can also or alternatively include temporary data structures generated from underlying data sources via data extraction components, such as a result set returned from a database server executing a database query. Data sources 330 can include or be synchronized with external data sources, such as one or more mobile location registers 112 and/or other location registers 116.


In some embodiments, data sources 330 can include any or all of the data of database 180 discussed above in connection with FIG. 1. Thus, data sources 330 can include, for example, the email database, the name database, and the nickname database discussed above.


Schema map 340, ontology 350, and schemas 335 can be stored in any suitable data structure(s), such as XML files, database tables, and so forth. In some embodiments, ontology 350 is maintained persistently. Schema map 340 can or cannot be maintained persistently, depending on whether the transformation process is perpetual or a one-time event. Schemas 335 need not be maintained in persistent memory, but can be cached for optimization.


Object model 360 comprises collections of elements such as typed objects, properties, and relationships. The collections can be structured in any suitable manner. In some embodiments, a database 370 stores the elements of object model 360, or representations thereof. In some embodiments, the elements of object model 360 are stored within database 370 in a different underlying format, such as in a series of object, property, and relationship tables in a relational database.


According to some embodiments, the operations, techniques, and/or components described herein can be implemented by the electronic device (e.g., electronic device 110), which can include one or more special-purpose computing devices. The special-purpose computing devices can be hard-wired to perform the operations, techniques, and/or components described herein, or can include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the operations, techniques and/or components described herein, or can include one or more general purpose hardware processors programmed to perform such features of the present disclosure pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices can also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the technique and other features of the present disclosure. The special-purpose computing devices can be desktop computer systems, portable computer systems, handheld devices, networking devices, or any other device that incorporates hard-wired and/or program logic to implement the techniques and other features of the present disclosure.


The one or more special-purpose computing devices can be generally controlled and coordinated by operating system software, such as iOS, Android, Blackberry, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, VxWorks, or other compatible operating systems. In other embodiments, the computing device can be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.


By way of example, FIG. 4 is a block diagram that illustrates an implementation of electronic device 110, which, as described above, can comprise one or more electronic devices. Electronic device 110 includes a bus 402 or other communication mechanism for communicating information, and one or more hardware processors 404, coupled with bus 402 for processing information. One or more hardware processors 404 can be, for example, one or more general purpose microprocessors.


Electronic device 110 also includes a main memory 406, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 402 for storing information and instructions to be executed by processor 404. Main memory 406 also can be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 404. Such instructions, when stored in non-transitory storage media accessible to one or more processors 404, render electronic device 110 into a special-purpose machine that is customized to perform the operations specified in the instructions.


Electronic device 110 further includes a read only memory (ROM) 408 or other static storage device coupled to bus 402 for storing static information and instructions for processor 404. A storage device 410, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 402 for storing information and instructions.


Electronic device 110 can be coupled via bus 402 to a display 412, such as a cathode ray tube (CRT), an LCD display, or a touchscreen, for displaying information to a computer user. An input device 414, including alphanumeric and other keys, is coupled to bus 402 for communicating information and command selections to processor 404. Another type of user input device is cursor control 416, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 404 and for controlling cursor movement on display 412. The input device typically has two degrees of freedom in two axes, a first axis (for example, x) and a second axis (for example, y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.


Electronic device 110 can include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the one or more computing devices. This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C, and C++. A software module can be compiled and linked into an executable program, installed in a dynamic link library, or written in an interpreted programming language such as, for example, BASIC, Perl, Python, or Pig. It will be appreciated that software modules can be callable from other modules or from themselves, and/or can be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices can be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and can be originally stored in a compressed or installable format that requires installation, decompression, or decryption prior to execution). Such software code can be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions can be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules can be comprised of connected logic units, such as gates and flip-flops, and/or can be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but can be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


Electronic device 110 can implement the techniques and other features described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the electronic device causes or programs electronic device 110 to be a special-purpose machine. According to some embodiments, the techniques and other features described herein are performed by electronic device 110 in response to one or more processors 404 executing one or more sequences of one or more instructions contained in main memory 406. Such instructions can be read into main memory 406 from another storage medium, such as storage device 410. Execution of the sequences of instructions contained in main memory 406 causes processor 404 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry can be used in place of or in combination with software instructions.


The term “non-transitory media” as used herein refers to any media storing data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media can comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 410. Volatile media includes dynamic memory, such as main memory 406. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.


Non-transitory media is distinct from, but can be used in conjunction with, transmission media. Transmission media participates in transferring information between storage media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 402. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.


Various forms of media can be involved in carrying one or more sequences of one or more instructions to processor 404 for execution. For example, the instructions can initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to electronic device 110 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 402. Bus 402 carries the data to main memory 406, from which processor 404 retrieves and executes the instructions. The instructions received by main memory 406 can optionally be stored on storage device 410 either before or after execution by processor 404.


Electronic device 110 also includes a communication interface 418 coupled to bus 402. Communication interface 418 provides a two-way data communication coupling to a network link 420 that is connected to a local network 422. For example, communication interface 418 can be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 418 can be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links can also be implemented. In any such implementation, communication interface 418 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.


Network link 420 typically provides data communication through one or more networks to other data devices. For example, network link 420 can provide a connection through local network 422 to a host computer 424 or to data equipment operated by an Internet Service Provider (ISP) 426. ISP 426 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 428. Local network 422 and Internet 428 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 420 and through communication interface 418, which carry the digital data to and from electronic device 110, are example forms of transmission media.


Electronic device 110 can send messages and receive data, including program code, through the network(s), network link 420 and communication interface 418. In the Internet example, a server 430 might transmit a requested code for an application program through Internet 428, ISP 426, local network 422 and communication interface 418.


The received code can be executed by processor 404 as it is received, and/or stored in storage device 410, or other non-volatile storage for later execution.


Embodiments of the present disclosure have been described herein with reference to numerous specific details that can vary from implementation to implementation. Certain adaptations and modifications of the described embodiments can be made. Other embodiments can be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the present disclosure being indicated by the following claims. It is also intended that the sequence of steps shown in figures are only for illustrative purposes and are not intended to be limited to any particular sequence of steps. As such, those skilled in the art can appreciate that these steps can be performed in a different order while implementing the exemplary methods or processes disclosed herein.

Claims
  • 1. An electronic device comprising: one or more non-transitory computer-readable storage media configured to store instructions; andone or more processors configured to execute the instructions stored on the one or more non-transitory computer-readable storage media to cause the electronic device to, upon one or more headers of an electronic message being received from a sender: obtain a sender address associated with the sender of the electronic message, the sender address comprising a first username and a first domain name;obtain a first name and a last name of the sender or a last initial of the sender from a database;obtain a recipient address of the electronic message, the recipient address comprising a second username and a second domain name that is different from the first domain name;determine, by inspecting the one or more headers of the electronic message, whether the recipient address and the sender address are different addresses of a same user, wherein the determination includes finding a mismatch between the first domain name and the second domain name and a match between at least part of the recipient address and at least part of one or more of: the sender address, the first name of the sender, and the last name of the sender; andbased on determining whether the recipient address and the sender address are different addresses of the same user, flag the electronic message as one sent from and received by the same user;determine whether the electronic message, if delivered, communicates confidential content to an external server based at least on one or more of: a subject, a body, one or more attachments, header information, one or more recipient addresses, or the sender address.
  • 2. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to: determine whether the first username comprises the first name of the sender.
  • 3. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to: performing further analysis of one or more of: the one or more headers, a body, a subject, one or more attachments, one or more recipient addresses, and the sender address.
  • 4. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to determine whether the sender address corresponds to the user's work address based on whether the first username conforms to a predefined format and based on whether the first domain name is within a predetermined list of one or more work domain names.
  • 5. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to determine whether the second domain name is not within a predetermined list of one or more work domain names.
  • 6. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to determine whether the second domain name comprises the last name of the user.
  • 7. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to: determine whether the sender address conforms to a predefined format.
  • 8. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to: determine whether the recipient address comprises a nickname.
  • 9. The electronic device of claim 1, wherein the determination of whether the recipient address and the sender address are different addresses of the same user includes processing addresses that are within a predetermined edit distance from the sender address or the recipient address.
  • 10. A method performed by at least one electronic device comprising one or more processors executing instructions stored on a non-transitory computer-readable storage media configured to store the instructions, the method comprising upon one or more headers of an electronic message being received from a sender: obtaining a sender address associated with the sender of the electronic message, the sender address comprising a first username and a first domain name;obtaining a first name of the sender a last name of the sender, one or more nicknames of the sender or a last initial of the sender from a database storing usernames and names;obtaining a recipient address of the electronic message, the recipient address comprising a second username and a second domain name;determining, by inspecting the one or more headers of the electronic message, whether the recipient address and the sender address are different addresses of a same user wherein the determination includes filtering at least one of: non-alphabetic characters, a last initial of the sender, and the last name of the sender, from the recipient address and comparing the filtered recipient address with at least one of the sender address, the first name of the sender, the last name of the sender, and the one or more nicknames of the sender, and wherein the second domain name of the recipient address is different from the first domain name; andbased on the determination of whether the recipient address and the sender address are different addresses of the same user, flagging the electronic message as one sent from and received by the same user;determining whether the electronic message, if delivered, communicates confidential content to an external server based at least on one or more of: a subject, a body, one or more attachments, header information, one or more recipient addresses, or the sender address.
  • 11. The method of claim 10, further comprising: determining whether the first username comprises the first name of the sender.
  • 12. The method of claim 10, further comprising: determining whether the first username comprises a nickname associated with the first name of the sender.
  • 13. The method of claim 10, further comprising: performing further analysis of one or more of: the one or more headers, a body, a subject, one or more attachments, one or more recipient addresses, and the sender address.
  • 14. The method of claim 10, further comprising determining whether the sender address corresponds to the user's work address based on whether the first username conforms to a predefined format and based on whether the first domain name is within a predetermined list of one or more work domain names.
  • 15. The method of claim 10, further comprising determining whether the second domain name is not within a predetermined list of one or more work domain names.
  • 16. The method of claim 10, further comprising determining whether the second domain name comprises the last name of the user.
  • 17. A non-transitory computer-readable medium storing a set of instructions that are executable by one or more electronic devices, each having one or more processors, to cause the one or more electronic devices to perform a method, the method comprising upon one or more headers of an electronic message being received from a sender: obtaining a sender address associated with the sender of the electronic message, the sender address comprising a first username and a first domain name;obtaining a first name of the sender a last name of the sender, one or more nicknames of the sender or a last initial of the sender from a database storing usernames and names;obtaining a recipient address of the electronic message, the recipient address comprising a second username and a second domain name that is different from the first domain name;determining, by inspecting the one or more headers of the electronic message, whether the recipient address and the sender address are different addresses of a same user wherein the determination includes filtering at least one of: non-alphabetic characters, a last initial of the sender, and the last name of the sender, from the recipient address and comparing the filtered recipient address with at least one of the sender address, the first name of the sender, the last name of the sender, and the one or more nicknames of the sender, wherein the second domain name of the recipient address is different from the first domain name; andbased on the determination of whether the recipient address and the sender address are different addresses of the same user, flagging the electronic message as one sent from and received by the same user;determining whether the electronic message, if delivered, communicates confidential content to an external server based at least on one or more of: a subject, a body, one or more attachments, header information, one or more recipient addresses, or the sender address.
  • 18. The non-transitory computer-readable medium of claim 17, further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to determine whether the first username comprises a nickname associated with the first name of the sender.
  • 19. The non-transitory computer-readable medium of claim 17, further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to perform further analysis of one or more of: the one or more headers, a body, a subject, one or more attachments, one or more recipient addresses, and the sender address.
  • 20. The non-transitory computer-readable medium of claim 17, further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to determine whether the second domain name is not within a predetermined list of one or more work domain names.
  • 21. The non-transitory computer-readable medium of claim 17, further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to determine whether the second domain name comprises the last name of the user.
US Referenced Citations (832)
Number Name Date Kind
5109399 Thompson Apr 1992 A
5329108 Lamoure Jul 1994 A
5632009 Rao et al. May 1997 A
5670987 Doi et al. Sep 1997 A
5781704 Rossmo Jul 1998 A
5798769 Chiu et al. Aug 1998 A
5845300 Comer Dec 1998 A
5978475 Schneier et al. Nov 1999 A
6057757 Arrowsmith et al. May 2000 A
6091956 Hollenberg Jul 2000 A
6161098 Wallman Dec 2000 A
6219053 Tachibana et al. Apr 2001 B1
6232971 Haynes May 2001 B1
6247019 Davies Jun 2001 B1
6253203 O'Flaherty et al. Jun 2001 B1
6279018 Kudrolli et al. Aug 2001 B1
6341310 Leshem et al. Jan 2002 B1
6366933 Ball et al. Apr 2002 B1
6369835 Lin Apr 2002 B1
6374251 Fayyad et al. Apr 2002 B1
6385619 Eichstaedt et al. May 2002 B1
6430305 Decker Aug 2002 B1
6456997 Shukla Sep 2002 B1
6549944 Weinberg et al. Apr 2003 B1
6560620 Ching May 2003 B1
6567936 Yang et al. May 2003 B1
6581068 Bensoussan et al. Jun 2003 B1
6594672 Lampson et al. Jul 2003 B1
6631496 Li et al. Oct 2003 B1
6642945 Sharpe Nov 2003 B1
6674434 Chojnacki et al. Jan 2004 B1
6714936 Nevin, III Mar 2004 B1
6725240 Asad et al. Apr 2004 B1
6775675 Nwabueze et al. Aug 2004 B1
6807569 Bhimani et al. Oct 2004 B1
6820135 Dingman Nov 2004 B1
6828920 Owen et al. Dec 2004 B2
6839745 Dingari et al. Jan 2005 B1
6877137 Rivette et al. Apr 2005 B1
6976210 Silva et al. Dec 2005 B1
6978419 Kantrowitz Dec 2005 B1
6980984 Huffman et al. Dec 2005 B1
6985950 Hanson et al. Jan 2006 B1
7017046 Doyle et al. Mar 2006 B2
7036085 Barros Apr 2006 B2
7043702 Chi et al. May 2006 B2
7055110 Kupka et al. May 2006 B2
7069586 Winneg et al. Jun 2006 B1
7139800 Bellotti et al. Nov 2006 B2
7158878 Rasmussen et al. Jan 2007 B2
7162475 Ackerman Jan 2007 B2
7168039 Bertram Jan 2007 B2
7171427 Witowski et al. Jan 2007 B2
7225468 Waisman et al. May 2007 B2
7269786 Malloy et al. Sep 2007 B1
7278105 Kitts Oct 2007 B1
7290698 Poslinski et al. Nov 2007 B2
7333998 Heckerman et al. Feb 2008 B2
7370047 Gorman May 2008 B2
7373669 Eisen May 2008 B2
7379811 Rasmussen et al. May 2008 B2
7379903 Caballero et al. May 2008 B2
7426654 Adams et al. Sep 2008 B2
7451397 Weber et al. Nov 2008 B2
7454466 Bellotti et al. Nov 2008 B2
7461077 Greenwood Dec 2008 B1
7467375 Tondreau et al. Dec 2008 B2
7487139 Fraleigh et al. Feb 2009 B2
7496567 Steichen Feb 2009 B1
7502786 Liu et al. Mar 2009 B2
7525422 Bishop et al. Apr 2009 B2
7529727 Arning et al. May 2009 B2
7529734 Dirisala May 2009 B2
7558677 Jones Jul 2009 B2
7574409 Patinkin Aug 2009 B2
7574428 Leiserowitz et al. Aug 2009 B2
7579965 Bucholz Aug 2009 B2
7596285 Brown et al. Sep 2009 B2
7614006 Molander Nov 2009 B2
7617232 Gabbert et al. Nov 2009 B2
7620628 Kapur et al. Nov 2009 B2
7627812 Chamberlain et al. Dec 2009 B2
7634717 Chamberlain et al. Dec 2009 B2
7703021 Flam Apr 2010 B1
7706817 Bamrah et al. Apr 2010 B2
7712049 Williams et al. May 2010 B2
7716077 Mikurak May 2010 B1
7725530 Sah et al. May 2010 B2
7725547 Albertson et al. May 2010 B2
7730082 Sah et al. Jun 2010 B2
7730109 Rohrs et al. Jun 2010 B2
7756843 Palmer Jul 2010 B1
7770032 Nesta et al. Aug 2010 B2
7770100 Chamberlain et al. Aug 2010 B2
7774431 Conn Aug 2010 B2
7783658 Bayliss Aug 2010 B1
7801871 Gosnell Sep 2010 B2
7805457 Viola et al. Sep 2010 B1
7809703 Balabhadrapatruni et al. Oct 2010 B2
7814102 Miller et al. Oct 2010 B2
7818658 Chen Oct 2010 B2
7870493 Pall et al. Jan 2011 B2
7894984 Rasmussen et al. Feb 2011 B2
7899611 Downs et al. Mar 2011 B2
7899796 Borthwick et al. Mar 2011 B1
7917376 Bellin et al. Mar 2011 B2
7920963 Jouline et al. Apr 2011 B2
7933862 Chamberlain et al. Apr 2011 B2
7941321 Greenstein et al. May 2011 B2
7962281 Rasmussen et al. Jun 2011 B2
7962495 Jain et al. Jun 2011 B2
7962848 Bertram Jun 2011 B2
7970240 Chao et al. Jun 2011 B1
7971150 Raskutti et al. Jun 2011 B2
7984374 Caro et al. Jul 2011 B2
8001465 Kudrolli et al. Aug 2011 B2
8001482 Bhattiprolu et al. Aug 2011 B2
8010545 Stefik et al. Aug 2011 B2
8015487 Roy et al. Sep 2011 B2
8024778 Cash et al. Sep 2011 B2
8036632 Cona et al. Oct 2011 B1
8036971 Aymeloglu et al. Oct 2011 B2
8037046 Udezue et al. Oct 2011 B2
8046283 Burns Oct 2011 B2
8046362 Bayliss Oct 2011 B2
8054756 Chand et al. Nov 2011 B2
8103543 Zwicky Jan 2012 B1
8134457 Velipasalar et al. Mar 2012 B2
8135679 Bayliss Mar 2012 B2
8135719 Bayliss Mar 2012 B2
8145703 Frishert et al. Mar 2012 B2
8181253 Zaitsev et al. May 2012 B1
8185819 Sah et al. May 2012 B2
8190893 Benson et al. May 2012 B2
8196184 Amirov et al. Jun 2012 B2
8214361 Sandler et al. Jul 2012 B1
8214490 Vos et al. Jul 2012 B1
8214764 Gemmell et al. Jul 2012 B2
8225201 Michael Jul 2012 B2
8229902 Vishniac et al. Jul 2012 B2
8229947 Fujinaga Jul 2012 B2
8230333 Decherd et al. Jul 2012 B2
8239668 Chen et al. Aug 2012 B1
8266168 Bayliss Sep 2012 B2
8271461 Pike et al. Sep 2012 B2
8280880 Aymeloglu et al. Oct 2012 B1
8290838 Thakur et al. Oct 2012 B1
8290926 Ozzie et al. Oct 2012 B2
8290942 Jones et al. Oct 2012 B2
8301464 Cave et al. Oct 2012 B1
8301904 Gryaznov Oct 2012 B1
8302855 Ma et al. Nov 2012 B2
8312367 Foster Nov 2012 B2
8312546 Alme Nov 2012 B2
8321943 Walters et al. Nov 2012 B1
8347398 Weber Jan 2013 B1
8352881 Champion et al. Jan 2013 B2
8368695 Howell et al. Feb 2013 B2
8386377 Xiong et al. Feb 2013 B1
8397171 Klassen et al. Mar 2013 B2
8412707 Mianji Apr 2013 B1
8447674 Choudhuri et al. May 2013 B2
8447722 Ahuja et al. May 2013 B1
8452790 Mianji May 2013 B1
8463036 Ramesh et al. Jun 2013 B1
8473454 Evanitsky et al. Jun 2013 B2
8484115 Aymeloglu et al. Jul 2013 B2
8484168 Bayliss Jul 2013 B2
8489331 Kopf et al. Jul 2013 B2
8489641 Seefeld et al. Jul 2013 B1
8495077 Bayliss Jul 2013 B2
8498969 Bayliss Jul 2013 B2
8498984 Hwang et al. Jul 2013 B1
8510743 Hackborn et al. Aug 2013 B2
8514082 Cova et al. Aug 2013 B2
8515207 Chau Aug 2013 B2
8554579 Tribble et al. Oct 2013 B2
8554653 Falkenborg et al. Oct 2013 B2
8554709 Goodson et al. Oct 2013 B2
8560413 Quarterman Oct 2013 B1
8577911 Stepinski et al. Nov 2013 B1
8589273 Creeden et al. Nov 2013 B2
8595234 Siripuapu et al. Nov 2013 B2
8600872 Yan Dec 2013 B1
8620641 Farnsworth et al. Dec 2013 B2
8639757 Zang et al. Jan 2014 B1
8646080 Williamson et al. Feb 2014 B2
8676857 Adams et al. Mar 2014 B1
8683322 Cooper Mar 2014 B1
8688573 Rukonic et al. Apr 2014 B1
8689108 Duffield et al. Apr 2014 B1
8713467 Goldenberg et al. Apr 2014 B1
8726379 Stiansen et al. May 2014 B1
8739278 Varghese May 2014 B2
8742934 Sarpy et al. Jun 2014 B1
8744890 Bernier Jun 2014 B1
8745516 Mason et al. Jun 2014 B2
8769412 Gill et al. Jul 2014 B2
8781169 Jackson et al. Jul 2014 B2
8782794 Ramcharran Jul 2014 B2
8787939 Papakipos et al. Jul 2014 B2
8788405 Sprague et al. Jul 2014 B1
8788407 Singh et al. Jul 2014 B1
8799799 Cervelli et al. Aug 2014 B1
8806355 Twiss et al. Aug 2014 B2
8812960 Sun et al. Aug 2014 B1
8818892 Sprague et al. Aug 2014 B1
8830322 Nerayoff et al. Sep 2014 B2
8832594 Thompson et al. Sep 2014 B1
8868537 Colgrove et al. Oct 2014 B1
8917274 Ma et al. Dec 2014 B2
8924388 Elliot et al. Dec 2014 B2
8924389 Elliot et al. Dec 2014 B2
8924872 Bogomolov et al. Dec 2014 B1
8931043 Cooper et al. Jan 2015 B2
8937619 Sharma et al. Jan 2015 B2
8938686 Erenrich et al. Jan 2015 B1
8949164 Mohler Feb 2015 B1
9009171 Grossman et al. Apr 2015 B1
9009827 Albertson et al. Apr 2015 B1
9021260 Falk et al. Apr 2015 B1
9021384 Beard et al. Apr 2015 B1
9043696 Meiklejohn et al. May 2015 B1
9043894 Dennison et al. May 2015 B1
9049117 Nucci et al. Jun 2015 B1
9069842 Melby Jun 2015 B2
9100428 Visbal Aug 2015 B1
9111281 Stibel et al. Aug 2015 B2
9116975 Shankar et al. Aug 2015 B2
9129219 Robertson et al. Sep 2015 B1
9135658 Sprague et al. Sep 2015 B2
9146954 Boe et al. Sep 2015 B1
9165299 Stowe et al. Oct 2015 B1
9171334 Visbal et al. Oct 2015 B1
9177344 Singh et al. Nov 2015 B1
9202249 Cohen et al. Dec 2015 B1
9230280 Maag et al. Jan 2016 B1
9256664 Chakerian et al. Feb 2016 B2
9335897 Goldenberg May 2016 B2
9338013 Castellucci et al. May 2016 B2
9619557 Kesin et al. Apr 2017 B2
9875293 Chakerian et al. Jan 2018 B2
9881074 Chakerian et al. Jan 2018 B2
20020029248 Cook Mar 2002 A1
20020033848 Sciammarella et al. Mar 2002 A1
20020065708 Senay et al. May 2002 A1
20020091707 Keller Jul 2002 A1
20020095360 Joao Jul 2002 A1
20020095658 Shulman Jul 2002 A1
20020103705 Brady Aug 2002 A1
20020112157 Doyle et al. Aug 2002 A1
20020116120 Ruiz et al. Aug 2002 A1
20020147805 Leshem et al. Oct 2002 A1
20020174201 Ramer et al. Nov 2002 A1
20020194119 Wright et al. Dec 2002 A1
20030028560 Kudrolli et al. Feb 2003 A1
20030033228 Bosworth-Davies et al. Feb 2003 A1
20030036848 Sheha et al. Feb 2003 A1
20030039948 Donahue Feb 2003 A1
20030074368 Schuetze et al. Apr 2003 A1
20030097330 Hillmer et al. May 2003 A1
20030126102 Borthwick Jul 2003 A1
20030140106 Raguseo Jul 2003 A1
20030144868 MacIntyre et al. Jul 2003 A1
20030163352 Surpin et al. Aug 2003 A1
20030225755 Iwayama et al. Dec 2003 A1
20030229848 Arend et al. Dec 2003 A1
20040032432 Baynger Feb 2004 A1
20040034570 Davis Feb 2004 A1
20040064256 Barinek et al. Apr 2004 A1
20040085318 Hassler et al. May 2004 A1
20040095349 Bito et al. May 2004 A1
20040111410 Burgoon et al. Jun 2004 A1
20040111480 Yue Jun 2004 A1
20040123139 Aiello et al. Jun 2004 A1
20040126840 Cheng et al. Jul 2004 A1
20040143602 Ruiz et al. Jul 2004 A1
20040143796 Lerner et al. Jul 2004 A1
20040153418 Hanweck Aug 2004 A1
20040163039 Gorman Aug 2004 A1
20040193600 Kaasten et al. Sep 2004 A1
20040205524 Richter et al. Oct 2004 A1
20040221223 Yu et al. Nov 2004 A1
20040230577 Kawatani Nov 2004 A1
20040236688 Bozeman Nov 2004 A1
20040250124 Chesla et al. Dec 2004 A1
20040260702 Cragun et al. Dec 2004 A1
20040267746 Marcjan et al. Dec 2004 A1
20050010472 Quatse et al. Jan 2005 A1
20050021635 Graham Jan 2005 A1
20050027705 Sadri et al. Feb 2005 A1
20050028094 Allyn Feb 2005 A1
20050039119 Parks et al. Feb 2005 A1
20050065811 Chu et al. Mar 2005 A1
20050078858 Yao et al. Apr 2005 A1
20050080769 Gemmell Apr 2005 A1
20050086207 Heuer et al. Apr 2005 A1
20050108063 Madill et al. May 2005 A1
20050125715 Di Franco et al. Jun 2005 A1
20050154628 Eckart et al. Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050157662 Bingham et al. Jul 2005 A1
20050162523 Darrell et al. Jul 2005 A1
20050166144 Gross Jul 2005 A1
20050169274 Shuster Aug 2005 A1
20050180330 Shapiro Aug 2005 A1
20050182764 Evans Aug 2005 A1
20050182793 Keenan et al. Aug 2005 A1
20050183005 Denoue et al. Aug 2005 A1
20050204006 Purcell Sep 2005 A1
20050204009 Hazarika Sep 2005 A1
20050210409 Jou Sep 2005 A1
20050222928 Steier et al. Oct 2005 A1
20050229256 Banzhof Oct 2005 A2
20050246327 Yeung et al. Nov 2005 A1
20050251786 Citron et al. Nov 2005 A1
20050262556 Waisman et al. Nov 2005 A1
20050275638 Kolmykov-Zotov et al. Dec 2005 A1
20060026120 Carolan et al. Feb 2006 A1
20060026170 Kreitler et al. Feb 2006 A1
20060026246 Fukuhara Feb 2006 A1
20060031928 Conley et al. Feb 2006 A1
20060059139 Robinson Mar 2006 A1
20060069912 Zheng et al. Mar 2006 A1
20060074881 Vembu et al. Apr 2006 A1
20060080283 Shipman Apr 2006 A1
20060080619 Carlson et al. Apr 2006 A1
20060093222 Saffer et al. May 2006 A1
20060095521 Patinkin May 2006 A1
20060129746 Porter Jun 2006 A1
20060139375 Rasmussen et al. Jun 2006 A1
20060142949 Helt Jun 2006 A1
20060143034 Rothermel Jun 2006 A1
20060143075 Carr et al. Jun 2006 A1
20060143079 Basak et al. Jun 2006 A1
20060149596 Surpin et al. Jul 2006 A1
20060168066 Helsper Jul 2006 A1
20060179003 Steele et al. Aug 2006 A1
20060184889 Molander Aug 2006 A1
20060203337 White Sep 2006 A1
20060209085 Wong et al. Sep 2006 A1
20060212931 Shull et al. Sep 2006 A1
20060218637 Thomas et al. Sep 2006 A1
20060241974 Chao et al. Oct 2006 A1
20060242040 Rader Oct 2006 A1
20060242630 Koike et al. Oct 2006 A1
20060265747 Judge Nov 2006 A1
20060271277 Hu et al. Nov 2006 A1
20060279630 Aggarwal et al. Dec 2006 A1
20070000999 Kubo et al. Jan 2007 A1
20070011150 Frank Jan 2007 A1
20070011304 Error Jan 2007 A1
20070016363 Huang et al. Jan 2007 A1
20070038646 Thota Feb 2007 A1
20070038962 Fuchs et al. Feb 2007 A1
20070057966 Ohno et al. Mar 2007 A1
20070078832 Ott et al. Apr 2007 A1
20070083541 Fraleigh et al. Apr 2007 A1
20070094389 Nussey et al. Apr 2007 A1
20070106582 Baker et al. May 2007 A1
20070112867 Evans et al. May 2007 A1
20070143851 Nicodemus Jun 2007 A1
20070150369 Zivin Jun 2007 A1
20070150801 Chidlovskii et al. Jun 2007 A1
20070156673 Maga Jul 2007 A1
20070162454 D'Albora et al. Jul 2007 A1
20070174760 Chamberlain et al. Jul 2007 A1
20070185867 Maga Aug 2007 A1
20070192122 Routson et al. Aug 2007 A1
20070192265 Chopin et al. Aug 2007 A1
20070198571 Ferguson et al. Aug 2007 A1
20070208497 Downs et al. Sep 2007 A1
20070208498 Barker et al. Sep 2007 A1
20070208736 Tanigawa et al. Sep 2007 A1
20070233709 Abnous Oct 2007 A1
20070240062 Christena et al. Oct 2007 A1
20070266336 Nojima et al. Nov 2007 A1
20070284433 Domenica et al. Dec 2007 A1
20070294200 Au Dec 2007 A1
20070294643 Kyle Dec 2007 A1
20070294766 Mir et al. Dec 2007 A1
20080028100 Adelman Jan 2008 A1
20080040275 Paulsen et al. Feb 2008 A1
20080040684 Crump Feb 2008 A1
20080051989 Welsh Feb 2008 A1
20080052142 Bailey et al. Feb 2008 A1
20080065655 Chakravarthy et al. Mar 2008 A1
20080077597 Butler Mar 2008 A1
20080077642 Carbone et al. Mar 2008 A1
20080082486 Lermant et al. Apr 2008 A1
20080104019 Nath May 2008 A1
20080104063 Gallivan et al. May 2008 A1
20080104407 Horne et al. May 2008 A1
20080126951 Sood et al. May 2008 A1
20080133567 Ames et al. Jun 2008 A1
20080148397 Litvin Jun 2008 A1
20080148398 Mezack et al. Jun 2008 A1
20080155440 Trevor et al. Jun 2008 A1
20080162616 Gross et al. Jul 2008 A1
20080195417 Surpin et al. Aug 2008 A1
20080195608 Clover Aug 2008 A1
20080201580 Savitzky et al. Aug 2008 A1
20080208735 Balet et al. Aug 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080222706 Renaud et al. Sep 2008 A1
20080229422 Hudis et al. Sep 2008 A1
20080249983 Meisels et al. Oct 2008 A1
20080255973 El Wade et al. Oct 2008 A1
20080263468 Cappione et al. Oct 2008 A1
20080267107 Rosenberg Oct 2008 A1
20080276167 Michael Nov 2008 A1
20080278311 Grange et al. Nov 2008 A1
20080288306 MacIntyre et al. Nov 2008 A1
20080288425 Posse et al. Nov 2008 A1
20080294663 Heinley et al. Nov 2008 A1
20080301643 Appleton et al. Dec 2008 A1
20080313132 Hao et al. Dec 2008 A1
20090002492 Velipasalar et al. Jan 2009 A1
20090018940 Wang et al. Jan 2009 A1
20090024505 Patel et al. Jan 2009 A1
20090027418 Maru et al. Jan 2009 A1
20090030915 Winter et al. Jan 2009 A1
20090044279 Crawford et al. Feb 2009 A1
20090055251 Shah et al. Feb 2009 A1
20090082997 Tokman et al. Mar 2009 A1
20090083184 Eisen Mar 2009 A1
20090088964 Schaaf et al. Apr 2009 A1
20090094270 Alirez et al. Apr 2009 A1
20090103442 Douville Apr 2009 A1
20090106178 Chu Apr 2009 A1
20090112745 Stefanescu Apr 2009 A1
20090119309 Gibson et al. May 2009 A1
20090125359 Knapic May 2009 A1
20090125369 Kloosstra et al. May 2009 A1
20090125459 Norton et al. May 2009 A1
20090132921 Hwangbo et al. May 2009 A1
20090132953 Reed et al. May 2009 A1
20090143052 Bates et al. Jun 2009 A1
20090144262 White et al. Jun 2009 A1
20090144274 Fraleigh et al. Jun 2009 A1
20090157732 Hao et al. Jun 2009 A1
20090164934 Bhattiprolu et al. Jun 2009 A1
20090171939 Athsani et al. Jul 2009 A1
20090172511 Decherd et al. Jul 2009 A1
20090172821 Daira et al. Jul 2009 A1
20090177962 Gusmorino et al. Jul 2009 A1
20090179892 Tsuda et al. Jul 2009 A1
20090187464 Bai et al. Jul 2009 A1
20090187546 Whyte et al. Jul 2009 A1
20090187548 Ji et al. Jul 2009 A1
20090192957 Subramanian et al. Jul 2009 A1
20090222400 Kupershmidt et al. Sep 2009 A1
20090222759 Drieschner Sep 2009 A1
20090222760 Halverson et al. Sep 2009 A1
20090228701 Lin Sep 2009 A1
20090234720 George et al. Sep 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090254842 Leacock et al. Oct 2009 A1
20090254970 Agarwal et al. Oct 2009 A1
20090254971 Herz Oct 2009 A1
20090271343 Vaiciulis et al. Oct 2009 A1
20090281839 Lynn et al. Nov 2009 A1
20090287470 Farnsworth et al. Nov 2009 A1
20090292626 Oxford Nov 2009 A1
20090307049 Elliott et al. Dec 2009 A1
20090313463 Pang et al. Dec 2009 A1
20090318775 Michelson et al. Dec 2009 A1
20090319418 Herz Dec 2009 A1
20090319891 MacKinlay Dec 2009 A1
20090328222 Helman et al. Dec 2009 A1
20100005146 Drako Jan 2010 A1
20100011282 Dollard et al. Jan 2010 A1
20100017360 Bansal Jan 2010 A1
20100030722 Goodson et al. Feb 2010 A1
20100031141 Summers et al. Feb 2010 A1
20100042922 Bradeteanu et al. Feb 2010 A1
20100057622 Faith et al. Mar 2010 A1
20100057716 Stefik et al. Mar 2010 A1
20100070523 Delgo et al. Mar 2010 A1
20100070842 Aymeloglu et al. Mar 2010 A1
20100070845 Facemire et al. Mar 2010 A1
20100070897 Aymeloglu et al. Mar 2010 A1
20100077481 Polyakov et al. Mar 2010 A1
20100077483 Stolfo et al. Mar 2010 A1
20100098318 Anderson Apr 2010 A1
20100100957 Graham Apr 2010 A1
20100100963 Mahaffey Apr 2010 A1
20100103124 Kruzeniski et al. Apr 2010 A1
20100106611 Paulsen et al. Apr 2010 A1
20100106752 Eckardt et al. Apr 2010 A1
20100114887 Conway et al. May 2010 A1
20100122152 Chamberlain et al. May 2010 A1
20100125546 Barrett et al. May 2010 A1
20100131457 Heimendinger May 2010 A1
20100131502 Fordham May 2010 A1
20100161735 Sharma Jun 2010 A1
20100162176 Dunton Jun 2010 A1
20100169237 Howard et al. Jul 2010 A1
20100179831 Brown et al. Jul 2010 A1
20100185691 Irmak et al. Jul 2010 A1
20100191563 Schlaifer et al. Jul 2010 A1
20100198684 Eraker et al. Aug 2010 A1
20100199225 Coleman et al. Aug 2010 A1
20100211535 Rosenberger Aug 2010 A1
20100228812 Uomini Sep 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100250412 Wagner Sep 2010 A1
20100262688 Hussain et al. Oct 2010 A1
20100280857 Liu et al. Nov 2010 A1
20100293174 Bennett et al. Nov 2010 A1
20100306029 Jolley Dec 2010 A1
20100306713 Geisner et al. Dec 2010 A1
20100312837 Bodapati Dec 2010 A1
20100313119 Baldwin et al. Dec 2010 A1
20100318924 Frankel et al. Dec 2010 A1
20100321399 Ellren et al. Dec 2010 A1
20100325526 Ellis et al. Dec 2010 A1
20100325581 Finkelstein et al. Dec 2010 A1
20100330801 Rouh Dec 2010 A1
20110004498 Readshaw Jan 2011 A1
20110029526 Knight et al. Feb 2011 A1
20110047159 Baid et al. Feb 2011 A1
20110060753 Shaked et al. Mar 2011 A1
20110060910 Gormish et al. Mar 2011 A1
20110061013 Billicki et al. Mar 2011 A1
20110066933 Ludwig Mar 2011 A1
20110074811 Hanson et al. Mar 2011 A1
20110078055 Faribault et al. Mar 2011 A1
20110078173 Seligmann et al. Mar 2011 A1
20110087519 Fordyce, III et al. Apr 2011 A1
20110093327 Fordyce et al. Apr 2011 A1
20110099133 Chang et al. Apr 2011 A1
20110110633 Erlendsson May 2011 A1
20110117878 Barash et al. May 2011 A1
20110119100 Ruhl et al. May 2011 A1
20110131122 Griffin et al. Jun 2011 A1
20110131279 Karnik Jun 2011 A1
20110131547 Elaasar Jun 2011 A1
20110137766 Rasmussen et al. Jun 2011 A1
20110153384 Horne et al. Jun 2011 A1
20110161096 Buehler et al. Jun 2011 A1
20110167105 Ramakrishnan et al. Jul 2011 A1
20110167493 Song et al. Jul 2011 A1
20110170799 Carrino et al. Jul 2011 A1
20110173032 Payne et al. Jul 2011 A1
20110173093 Psota et al. Jul 2011 A1
20110178842 Rane et al. Jul 2011 A1
20110181598 O'Neall et al. Jul 2011 A1
20110185316 Reid et al. Jul 2011 A1
20110202555 Cordover et al. Aug 2011 A1
20110208565 Ross et al. Aug 2011 A1
20110208724 Jones et al. Aug 2011 A1
20110213655 Henkin Sep 2011 A1
20110218934 Elser Sep 2011 A1
20110218955 Tang Sep 2011 A1
20110219321 Gonzalez et al. Sep 2011 A1
20110219450 McDougal et al. Sep 2011 A1
20110225198 Edwards et al. Sep 2011 A1
20110225650 Margolies et al. Sep 2011 A1
20110231223 Winters Sep 2011 A1
20110238413 Wu et al. Sep 2011 A1
20110238495 Kang Sep 2011 A1
20110238510 Rowen et al. Sep 2011 A1
20110238553 Raj et al. Sep 2011 A1
20110238570 Li et al. Sep 2011 A1
20110246229 Pacha Oct 2011 A1
20110251951 Kolkowtiz Oct 2011 A1
20110258158 Resende et al. Oct 2011 A1
20110258272 Drako Oct 2011 A1
20110270604 Qi et al. Nov 2011 A1
20110270705 Parker Nov 2011 A1
20110270834 Sokolan Nov 2011 A1
20110271349 Kaplan Nov 2011 A1
20110276638 Errico Nov 2011 A1
20110289397 Eastmond et al. Nov 2011 A1
20110289407 Naik et al. Nov 2011 A1
20110289420 Morioka et al. Nov 2011 A1
20110291851 Whisenant Dec 2011 A1
20110295649 Fine Dec 2011 A1
20110307382 Siegel et al. Dec 2011 A1
20110310005 Chen et al. Dec 2011 A1
20110314007 Dassa et al. Dec 2011 A1
20110314024 Chang et al. Dec 2011 A1
20120004904 Shin et al. Jan 2012 A1
20120011238 Rathod Jan 2012 A1
20120011245 Gillette Jan 2012 A1
20120019559 Siler et al. Jan 2012 A1
20120022945 Falkenborg et al. Jan 2012 A1
20120036013 Neuhaus et al. Feb 2012 A1
20120036434 Oberstein Feb 2012 A1
20120050293 Carlhian et al. Mar 2012 A1
20120054284 Rakshit Mar 2012 A1
20120059853 Jagota Mar 2012 A1
20120066166 Curbera et al. Mar 2012 A1
20120066296 Appleton et al. Mar 2012 A1
20120072825 Sherkin et al. Mar 2012 A1
20120075324 Cardno et al. Mar 2012 A1
20120079363 Folting et al. Mar 2012 A1
20120079592 Pandrangi Mar 2012 A1
20120084117 Tavares et al. Apr 2012 A1
20120084118 Bai et al. Apr 2012 A1
20120084135 Nissan et al. Apr 2012 A1
20120084287 Lakshminarayan et al. Apr 2012 A1
20120084866 Stolfo Apr 2012 A1
20120106801 Jackson May 2012 A1
20120110674 Belani et al. May 2012 A1
20120117082 Koperda et al. May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120137235 Ts et al. May 2012 A1
20120144335 Abeln et al. Jun 2012 A1
20120158527 Cannelongo et al. Jun 2012 A1
20120159307 Chung et al. Jun 2012 A1
20120159362 Brown et al. Jun 2012 A1
20120159399 Bastide et al. Jun 2012 A1
20120169593 Mak et al. Jul 2012 A1
20120170847 Tsukidate Jul 2012 A1
20120173381 Smith Jul 2012 A1
20120173985 Peppel Jul 2012 A1
20120180002 Campbell et al. Jul 2012 A1
20120191502 Gross et al. Jul 2012 A1
20120191786 Downing Jul 2012 A1
20120196557 Reich et al. Aug 2012 A1
20120196558 Reich et al. Aug 2012 A1
20120197651 Robinson et al. Aug 2012 A1
20120203708 Psota et al. Aug 2012 A1
20120208636 Feige Aug 2012 A1
20120215784 King et al. Aug 2012 A1
20120215898 Shah et al. Aug 2012 A1
20120218305 Patterson et al. Aug 2012 A1
20120221511 Gibson et al. Aug 2012 A1
20120221553 Wittmer et al. Aug 2012 A1
20120221580 Barney Aug 2012 A1
20120226523 Weiss Sep 2012 A1
20120245976 Kumar et al. Sep 2012 A1
20120246148 Dror Sep 2012 A1
20120254129 Wheeler et al. Oct 2012 A1
20120284345 Costenaro et al. Nov 2012 A1
20120284791 Miller et al. Nov 2012 A1
20120290879 Shibuya et al. Nov 2012 A1
20120296907 Long et al. Nov 2012 A1
20120310831 Harris et al. Dec 2012 A1
20120310838 Harris et al. Dec 2012 A1
20120311684 Paulsen et al. Dec 2012 A1
20120323888 Osann, Jr. Dec 2012 A1
20120330801 McDougal et al. Dec 2012 A1
20120330973 Ghuneim et al. Dec 2012 A1
20130006426 Healey et al. Jan 2013 A1
20130006655 Van Arkel et al. Jan 2013 A1
20130006668 Van Arkel et al. Jan 2013 A1
20130006725 Simanek et al. Jan 2013 A1
20130006916 McBride et al. Jan 2013 A1
20130016106 Yip et al. Jan 2013 A1
20130018796 Kolhatkar et al. Jan 2013 A1
20130019306 Lagar-Cavilla et al. Jan 2013 A1
20130024268 Manickavelu Jan 2013 A1
20130024307 Fuerstenberg et al. Jan 2013 A1
20130024339 Choudhuri et al. Jan 2013 A1
20130024520 Siminoff Jan 2013 A1
20130046635 Grigg et al. Feb 2013 A1
20130046842 Muntz et al. Feb 2013 A1
20130050217 Armitage Feb 2013 A1
20130054306 Bhalla Feb 2013 A1
20130057551 Ebert et al. Mar 2013 A1
20130060786 Serrano et al. Mar 2013 A1
20130061169 Pearcy et al. Mar 2013 A1
20130073377 Heath Mar 2013 A1
20130073454 Busch Mar 2013 A1
20130078943 Biage et al. Mar 2013 A1
20130086482 Parsons Apr 2013 A1
20130096988 Grossman et al. Apr 2013 A1
20130097482 Marantz et al. Apr 2013 A1
20130097709 Basavapatna et al. Apr 2013 A1
20130101159 Chao et al. Apr 2013 A1
20130110746 Ahn May 2013 A1
20130110822 Ikeda et al. May 2013 A1
20130110876 Meijer et al. May 2013 A1
20130110877 Bonham et al. May 2013 A1
20130111320 Campbell et al. May 2013 A1
20130117011 Ahmed et al. May 2013 A1
20130117651 Waldman et al. May 2013 A1
20130132381 Chakrabarti et al. May 2013 A1
20130139268 An et al. May 2013 A1
20130150004 Rosen Jun 2013 A1
20130151148 Parundekar et al. Jun 2013 A1
20130151388 Falkenborg et al. Jun 2013 A1
20130151453 Bhanot et al. Jun 2013 A1
20130157234 Gulli et al. Jun 2013 A1
20130160120 Malaviya et al. Jun 2013 A1
20130166348 Scotto Jun 2013 A1
20130166480 Popescu et al. Jun 2013 A1
20130166550 Buchmann et al. Jun 2013 A1
20130176321 Mitchell et al. Jul 2013 A1
20130179420 Park et al. Jul 2013 A1
20130185245 Anderson Jul 2013 A1
20130185307 El-Yaniv et al. Jul 2013 A1
20130197925 Blue Aug 2013 A1
20130211985 Clark et al. Aug 2013 A1
20130218879 Park Aug 2013 A1
20130224696 Wolfe et al. Aug 2013 A1
20130225212 Khan Aug 2013 A1
20130226318 Procyk Aug 2013 A1
20130226953 Markovich et al. Aug 2013 A1
20130232045 Tai et al. Sep 2013 A1
20130238616 Rose et al. Sep 2013 A1
20130239217 Kindler et al. Sep 2013 A1
20130246170 Gross et al. Sep 2013 A1
20130246537 Gaddala Sep 2013 A1
20130246597 Iizawa Sep 2013 A1
20130251233 Yang et al. Sep 2013 A1
20130208565 Castellanos et al. Oct 2013 A1
20130262527 Hunter et al. Oct 2013 A1
20130263019 Castellanos et al. Oct 2013 A1
20130267207 Hao et al. Oct 2013 A1
20130268520 Fisher et al. Oct 2013 A1
20130276799 Davidson Oct 2013 A1
20130279757 Kephart Oct 2013 A1
20130282696 John et al. Oct 2013 A1
20130290011 Lynn et al. Oct 2013 A1
20130290825 Arndt et al. Oct 2013 A1
20130297619 Chandrasekaran et al. Nov 2013 A1
20130304770 Boero et al. Nov 2013 A1
20130311375 Priebatsch Nov 2013 A1
20130318594 Hoy et al. Nov 2013 A1
20130325859 Porter Dec 2013 A1
20130339218 Subramanian et al. Dec 2013 A1
20140006109 Callioni et al. Jan 2014 A1
20140012796 Petersen et al. Jan 2014 A1
20140013451 Kulka et al. Jan 2014 A1
20140019936 Cohanoff Jan 2014 A1
20140032506 Hoey et al. Jan 2014 A1
20140033010 Richardt et al. Jan 2014 A1
20140040371 Gurevich et al. Feb 2014 A1
20140047319 Eberlein Feb 2014 A1
20140047357 Alfaro et al. Feb 2014 A1
20140058763 Zizzamia et al. Feb 2014 A1
20140058914 Song Feb 2014 A1
20140059038 McPherson et al. Feb 2014 A1
20140059683 Ashley Feb 2014 A1
20140067611 Adachi et al. Mar 2014 A1
20140068487 Steiger et al. Mar 2014 A1
20140074855 Zhao et al. Mar 2014 A1
20140081652 Klindworth Mar 2014 A1
20140095273 Tang et al. Apr 2014 A1
20140095509 Patton Apr 2014 A1
20140108068 Williams Apr 2014 A1
20140108380 Gotz et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140122456 Dies May 2014 A1
20140122501 Shen May 2014 A1
20140123279 Bishop et al. May 2014 A1
20140129261 Bothwell et al. May 2014 A1
20140136285 Carvalho May 2014 A1
20140143009 Brice et al. May 2014 A1
20140149130 Getchius May 2014 A1
20140149272 Hirani et al. May 2014 A1
20140149436 Bahrami et al. May 2014 A1
20140156527 Grigg et al. Jun 2014 A1
20140157172 Peery et al. Jun 2014 A1
20140164502 Khodorenko et al. Jun 2014 A1
20140173712 Ferdinand Jun 2014 A1
20140173738 Condry et al. Jun 2014 A1
20140188895 Wang et al. Jul 2014 A1
20140189536 Lange et al. Jul 2014 A1
20140195515 Baker et al. Jul 2014 A1
20140195887 Ellis et al. Jul 2014 A1
20140214579 Shen et al. Jul 2014 A1
20140222521 Chait Aug 2014 A1
20140222793 Sadkin et al. Aug 2014 A1
20140229554 Grunin Aug 2014 A1
20140244388 Manouchehri et al. Aug 2014 A1
20140258246 Lo Faro et al. Sep 2014 A1
20140267294 Ma Sep 2014 A1
20140267295 Sharma Sep 2014 A1
20140279824 Tamayo Sep 2014 A1
20140283107 Walton et al. Sep 2014 A1
20140310266 Greenfield Oct 2014 A1
20140310282 Sprague et al. Oct 2014 A1
20140316911 Gross Oct 2014 A1
20140333651 Cervelli et al. Nov 2014 A1
20140337772 Cervelli et al. Nov 2014 A1
20140344230 Krause et al. Nov 2014 A1
20140351070 Christner et al. Nov 2014 A1
20140358829 Hurwitz Dec 2014 A1
20140366132 Stiansen et al. Dec 2014 A1
20150019394 Unser et al. Jan 2015 A1
20150039565 Lucas Feb 2015 A1
20150046870 Goldenberg et al. Feb 2015 A1
20150073929 Psota et al. Mar 2015 A1
20150073954 Braff Mar 2015 A1
20150081803 Dick Mar 2015 A1
20150089424 Duffield et al. Mar 2015 A1
20150095773 Gonsalves Apr 2015 A1
20150100897 Sun et al. Apr 2015 A1
20150100907 Erenrich et al. Apr 2015 A1
20150106170 Bonica Apr 2015 A1
20150106379 Elliot et al. Apr 2015 A1
20150128274 Giokas May 2015 A1
20150134599 Banerjee et al. May 2015 A1
20150134666 Gattiker et al. May 2015 A1
20150135256 Hoy May 2015 A1
20150169709 Kara et al. Jun 2015 A1
20150169726 Kara et al. Jun 2015 A1
20150170077 Kara et al. Jun 2015 A1
20150178825 Huerta Jun 2015 A1
20150178877 Bogomolov et al. Jun 2015 A1
20150186532 Agarwal et al. Jul 2015 A1
20150186821 Wang et al. Jul 2015 A1
20150187036 Wang et al. Jul 2015 A1
20150188715 Castelluci et al. Jul 2015 A1
20150188872 White Jul 2015 A1
20150227295 Meiklejohn et al. Aug 2015 A1
20150227518 Kallan Aug 2015 A1
20150229664 Hawthorn et al. Aug 2015 A1
20150235334 Wang et al. Aug 2015 A1
20150242401 Liu Aug 2015 A1
20150248563 Alfarano et al. Sep 2015 A1
20150261847 Ducott et al. Sep 2015 A1
20150324868 Kaftan et al. Nov 2015 A1
20150326601 Grondin et al. Nov 2015 A1
20150338233 Cervelli et al. Nov 2015 A1
20150347903 Saxena et al. Dec 2015 A1
20150370888 Fonseca et al. Dec 2015 A1
20150378996 Kesin et al. Dec 2015 A1
20150379413 Robertson et al. Dec 2015 A1
20160004764 Chakerian et al. Jan 2016 A1
20160004864 Falk et al. Jan 2016 A1
20160028759 Visbal Jan 2016 A1
20160034470 Sprague et al. Feb 2016 A1
20160034545 Shankar et al. Feb 2016 A1
20160048937 Mathura et al. Feb 2016 A1
20170277780 Kesin et al. Sep 2017 A1
20180101594 Chakerian et al. Apr 2018 A1
Foreign Referenced Citations (63)
Number Date Country
2014250678 Feb 2016 AU
101729531 Jun 2010 CN
102546446 Jul 2012 CN
103167093 Jun 2013 CN
103281301 Sep 2013 CN
102054015 May 2014 CN
102014103482 Sep 2014 DE
102014204827 Sep 2014 DE
102014204830 Sep 2014 DE
102014204834 Sep 2014 DE
102014215621 Feb 2015 DE
1191463 Mar 2002 EP
1672527 Jun 2006 EP
1962222 Aug 2008 EP
2487610 Aug 2012 EP
2551799 Jan 2013 EP
2555153 Feb 2013 EP
2560134 Feb 2013 EP
2778977 Sep 2014 EP
2835745 Feb 2015 EP
2835770 Feb 2015 EP
2838039 Feb 2015 EP
2846241 Mar 2015 EP
2851852 Mar 2015 EP
2858014 Apr 2015 EP
2858018 Apr 2015 EP
2863326 Apr 2015 EP
2863346 Apr 2015 EP
2869211 May 2015 EP
2881868 Jun 2015 EP
2884439 Jun 2015 EP
2884440 Jun 2015 EP
2889814 Jul 2015 EP
2891992 Jul 2015 EP
2892197 Jul 2015 EP
2897051 Jul 2015 EP
2911078 Aug 2015 EP
2911100 Aug 2015 EP
2963577 Jan 2016 EP
2963578 Jan 2016 EP
2963595 Jan 2016 EP
2985974 Feb 2016 EP
2985974 Apr 2018 EP
2516155 Jan 2015 GB
2518745 Apr 2015 GB
2012778 Nov 2014 NL
2013306 Feb 2015 NL
2011642 Aug 2015 NL
624557 Dec 2014 NZ
WO 2000009529 Feb 2000 WO
WO 2002065353 Aug 2002 WO
WO 2005010685 Feb 2005 WO
WO 2005104736 Nov 2005 WO
WO 20050116851 Dec 2005 WO
WO 2008011728 Jan 2008 WO
WO 2008064207 May 2008 WO
WO 2008113059 Sep 2008 WO
WO 2009061501 May 2009 WO
WO 2010000014 Jan 2010 WO
WO 2010030913 Mar 2010 WO
WO 2013010157 Jan 2013 WO
WO 2013102892 Jul 2013 WO
WO 2013126281 Aug 2013 WO
Non-Patent Literature Citations (150)
Entry
US 8,712,906 B1, 04/2014, Sprague et al. (withdrawn)
Appacts, “Smart Thinking for Super Apps,”, http://www.appacts.com, accessed online on Jul. 18, 2013 (4 pages).
Apsalar, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots, http://apsalar.com, accessed online on Jul. 18, 2013 (8 pages).
Capptain—Pilot Your Apps, <http://www.capptain.com, accessed online on Jul. 18, 2013 (6 pages).
Countly Mobile Analytics, <http://count.ly/>, accessed online on Jul. 18, 2013 (9 pages).
Distimo—App Analytics, <http://www.distimo.com/app-analytics>, accessed online on Jul. 18, 2013 (5 pages).
Flurry Analytics, <http://www.flurry.com/>, accessed online on Jul. 18, 2013 (14 pages).
Google Analytics Official Website—Web Analytics & Reporting, <http://www.google.com/analytics.index.html>, accessed online on Jul. 18, 2013 (22 pages).
Kontagent Mobile Analytics, <http://www.kontagent.com/>, accessed online on Jul. 18, 2013 (9 pages).
Localytics—Mobile App Marketing & Analytics, <http://www.localytics.com/>, accessed online on Jul. 18, 2013 (12 pages).
Mixpanel—Mobile Analytics, <https://mixpanel.com/>, accessed online on Jul. 18, 2013 (13 pages).
Open Web Analytics (OWA), <http://www.openwebanalytics.com/>, accessed online on Jul. 19, 2013 (5 pages).
Piwik—Free Web Analytics Software, <http://piwik.org/>, accessed online on Jul. 19, 2013 (18 pages).
StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, <http://statcounter.com/>, accessed online on Jul. 19, 2013 (17 pages).
TestFlight—Beta Testing on the Fly, <http://testflightapp.com/>, accessed online on Jul. 18, 2013 (3 pages).
trak.io, <http://trak.io/>, accessed online on Jul. 18, 2013 (3 pages).
UserMetrix, <http://usermetrix.com/android-analytics/>, accessed online on Jul. 18, 2013 (3 pages).
Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.
Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-c553-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015.
Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8.
Cohn et al., “Semi-supervised Clustering with User Feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1, 2003, pp. 17-32.
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation,” Grant 98-IJ-CX-K005, May 6, 2002, 37 pages.
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32.
Hansen et al. “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services” HiPC 2006, LNCS 4297, pp. 277-288, 2006.
“HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages.
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages.
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages.
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.
“Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015.
Sigrist et al., “Prosite, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research 38.Suppl 1, 2010, pp. D161-D166.
Valentini et al., “Ensembles of Learning Machines,” M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20.
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].
Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages.
Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748.
Notice of Allowance for U.S. Appl. No. 14/479,863 dated Mar. 31, 2015.
Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/319,161 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/323,935 dated Oct. 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/552,336 dated Nov. 3, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.
Official Communication for U.S. Appl. No. 14/451,221 dated Oct. 21, 2014.
Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated Nov. 13, 2014.
Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014.
Official Communication for U.S. Appl. No. 14/479,863 dated Dec. 26, 2014.
Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated May 21, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Jul. 30, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 24, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015.
Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 11, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/813,749 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/746,671 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/141,252 dated Oct. 8, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Oct. 9, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Oct. 28, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Oct. 29, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/746,671 dated Nov. 12, 2015.
Official Communication for U.S. Appl. No. 14/842,734 dated Nov. 19, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 3, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Dec. 9, 2015.
Official Communication for U.S. Appl. No. 14/800,447 dated Dec. 10, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Dec. 21, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.
Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015.
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.
Official Communication for European Patent Application No. 14200246.8 dated May 29, 2015.
Official Communication for European Patent Application No. 15181419.1 dated Sep. 29, 2015.
Official Communication for European Patent Application No. 15184764.7 dated Dec. 14, 2015.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014.
Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Sep. 29, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Oct. 6, 2014.
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015.
Official Communication for Netherlands Patents Application No. 2012421 dated Sep. 18, 2015.
Official Communication for Netherlands Patents Application No. 2012417 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application 2012438 dated Sep. 21, 2015.
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014.
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014.
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.
Baker et al., “The Development of a Common Enumeration of Vulnerabilities and Exposures,” Presented at the Second International Workshop on Recent Advances in Intrusion Detection, Sep. 7-9, 1999, pp. 35.
Bhuyan et al., “Network Anomaly Detection: Methods, Systems and Tools,” First Quarter 2014, IEEE.
Crosby et al., “Efficient Data Structures for Tamper-Evident Logging,” Department of Computer Science, Rice University, 2009, pp. 17.
FireEye, <http://www.fireeye.com/> Printed Jun. 30, 2014 in 2 pages.
FireEye—Products and Solutions Overview, <http://www.fireeye.com/products-and-solutions> Printed Jun. 30, 2014 in 3 pages.
Glaab et al., “EnrichNet: Network-Based Gene Set Enrichment Analysis,” Bioinformatics 28.18 (2012): pp. i451-i457.
Hur et al., “SciMiner: web-based literature mining tool for target identification and functional enrichment analysis,” Bioinformatics 25.6 (2009): pp. 838-840.
Lee et al., “A Data Mining and CIDF Based Approach for Detecting Novel and Distributed Intrusions,” Lecture Notes in Computer Science, vol. 1907 Nov. 11, 2000, pp. 49-65.
Ma et al., “A New Approach to Secure Logging,” ACM Transactions on Storage, vol. 5, No. 1, Article 2, Published Mar. 2009, 21 pages.
Schneier et al., “Automatic Event Stream Notarization Using Digital Signatures,” Security Protocols, International Workshop Apr. 1996 Proceedings, Springer-Veriag, 1997, pp. 155-169, https://schneier.com/paper-event-stream.pdf.
Schneier et al., “Cryptographic Support for Secure Logs on Untrusted Machines,” The Seventh USENIX Security Symposium Proceedings, USENIX Press, Jan. 1998, pp. 53-62, https://www.schneier.com/paper-secure-logs.pdf.
VirusTotal—About, <http://www.virustotal.com/en/about/> Printed Jun. 30, 2014 in 8 pages.
Waters et al., “Building an Encrypted and Searchable Audit Log,” Published Jan. 9, 2004, 11 pages, http://www.parc.com/content/attachments/building_encrypted_searchable_5059_parc.pdf.
Zheng et al., “Goeast: A web-based software toolkit for Gene Ontology enrichment analysis,” Nucleic acids research 36.suppl 2 (2008): pp. W385-W363.
Official Communication for European Patent Application No. 14199180.2 dated Jun. 22, 2015.
Official Communication for European Patent Application No. 14199180.2 dated Aug. 31, 2015.
Official Communication for European Patent Application No. 15175106.2 dated Nov. 5, 2015.
Official Communication for European Patent Application No. 15180985.2 dated Jan. 15, 2016.
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.
Notice of Allowance for U.S. Appl. No. 14/223,918 dated Jan. 6, 2016.
Notice of Allowance for U.S. Appl. No. 14/033,076 dated Mar. 11, 2016.
Notice of Allowance for U.S. Appl. No. 14/823,935 dated Apr. 25, 2016.
Notice of Allowance for U.S. Appl. No. 14/970,317 dated May 26, 2016.
Official Communication for U.S. Appl. No. 14/280,490 dated Jul. 24, 2014.
Official Communication for U.S. Appl. No. 14/490,612 dated Jan. 27, 2015.
Official Communication for U.S. Appl. No. 14/490,612 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/223,918 dated Jun. 8, 2015.
Official Communication for U.S. Appl. No. 14/823,935 dated Dec. 4, 2015.
Official Communication for U.S. Appl. No. 14/970,317 dated Mar. 21, 2016.
Official Communication for U.S. Appl. No. 14/982,699 dated Mar. 25, 2016.
Official Communication for U.S. Appl. No. 14/816,748 dated Apr. 1, 2016.
Official Communication for U.S. Appl. No. 14/923,712 dated Feb. 12, 2016.
Official Communication for U.S. Appl. No. 14/731,312 dated Apr. 14, 2016.
Official Communication for U.S. Appl. No. 14/816,748 dated May 24, 2016.
Official Communication for U.S. Appl. No. 15/071,064 dated Jun. 16, 2016.
Definition “Identify”, downloaded Jan. 22, 2015, 1 page.
Definition “Overlay”, downloaded Jan. 22, 2015, 1 page.
About 80 Minutes, “Palantir in a Number of Parts—Part 6—Graph,” Mar. 21, 2013, pp. 1-6.
Conner, Nancy, “Google Apps: The Missing Manual,” May 1, 2008, pp. 15.
Gesher, Ari, “Palantir Screenshots in the Wild: Swing Sightings,” The Palantir Blog, Sep. 11, 2007, pp. 1-12.
Nolan et al., “MCARTA: A Malicious Code Automated Run-Time Analysis Framework,” Homeland Security, 2012 IEEE Conference on Technologies for, Nov. 13, 2012, pp. 13-17.
Palantir Technologies, “Palantir Labs—Timeline,” Oct. 1, 2010, retrieved from the internet https://www.youtube.com/watch?v=JCgDW5bru9M.
Perdisci et al., “Behavioral Clustering of HTTP-Based Malware and Signature Generation Using Malicious Network Traces,” USENIX, Mar. 18, 2010, pp. 1-14.
Shi et al., “A Scalable Implementation of Malware Detection Based on Network Connection Behaviors,” 2013 International Conference on Cyber-Enabled Distributed Computing Knowledge Discovery, IEEE, Oct. 10, 2013, pp. 59-66.
Wright et al., “Palantir Technologies VAST 2010 Challenge Text Records_ Investigations into Arms Dealing,” Oct. 29, 2010, pp. 1-10.
Related Publications (1)
Number Date Country
20150188872 A1 Jul 2015 US