Patents by Inventor Kazi Atif-Uz Zaman

Kazi Atif-Uz Zaman 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: 10279264
    Abstract: Embodiments of the present disclosure provide a tutorial system that can aid a user in performing various game commands in response to different game states in a virtual game environment. As the user plays the game, various game states may be encountered. A tutorial engine may, based on a current game state, determine one or more game commands to be recommended to the user, based on historical information of the user and a game state model, wherein the game state model maintains associations between game states and different segments of users. The user is recommended relevant game commands during the normal course of gameplay, based on their own gameplay history and on game commands commonly performed by other users of the game application.
    Type: Grant
    Filed: March 22, 2016
    Date of Patent: May 7, 2019
    Assignee: ELECTRONIC ARTS INC.
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman
  • Publication number: 20190001219
    Abstract: Using voice recognition, a user can interact with a companion application to control a video game from a mobile device. Advantageously, the user can interact with the companion application when the video game is unavailable because, for example, of the user's location. Moreover, machine learning may be used to facilitate generating voice responses to user utterances that are predicted to improve or maintain a user's level of engagement with the companion application, or its corresponding video game.
    Type: Application
    Filed: June 30, 2017
    Publication date: January 3, 2019
    Inventors: Mohsen Sardari, Kenneth Alan Moss, Kazi Atif-Uz Zaman, Navid Aghdaie, John Kolen, Mohamed Marwan Mattar
  • Publication number: 20180369696
    Abstract: Embodiments of systems presented herein may identify users to include in a match plan. A parameter model may be generated to predict the retention time of a set of users. A queue of potential users, a set of teammates, and/or opponents may be selected from a queue of waiting users. User information for the set of teammates and/or opponents may be provided to the parameter model to generate a predicted retention time. The set of teammates and/or opponents may be approved if the predicted retention time meets a predetermined threshold. Advantageously, by creating a match plan based on retention rates, the engagement and/or retention level for a number of users may be improved compared to existing multiplayer matching systems.
    Type: Application
    Filed: May 30, 2018
    Publication date: December 27, 2018
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman
  • Publication number: 20180243656
    Abstract: Embodiments presented herein include systems and methods for performing dynamic difficulty adjustment. Further, embodiments disclosed herein perform dynamic difficulty adjustment using processes that may not be detectable or are more difficult to detect by users compared to static and/or existing difficulty adjustment processes. In some embodiments, historical user information utilized by a machine learning system to generate a prediction model that predicts an expected duration of game play, such as for example, an expected churn rate, a retention rate, the length of time a user is expected to play the game, or an indication of the user's expected game play time relative to a historical set of users who have previously played the game. Before or during game play, the prediction model can be applied to information about the user to predict the user's expected duration of game play.
    Type: Application
    Filed: February 28, 2017
    Publication date: August 30, 2018
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman, Meng Wu
  • Publication number: 20180169526
    Abstract: Embodiments of systems presented herein may perform automatic granular difficulty adjustment. In some embodiments, the difficulty adjustment is undetectable by a user. Further, embodiments of systems disclosed herein can review historical user activity data with respect to one or more video games to generate a game retention prediction model that predicts an indication of an expected duration of game play. The game retention prediction model may be applied to a user's activity data to determine an indication of the user's expected duration of game play. Based on the determined expected duration of game play, the difficulty level of the video game may be automatically adjusted.
    Type: Application
    Filed: February 14, 2018
    Publication date: June 21, 2018
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman, Kenneth Alan Moss
  • Patent number: 9993735
    Abstract: Embodiments of systems presented herein may identify users to include in a match plan. A parameter model may be generated to predict the retention time of a set of users. A queue of potential users, a set of teammates, and/or opponents may be selected from a queue of waiting users. User information for the set of teammates and/or opponents may be provided to the parameter model to generate a predicted retention time. The set of teammates and/or opponents may be approved if the predicted retention time meets a predetermined threshold. Advantageously, by creating a match plan based on retention rates, the engagement and/or retention level for a number of users may be improved compared to existing multiplayer matching systems.
    Type: Grant
    Filed: March 8, 2016
    Date of Patent: June 12, 2018
    Assignee: Electronic Arts Inc.
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman
  • Publication number: 20180111051
    Abstract: Embodiments of systems presented herein may identify users to play a multiplayer video game together using a mapping system and machine learning algorithms to create sets of matchmaking plans for the multiplayer video game that increases player or user retention. Embodiments of systems presented herein can determine the predicted churn rate, or conversely retention rate, of a user waiting to play a video game if the user is matched with one or more additional users in a multiplayer instance of the video game.
    Type: Application
    Filed: January 26, 2017
    Publication date: April 26, 2018
    Inventors: Su Xue, Kazi Atif-Uz Zaman, Navid Aghdaie, John Kolen, Zhengxing Chen
  • Patent number: 9919217
    Abstract: Embodiments of systems presented herein may perform automatic granular difficulty adjustment. In some embodiments, the difficulty adjustment is undetectable by a user. Further, embodiments of systems disclosed herein can review historical user activity data with respect to one or more video games to generate a game retention prediction model that predicts an indication of an expected duration of game play. The game retention prediction model may be applied to a user's activity data to determine an indication of the user's expected duration of game play. Based on the determined expected duration of game play, the difficulty level of the video game may be automatically adjusted.
    Type: Grant
    Filed: March 8, 2016
    Date of Patent: March 20, 2018
    Assignee: Electronic Arts Inc.
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman, Kenneth Alan Moss
  • Publication number: 20170259178
    Abstract: Embodiments of systems presented herein may identify users to include in a match plan. A parameter model may be generated to predict the retention time of a set of users. A queue of potential users, a set of teammates, and/or opponents may be selected from a queue of waiting users. User information for the set of teammates and/or opponents may be provided to the parameter model to generate a predicted retention time. The set of teammates and/or opponents may be approved if the predicted retention time meets a predetermined threshold. Advantageously, by creating a match plan based on retention rates, the engagement and/or retention level for a number of users may be improved compared to existing multiplayer matching systems.
    Type: Application
    Filed: March 8, 2016
    Publication date: September 14, 2017
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman
  • Publication number: 20170259177
    Abstract: Embodiments of systems presented herein may perform automatic granular difficulty adjustment. In some embodiments, the difficulty adjustment is undetectable by a user. Further, embodiments of systems disclosed herein can review historical user activity data with respect to one or more video games to generate a game retention prediction model that predicts an indication of an expected duration of game play. The game retention prediction model may be applied to a user's activity data to determine an indication of the user's expected duration of game play. Based on the determined expected duration of game play, the difficulty level of the video game may be automatically adjusted.
    Type: Application
    Filed: March 8, 2016
    Publication date: September 14, 2017
    Inventors: Navid Aghdaie, John Kolen, Mohamed Marwan Mattar, Mohsen Sardari, Su Xue, Kazi Atif-Uz Zaman, Kenneth Alan Moss
  • Patent number: 9563662
    Abstract: Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.
    Type: Grant
    Filed: October 31, 2007
    Date of Patent: February 7, 2017
    Assignee: Oracle International Corporation
    Inventors: Donovan Alfred Schneider, Edward Shaw-Lee Suen, Kazi Atif-Uz Zaman
  • Publication number: 20110119680
    Abstract: Methods and apparatus are described for managing data flows in a high-volume system. Jobs are grouped into pipelines of related tasks. A pipeline controller accepts schemas defining the jobs in a pipeline, their dependencies, and various policies for handling the data flow. Pipelines may be smoothly upgraded with versioning techniques and optional start/stop times for each pipeline. Late data or job dependencies may be handled with a number of strategies. The controller may also mediate resource usage in the system.
    Type: Application
    Filed: November 16, 2009
    Publication date: May 19, 2011
    Applicant: YAHOO! INC.
    Inventors: Wei Li, Kazi Atif-Uz Zaman
  • Patent number: 7925665
    Abstract: The processing of a query that is submitted to a central controlling server where the central controlling server sources data from one or more backend databases and where such data is referenced by subqueries associated with the query is disclosed.
    Type: Grant
    Filed: June 25, 2004
    Date of Patent: April 12, 2011
    Assignee: Siebel Systems, Inc.
    Inventors: Donavan A. Schneider, Kazi Atif-Uz Zaman
  • Patent number: 7499910
    Abstract: Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.
    Type: Grant
    Filed: June 27, 2002
    Date of Patent: March 3, 2009
    Assignee: Siebel Systems, Inc.
    Inventors: Donovan Alfred Schneider, Edward Shaw-Lee Suen, Kazi Atif-Uz Zaman