Patents by Inventor Matthew N. Roy
Matthew N. Roy has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9330144Abstract: Returning a tagged facet tree to an end user who is only authorized to access an authorized portion of the facet tree is provided. A facet tree is received from a facet tree database. A first rule for the facet tree and a second rule for a plurality of tagging scenarios based on a characteristic of the end user is acquired. The first rule is applied to the facet tree before presentation to the end user on a user interface such that only the authorized portion of the facet tree is displayed to the end user. The second rule is applied to the plurality of tagging scenarios such that only a tagging scenario that is applicable to the characteristic of the end user is displayed to the end user. The tagging scenario is made available to the end user at a user interface.Type: GrantFiled: June 10, 2015Date of Patent: May 3, 2016Assignee: International Business Machines CorporationInventors: Joel C. Acevedo-Aviles, Mario G. Ceste, Jr., John H. Handy-Bosma, J. Christopher Hawley, Raymond Lee, Matthew N. Roy
-
Publication number: 20150278313Abstract: Returning a tagged facet tree to an end user who is only authorized to access an authorized portion of the facet tree is provided. A facet tree is received from a facet tree database. A first rule for the facet tree and a second rule for a plurality of tagging scenarios based on a characteristic of the end user is acquired. The first rule is applied to the facet tree before presentation to the end user on a user interface such that only the authorized portion of the facet tree is displayed to the end user. The second rule is applied to the plurality of tagging scenarios such that only a tagging scenario that is applicable to the characteristic of the end user is displayed to the end user. The tagging scenario is made available to the end user at a user interface.Type: ApplicationFiled: June 10, 2015Publication date: October 1, 2015Inventors: Joel C. Acevedo-Aviles, Mario G. Ceste, JR., John H. Handy-Bosma, J. Christopher Hawley, Raymond Lee, Matthew N. Roy
-
Patent number: 7962558Abstract: The identity of the sender of an e-mail message is verified by performing a plurality of tests on DNS information. The DNS information is based on a client IP address or a sender address. Each test performed has a corresponding intrinsic confidence value representing the degree of confidence the test provides of the sender identity relationship. If multiple tests are successful the test result with the highest confidence value of the hierarchy of confidence values is used. The confidence value is optionally used in subsequent identity tests as specified by the subsequent test.Type: GrantFiled: March 3, 2009Date of Patent: June 14, 2011Assignee: International Business Machines CorporationInventors: Mathew A. Nelson, Matthew N. Roy
-
Publication number: 20090164598Abstract: The identity of the sender of an e-mail message is verified by performing a plurality of tests on DNS information. The DNS information is based on a client IP address or a sender address. Each test performed has a corresponding intrinsic confidence value representing the degree of confidence the test provides of the sender identity relationship. If multiple tests are successful the test result with the highest confidence value of the hierarchy of confidence values is used. The confidence value is optionally used in subsequent identity tests as specified by the subsequent test.Type: ApplicationFiled: March 3, 2009Publication date: June 25, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mathew A. Nelson, Matthew N. Roy
-
Patent number: 7529802Abstract: The identity of the sender of an e-mail message is verified by performing a plurality of tests on DNS information. The DNS information is based on a client IP address or a sender address. Each test performed has a corresponding intrinsic confidence value representing the degree of confidence the test provides of the sender identity relationship. If multiple tests are successful the test result with the highest confidence value of the hierarchy of confidence values is used. The confidence value is optionally used in subsequent identity tests as specified by the subsequent test.Type: GrantFiled: June 16, 2004Date of Patent: May 5, 2009Assignee: International Business Machines CorporationInventors: Mathew A. Nelson, Matthew N. Roy
-
Patent number: 7519599Abstract: Disclosed are a method and system for scalable distribution of semantic web updates. A first embodiment of the invention leverages publish/subscribe technology to distribute those updates such that clients receive only the information they require. A second embodiment of the invention uses an access control feature to limit the statements clients are allowed to read. Optionally, in this second embodiment, the same publish/subscribe messaging infrastructure may be used both to distribute updated semantic web data, and also to distribute relevant changes to the access control information. The invention is particularly well suited for use with the Resource Description Framework (RDF) language.Type: GrantFiled: June 12, 2006Date of Patent: April 14, 2009Assignee: International Business Machines CorporationInventors: Joseph P. Betz, Matthew N. Roy, Christopher R. Vincent
-
Patent number: 7519917Abstract: A method, apparatus, and computer program product for graphically presenting compatible workflow steps to a user through a graphical user interface are disclosed. The method includes graphically displaying a plurality of steps in a workflow. A user's selection for at least one step in a plurality of steps to denote at least one selected step and at least one non-selected step is received. The method further includes determining if a set of one or more output parameters of the selected step is acceptable as an input of the non-selected step. An appearance of the non-selected step is graphically changed if the output parameters are acceptable. The method also includes determining if a set of one or more output parameters of the non-selected step is acceptable as an input of the selected step. An appearance of the non-selected step is graphically changed if the output parameters are acceptable.Type: GrantFiled: January 3, 2006Date of Patent: April 14, 2009Assignee: International Business Machines CorporationInventors: Alister D. Lewis-Bowen, Sean J. Martin, Simon L. Martin, Rouben Meschian, Matthew N. Roy, Dan Smith, Benjamin H. Szekely, Elias J. Torres, Louis M. Weitzman
-
Publication number: 20080288442Abstract: A method and system are disclosed for indexing a set of statements, such as RDF statements, that are described in accordance with a specified ontology. The method comprises the steps of defining a set of indexing rules, and using these indexing rules to examine the statements to identify selected ones of the statements and to generate one or more indices from said selected ones of the statements. In a preferred embodiment, the rules match certain predicates of RDF statements to certain indices. Also, preferably, an RDF storage system may be configured with said set of indexing rules. When RDF statements are added to the RDF storage system, each statement is examined by the indexing subsystem. If the predicate of a statement matches one of the predicates of said set of indexing rules, that rule is applied to the statement.Type: ApplicationFiled: May 14, 2007Publication date: November 20, 2008Applicant: International Business Machines CorporationInventors: Lee Feigenbaum, Matthew N. Roy, Benjamin H. Szekely, Wing C. Yung
-
Publication number: 20080126987Abstract: Disclosed are a method, user interface, and computer readable medium for graphically representing compatible workflow components to a user. The method includes graphically displaying, in a graphical user interface, a plurality of steps in a workflow. A user's selection is received, wherein the selection is for at least one step in the plurality of steps The user's selection denotes at least one selected step. At least a portion of the graphical user interface is dynamically populated for displaying a list with at least one workflow component that is compatible to accept an output from the selected step. The list can also display at least one workflow component that can provide an output to the selected step. The workflow component is selectable by the user so that it can be added to the workflow.Type: ApplicationFiled: September 19, 2006Publication date: May 29, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rouben Meschian, Matthew N. Roy, Benjamin H. Szekely
-
Publication number: 20080077628Abstract: Disclosed are a method, information processing system, and computer readable medium for managing data conflicts in a remote shared data store. The method includes receiving at least one modification request for a set of data elements stored in shared data storage. A unique identifier is generated for at least one of the modification request and a user interface element used to perform a modification associated with the modification request. A unique identifier associated with each data element to be modified is identified. A current state of the set of data elements is analyzed. A precondition value associated with the modification request is generated based on the current state of the set of data elements. The unique identifier of each data element is associated with the modification request. A transaction request associated with the modification request is sent to a server information processing system communicatively coupled to the shared data storage.Type: ApplicationFiled: September 22, 2006Publication date: March 27, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert N. Gonzalez, Sean J. Martin, Rouben Meschian, Matthew N. Roy, Elias D. Torres
-
Publication number: 20080005278Abstract: Disclosed are a method and system for scalable distribution of semantic web updates. A first embodiment of the invention leverages publish/subscribe technology to distribute those updates such that clients receive only the information they require. A second embodiment of the invention uses an access control feature to limit the statements clients are allowed to read. Optionally in this second embodiment, the same publish/subscribe messaging infrastructure may be used both to distribute updated semantic web data and also to distribute relevant changes to the access control information. The invention is particularly well suited for use with the Resource Description Framework (RDF) language.Type: ApplicationFiled: June 12, 2006Publication date: January 3, 2008Inventors: Joseph P. Betz, Matthew N. Roy, Christopher R. Vincent
-
Patent number: 7197533Abstract: A system, method and computer-readable medium are disclosed for providing support for a non-persistent service. According to a preferred method, a request for a transaction associated with a non-persistent service is received. It is determined whether the transaction can be executed, and a message associated with the request is placed in a queue. If the transaction can be executed, the message is sent to the non-persistent service and removed the message from the queue. Preferably, if the transaction cannot be executed, the message is removed from the queue without being sent to the non-persistent service. Also provided is a web application server that includes a queue for storing a message associated with a request for a transaction associated with a non-persistent service, and an interface for sending the message to the non-persistent service if the web application server can execute the transaction.Type: GrantFiled: January 24, 2003Date of Patent: March 27, 2007Assignee: International Business Machines CorporationInventors: Christopher R. Vincent, Matthew N. Roy
-
Publication number: 20040177111Abstract: A system, method and computer-readable medium are disclosed for providing support for a non-persistent service. According to a preferred method, a request for a transaction associated with a non-persistent service is received. It is determined whether the transaction can be executed, and a message associated with the request is placed in a queue. If the transaction can be executed, the message is sent to the non-persistent service and removed the message from the queue. Preferably, if the transaction cannot be executed, the message is removed from the queue without being sent to the non-persistent service. Also provided is a web application server that includes a queue for storing a message associated with a request for a transaction associated with a non-persistent service, and an interface for sending the message to the non-persistent service if the web application server can execute the transaction.Type: ApplicationFiled: January 24, 2003Publication date: September 9, 2004Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Christopher R. Vincent, Matthew N. Roy