Patents by Inventor Kasim Candan

Kasim Candan 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: 20220180465
    Abstract: Various embodiments for systems and methods of tracking disaster footprints using social streaming media using nonnegative matrix factorization are disclosed herein. The system extracts a summarization output from historical data and compares the summarization output with incoming data to identify differing or similar topics within the data. The summarization output is projected to adjust a time-dependency of the summarization output to enable a more direct comparison. The system additionally uses the summarization output to encode topic data within historical data to reduce computational overhead.
    Type: Application
    Filed: December 7, 2021
    Publication date: June 9, 2022
    Applicant: Arizona Board of Regents on Behalf of Arizona State University
    Inventors: Lu Cheng, Jundong Li, Kasim Candan, Huan Liu
  • Patent number: 9916381
    Abstract: A processing method for classification of contents in a domain that can be represented through a taxonomy includes generating a first digital mathematical representation of the taxonomy; generating a second digital mathematical representation of text documents different from the contents and containing keywords; processing the first and second digital mathematical representations for enriching the taxonomy, by associating keywords of the text documents with the first digital mathematical representation; generating a third digital mathematical representation of the contents; and processing the first digital enriched mathematical representation and third mathematical representation for classifying the contents in the enriched taxonomy.
    Type: Grant
    Filed: December 30, 2008
    Date of Patent: March 13, 2018
    Assignee: TELECOM ITALIA S.p.A.
    Inventors: Fabrizio Antonelli, Marina Geymonat, Dario Mana, Rossana Simeoni, Selcuk Kasim Candan, Mario Cataldi, Luigi Di Caro, Maria Luisa Sapino
  • Publication number: 20110264699
    Abstract: A processing method for classification (300) of contents (400) in a domain (500; 501) that can be represented through a taxonomy is described, the method comprising: generating (301) a first digital mathematical representation of the taxonomy; generating (302) a second digital mathematical representation of text documents (600) different from said contents and containing keywords; processing (303) the first and second digital mathematical representations for enriching the taxonomy, by associating keywords of the text documents (600) with the first digital mathematical representation; generating (304) a third digital mathematical representation of the contents (400); processing (305) the first digital enriched mathematical representation and third mathematical representation for classifying the contents (400) in the enriched taxonomy.
    Type: Application
    Filed: December 30, 2008
    Publication date: October 27, 2011
    Applicant: TELECOM ITALIA S.p.A.
    Inventors: Fabrizio Antonelli, Marina Geymonat, Dario Mana, Rossana Simeoni, Selcuk Kasim Candan, Mario Cataldi, Luigi Di Caro, Maria Luisa Sapino
  • Publication number: 20080097959
    Abstract: Systems and methods to provide two bottom up path matching solutions and one post processing solution for evaluating value predicates and tree pattern queries. The first path matching method triggers the matching whenever a leaf query step is seen and stores the prefix sub-matches in a cache for reuse. The second path matching method is an NFA (non-deterministic finite state automata) based solution through a post-order traversal of the XML document tree. The post processing method relies on a compact encoding the path results, which avoids redundant value predicate, join evaluations and any duplicate elimination, sort and grouping operations.
    Type: Application
    Filed: March 27, 2007
    Publication date: April 24, 2008
    Applicant: NEC LABORATORIES AMERICA, INC.
    Inventors: Songting Chen, Junichi Tatemura, Wang-Pin Hsiung, Divyakant Agrawal, Kasim Candan, Hua-Gang Li
  • Publication number: 20070079004
    Abstract: Disclosed is a method and apparatus for providing range based queries over distributed network nodes. Each of a plurality of distributed network nodes stores at least a portion of a logical index tree. The nodes of the logical index tree are mapped to the network nodes based on a hash function. Load balancing is addressed by replicating the logical index tree nodes in the distributed physical nodes in the network. In one embodiment the logical index tree comprises a plurality of logical nodes for indexing available resources in a grid computing system. The distributed network nodes are broker nodes for assigning grid computing resources to requesting users. Each of the distributed broker nodes stores at least a portion of the logical index tree.
    Type: Application
    Filed: September 30, 2005
    Publication date: April 5, 2007
    Inventors: Junichi Tatemura, Kasim Candan, Liping Chen, Divyakant Agrawal, Dirceu Cavendish
  • Publication number: 20060294156
    Abstract: Systems and methods are disclosed for providing view maintenance by buffering one or more search results in a cache; and incrementally maintaining the search results by analyzing a source data update and updating the cache based on a relevance of the update to the search results.
    Type: Application
    Filed: June 24, 2005
    Publication date: December 28, 2006
    Applicant: NEC Laboratories, Inc
    Inventors: Junichi Tatemura, Arsany Sawires, Divyakant Agrawal, Kasim Candan, Oliver Po
  • Publication number: 20050192995
    Abstract: Various systems and methods are describe for determining dynamically generated content to be invalidated as a result of changes to underlying data. In one method, invalidation processing is performed using a delayed version of the database that reflects the state of the database at the beginning of a preceding processing cycle, and an update log that reflects all updates since the beginning of the preceding processing cycle. In another method, invalidation processing is performed by locking a database which is locked during processing so as to reflect the state of the database at the beginning of processing, and an update log that reflects all updates to the database since the beginning of the preceding processing cycle. In another method, invalidation processing uses the database while it is freely updated during said processing, and the update log of the database.
    Type: Application
    Filed: May 4, 2005
    Publication date: September 1, 2005
    Inventors: Wen-Syan Li, Kasim Candan, Divyakant Agrawal
  • Publication number: 20050091399
    Abstract: An network of proxy servers overlaying a wide area network that comprises a plurality of autonomous systems establishes a hierarchial multicast tree overlay network structure for providing streaming live media from media sources to end users. The tree structure is constructed and maintained by peer-to-peer negotiations between proxy servers that identify proxy servers and data paths that optimize utilization of network resources based upon minimizing costs as a function of loadings. The proxy servers maintain information about the status of neighboring proxy servers, and exchange messages to redirect join requests to more suitable proxies, to redistribute portions of their own loads when they are overutilized, and to consolidate loads when they are underutilized.
    Type: Application
    Filed: September 30, 2003
    Publication date: April 28, 2005
    Inventors: Kasim Candan, Yusuf Akca, Wen-Syan Li