Patents by Inventor David Konopnicki

David Konopnicki 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).

  • Publication number: 20180268300
    Abstract: A computerized method comprising receiving, from a question answering system, a minimal answer value to a query submitted by a user. Also received are electronic documents based on the minimal answer value, and a document score value, associated with the query, for each of the electronic documents. The method comprises extracting entities and attributes from electronic documents, and for each computing one or more associated score value, and aggregating the document score value with the associated score values. The method comprises selecting some of entities and attributes based on the respective aggregated score value, thereby producing selected associated elements. The method comprises generating, using a computerized natural language (NL) generating system, a comprehensive NL answer, wherein the generating is based on the minimal answer value and the selected associated elements, and sending the comprehensive NL answer for presentation to the user.
    Type: Application
    Filed: March 15, 2017
    Publication date: September 20, 2018
    Inventors: David KONOPNICKI, Priscilla Santos Moraes
  • Patent number: 10019525
    Abstract: A method, computer system, and computer program product for generating a multi-document summary is provided. The embodiment may include receiving a query statement, one or more documents, one or more summary constraints, and quality goals. The embodiment may include identifying one or more keywords within the query statement. The embodiment may include performing a sentence selection from the one or more documents based on the one or more identified keywords. The embodiment may include generating a plurality of candidate summaries of the one or more documents based on the performed sentence selection, the goals, and a cross entropy method. The embodiment may include calculating a quality score for each of the plurality of generated candidate summaries using a plurality of quality features. The embodiment may include selecting a candidate summary from the plurality of generated candidate summaries with the highest calculated quality score that also satisfies a quality score threshold.
    Type: Grant
    Filed: December 15, 2017
    Date of Patent: July 10, 2018
    Assignee: International Business Machines Corporation
    Inventors: Odellia Boni, Guy Feigenblat, David Konopnicki, Haggai Roitman
  • Publication number: 20180012230
    Abstract: Embodiments of the present invention provide systems and methods for detecting emotions with social media settings. Integral-based, emotion-based, and temporal-based features are used to assess the context of a dialogue between two parties. Social media features and textual features are also considered in order to detect the emotions of a party by assessing the popularity of the party and non-contextual factors within the dialogue, respectively.
    Type: Application
    Filed: July 11, 2016
    Publication date: January 11, 2018
    Inventors: Guy Feigenblat, Jonathan Herzig, David Konopnicki, Michal Shmueli-Scheuer
  • Patent number: 9697276
    Abstract: A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.
    Type: Grant
    Filed: December 29, 2014
    Date of Patent: July 4, 2017
    Assignee: International Business Machines Corporation
    Inventors: Gadi Aleksandrowicz, Doron Cohen, David Konopnicki, Oded Margalit, Haggai Roitman, Dafna Sheinwald, Michal Shmueli-Scheuer
  • Publication number: 20170032018
    Abstract: A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.
    Type: Application
    Filed: December 29, 2014
    Publication date: February 2, 2017
    Inventors: Gadi Aleksandrowicz, Doron Cohen, David Konopnicki, Oded Margalit, Haggai Roitman, Dafna Sheinwald, Michal Shmueli-Scheuer
  • Patent number: 9230083
    Abstract: Securing application information in a shared, system-wide search service, in which each application can register a security filtering module that is to be used at search time to filter data associated with that application. Initial, unfiltered search results are obtained based on the contents of the shared search index, and are organized by application. Previously registered filter modules are called to perform user specific, per-application filtering on the initial results, such that data to which the user issuing the search request does not have access is removed from the search results, resulting in a set of filtered search results that are presented to the user and that contain indications only of data that is accessible to the user.
    Type: Grant
    Filed: November 30, 2014
    Date of Patent: January 5, 2016
    Assignee: International Business Machines Corporation
    Inventors: David A. Brooks, David Konopnicki, Laurent D. Hasson, Igor L. Belakovskiy
  • Publication number: 20150088854
    Abstract: A system for securing application information in a shared, system-wide search service. Each application can register a security filtering module that is to be used at search time to filter data associated with that application. When a user performs a search, initial, unfiltered search results are obtained based the contents of the shared search index. The unfiltered search results are organized by application, and previously registered filter modules are called to perform user specific, per-application filtering on the initial results. The filter modules cause data to which the user issuing the search request does not have access to be removed from the search results, on a per application basis. Those of the initial search results that are determined in this way to not be accessible to the user issuing the search request are removed, resulting in a set of filtered search results that are presented to the user. The filtered search results thus contain indications only of data that is accessible to the user.
    Type: Application
    Filed: November 30, 2014
    Publication date: March 26, 2015
    Inventors: David A. Brooks, David Konopnicki, Laurent D. Hasson, Igor L. Belakovskiy
  • Patent number: 8938474
    Abstract: A system for securing application information in a shared, system-wide search service. Each application can register a security filtering module that is to be used at search time to filter data associated with that application. When a user performs a search, initial, unfiltered search results are obtained based the contents of the shared search index. The unfiltered search results are organized by application, and previously registered filter modules are called to perform user specific, per-application filtering on the initial results. The filter modules cause data to which the user issuing the search request does not have access to be removed from the search results, on a per application basis. Those of the initial search results that are determined in this way to not be accessible to the user issuing the search request are removed, resulting in a set of filtered search results that are presented to the user. The filtered search results thus contain indications only of data that is accessible to the user.
    Type: Grant
    Filed: August 7, 2006
    Date of Patent: January 20, 2015
    Assignee: International Business Machines Corporation
    Inventors: David A. Brooks, David Konopnicki, Laurent D. Hasson, Igor L. Belakovskiy
  • Patent number: 8140507
    Abstract: A method and system are provided for searching across independent applications. A first seedlist (202) is provided from a first application (201), the first seedlist (202) including a list of data items (211) for crawling by a search engine (220). The data items (211) are owned by the first application (201). A second seedlist (206) is also provided from a second independent application (205), the second seedlist (206) including annotation data (214) for crawling by a search engine (220). The annotation data (214) relates to the data items (211) of the first application (201). A search index (204) provides searchable data from the two or more applications (201, 205), the searchable data relating to the same set of data items (211).
    Type: Grant
    Filed: July 2, 2007
    Date of Patent: March 20, 2012
    Assignee: International Business Machines Corporation
    Inventors: Laurent Hasson, David Konopnicki
  • Patent number: 8041652
    Abstract: A method, system, and computer program product for measuring web site satisfaction of information needs are provided. The method includes: selecting a page for analysis; generating a page profile in the form of a list of keywords representing the page; generating a page traffic profile in the form of lists of keywords representing information needs of users, wherein the page traffic profile is generated from keywords used by users to visit the page; determining the success of users' visits to the page; and analyzing whether a page satisfies users' information needs by applying a distance measure between the keywords of the page profile and the keywords of the page traffic profile and combining the distance measure result with a success rate of the keywords.
    Type: Grant
    Filed: January 10, 2011
    Date of Patent: October 18, 2011
    Assignee: International Business Machines Corporation
    Inventors: Gilad Barkai, David Carmel, David Konopnicki, Haggai Roitman
  • Publication number: 20110131202
    Abstract: A method, system and computer program product for exploration of item consumption by customers are provided. The method includes profiling each customer with self attributes and related attributes in the form of consumed items; profiling each item with self attributes, first order related attributes in the form of customers of the profiled item, and second order related attributes in the form of items consumed by the customers of the profiled item; and indexing the customer profiles and item profiles in a faceted search engine for exploration by a user. Searching the customer profiles and item profiles is carried out by user selection of one or more attributes of the customers and/or items. The method includes refining the indexed profiles to a segment of the data in the form of a compound logic condition of the attributes of the customer and/or items.
    Type: Application
    Filed: December 2, 2009
    Publication date: June 2, 2011
    Applicant: International Business Machines Corporation
    Inventors: Doron Cohen, Iris Eiron, David Konopnicki, Naama Kraus
  • Patent number: 7945569
    Abstract: The disclosed embodiments relate to an apparatus for performing query operations. The apparatus comprises a base table having spatial objects, an index table having data entries that are associated with the spatial objects. A module that is adapted to perform the query operation is configured to convert a query window into values, create a scan range for each of the values with a begin range value, an end range value, and a stop condition, scan the data entries for each of the scan range to identify one of the end range value and the stop condition, and return a result based upon the data entries that are within the scan range for each of the values.
    Type: Grant
    Filed: March 31, 2004
    Date of Patent: May 17, 2011
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Tal Drory, Amir Bar-Or, Nitzan Peleg, David Konopnicki
  • Publication number: 20110106799
    Abstract: A method, system, and computer program product for measuring web site satisfaction of information needs are provided. The method includes: selecting a page for analysis; generating a page profile in the form of a list of keywords representing the page; generating a page traffic profile in the form of lists of keywords representing information needs of users, wherein the page traffic profile is generated from keywords used by users to visit the page; determining the success of users' visits to the page; and analyzing whether a page satisfies users' information needs by applying a distance measure between the keywords of the page profile and the keywords of the page traffic profile and combining the distance measure result with a success rate of the keywords.
    Type: Application
    Filed: January 10, 2011
    Publication date: May 5, 2011
    Applicant: International Business Machines Corporation
    Inventors: Gilad Barkai, David Carmel, David Konopnicki, Haggai Roitman
  • Patent number: 7899831
    Abstract: Folder recommendation in a file operation is accomplished by: receiving (325) information relating to the file operation; providing history data (321) of one or more previous operations, the data including details of information relating to a previous operation and a folder on which the previous operation was performed; and selecting a folder (324) for recommendation including matching the file operation to one or more folders based on the history data. In one embodiment, the operation is an operation of saving a file, and the information relating to the operation is file information. In another embodiment, the operation is an operation of retrieving a file, and the information relating to the operation is destination information.
    Type: Grant
    Filed: March 25, 2008
    Date of Patent: March 1, 2011
    Assignee: International Business Machines Corporation
    Inventors: Tal Drory, David Konopnicki
  • Patent number: 7895208
    Abstract: Device, system, and method of creating virtual social networks based on web-extracted features. For example, a method for creating virtual social networks based on web-extracted data includes: accessing through a global communication network a first content item and a second content item, wherein each one of the first and second content items is selected from the group consisting of: an image, a video, text, and metadata; extracting data corresponding to a first feature from the first content item; extracting data corresponding to a second feature from the second content item; and based on a common attribute of the first and second features, clustering into a cluster a first identifier of a first user associated with the first content item and a second identifier of a second user associated with the second content item.
    Type: Grant
    Filed: February 26, 2008
    Date of Patent: February 22, 2011
    Assignee: International Business Machines Corporation
    Inventor: David Konopnicki
  • Patent number: 7895277
    Abstract: The present invention discloses a solution for providing conditional reminders for electronic messages. The solution can identify an electronic message conveyed from a sender to a recipient, wherein the electronic message is an email message or text exchange message. A software program can determine a response time and a response condition for the electronic message. When the response time expires and when the response condition is unsatisfied, a software program can present a reminder to the sender and/or the recipient, where the reminder indicates that a response is due. When a software program detects a recipient action that satisfies the response condition before the response time expires, no reminder will be presented to either the sender or the recipient.
    Type: Grant
    Filed: October 17, 2007
    Date of Patent: February 22, 2011
    Assignee: International Business Machines Corporation
    Inventors: Tal Drory, Thomas R. Haynes, David Konopnicki, Yafit Sami, Lin Sun
  • Patent number: 7756772
    Abstract: A system, method and device for (semi-)automated e-commerce on the Internet, the WWW and other networks. Trading parties present intentions, made of more elementary components, which are used to express their willingness to engage in deals subject to constraints. Parts of intentions may be variable components. Some variable components may be associated with computational devices that transform them, optionally communicating via messages, into more specified components. This mechanism encodes business rules. By fitting intentions, contracts are formed. While fitting intentions, negotiations are carried out via the exchange of messages. Negotiations are automated by encoding users wishes as mathematical programs. Following the deal formation an optional deal improvement phase, in one-to-one mode or one-to-many mode, is carried out to improve the deal.
    Type: Grant
    Filed: August 29, 2000
    Date of Patent: July 13, 2010
    Assignee: Dealigence Inc.
    Inventors: David Konopnicki, Lior Leiba, Oded Shmueli, Yehoshua Sagiv
  • Patent number: 7680763
    Abstract: A method and system for administration of a search system (310) for searching data from a plurality of applications. The method includes defining the requirements of a plurality of applications (301-303) to send data to the search system (310), and using optimization techniques (312) to adapt the resources (420) of the search system to meet the requirements. Resources (420) are allocated and de-allocated to the search system (310) in response to the outcome of the optimization. Policies (415) regarding resource consumption can be defined at predetermined times or in predetermined circumstances to enable dynamic resource allocation.
    Type: Grant
    Filed: December 21, 2005
    Date of Patent: March 16, 2010
    Assignee: International Business Machines Corporation
    Inventors: David Andrew Brooks, Laurent Hasson, David Konopnicki
  • Publication number: 20090248615
    Abstract: A method and system for folder recommendation in a file operation are provided. The method includes: receiving (325) information relating to the file operation; providing history data (321) of one or more previous operations, the data including details of information relating to a previous operation and a folder on which the previous operation was performed; and selecting a folder (324) for recommendation including matching the file operation to one or more folders based on the history data. In one embodiment, the operation is an operation of saving a file, and the information relating to the operation is file information. In another embodiment, the operation is an operation of retrieving a file, and the information relating to the operation is destination information.
    Type: Application
    Filed: March 25, 2008
    Publication date: October 1, 2009
    Inventors: Tal Drory, David Konopnicki
  • Publication number: 20090216773
    Abstract: Device, system, and method of creating virtual social networks based on web-extracted features. For example, a method for creating virtual social networks based on web-extracted data includes: accessing through a global communication network a first content item and a second content item, wherein each one of the first and second content items is selected from the group consisting of: an image, a video, text, and metadata; extracting data corresponding to a first feature from the first content item; extracting data corresponding to a second feature from the second content item; and based on a common attribute of the first and second features, clustering into a cluster a first identifier of a first user associated with the first content item and a second identifier of a second user associated with the second content item.
    Type: Application
    Filed: February 26, 2008
    Publication date: August 27, 2009
    Inventor: David Konopnicki