Patents by Inventor Navin Doshi
Navin Doshi 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: 20190083395Abstract: A breathing device is formed of a container having a spherically-shaped cavity in which a medicinal substance is located. The cavity has input and output ports. Pressurized and temperature-controlled breathable air is provided at the input to the cavity with enough pressure so that the air circulates through the medicinal substance to infuse the medicinal substance into the air. A fluid permeable bag is used to hold salt crystals, such as Himalayan pink salt, in the cavity. A medicinal oil is added to the salt crystals. An outlet port is formed in the container and is connected with a vented breathing mask for a user to inhale the salt- and oil-infused air. The pressure of the breathable air at the input is strong enough to circulate the air through the salt crystals and oil and expel the air from the cavity through the output port to provide positive pressure at a vented breathing mask.Type: ApplicationFiled: June 26, 2018Publication date: March 21, 2019Inventor: Navin Doshi
-
Patent number: 8984022Abstract: A tree structure of plurality of information records arranged is recursively grown by splitting at least a portion of the records and by generating at least one predictive model. Related apparatus, systems, methods and computer program products are also described.Type: GrantFiled: April 20, 2012Date of Patent: March 17, 2015Assignee: Fair Isaac CorporationInventors: Stuart Crawford, Prasun Kumar, Navin Doshi, Xing Zhao, Richard Schiffman
-
Patent number: 8730241Abstract: A system and method for drawing curved edges in graphs is disclosed. The system and method implement a heuristic algorithm to draw curved edges in graphs using Bezier curves. The algorithm assumes that every pair of nodes has a unique edge between them. It also assumes that the graph is “leveled,” which means the nodes can be grouped such that all the nodes in a group are laid out at the same y location in a vertical layout. Any generic graph can be converted to a leveled graph, so the techniques described in the algorithm are applicable to any graph.Type: GrantFiled: September 8, 2008Date of Patent: May 20, 2014Assignee: Fair Isaac CorporationInventors: Gaurav Chhaparwal, Navin Doshi, Kashyap Babu Rao Kolipaka
-
Patent number: 8312389Abstract: Techniques for visualization of decision logic are provided. In one aspect, the techniques can be implemented by providing a control within a graphical user interface to a user. The control can display a plurality of graphical user interface elements corresponding to linked nodes within a hierarchical structure. An input identifying a selected graphical user interface element within the control can be generated by a user. A selected node within the hierarchical structure can be identified based on the selected graphical user interface element. In response to a request from a user, modifying an appearance of a subset of the linked nodes within the hierarchical structure based on a desired visualization criteria, the linked nodes within the hierarchical structure and the selected node.Type: GrantFiled: August 29, 2008Date of Patent: November 13, 2012Assignee: Fair Isaac CorporationInventors: Stuart L. Crawford, Gaurav Chhaparwal, Navin Doshi, Kashyap Babu Rao Kolipaka, Sergei Tolmanov, Michael Steele, Megan Thorsen
-
Patent number: 8266090Abstract: A request to compare strategies is received. The first strategy can be graphically represented by a first set of linked nodes arranged in a first form of decision logic. The second strategy can be graphically represented by a second set of linked nodes arranged in a second form of decision logic. The first set of linked nodes can be converted to a first modified set of linked nodes arranged in a third form of decision logic. The second set of linked nodes can be converted to a second modified set of linked nodes arranged in the third form of decision logic. A color-coded visual representation of the first modified set of linked nodes and the second modified set of linked nodes can be provided to a user. Related apparatus, techniques, and articles are also described.Type: GrantFiled: August 29, 2008Date of Patent: September 11, 2012Assignee: Fair Isaac CorporationInventors: Stuart L. Crawford, Michael Steele, Navin Doshi, Sergei Tolmanov, Kashyap Babu Rao Kolipaka, Gaurav Chhaparwal, Megan Thorsen, Chris Erickson
-
Patent number: 8237716Abstract: A system and method for drawing directed acyclic graphs is disclosed. In particular, an algorithm, as implemented in a method and system, to aesthetically layout directed acyclic graphs is presented. The algorithm includes methods to reduce the number of edge crossings and increase the number of straight edges in such drawings. The algorithm keeps short and straight edges wherever possible and gives preference to vertical edges. It also provides an edge-crossing reduction heuristic to refine the layout obtained after standard median heuristic layout, and further provides a method to focus on important paths in the graph through layout.Type: GrantFiled: September 8, 2008Date of Patent: August 7, 2012Assignee: Fair Isaac CorporationInventors: Kashyap Babu Rao Kolipaka, Navin Doshi, Gaurav Chhaparwal
-
Patent number: 8200693Abstract: Techniques are described for logically comparing strategies. In one aspect the strategies can be compared by receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes, the second strategy graphically represented by a second set of linked nodes, each set of linked nodes linking a root node to at least one action node; identifying a subset of linked nodes from at least one of the first set of linked nodes and the second set of linked nodes based on an equivalence of a first subset of the first set of linked nodes to a second subset of the second set of linked nodes; and, providing a visual depiction of the identified subset of the linked nodes to a user, the visual depiction corresponding to the equivalence of the first subset to the second subset.Type: GrantFiled: June 26, 2009Date of Patent: June 12, 2012Assignee: Fair Isaac CorporationInventors: Michael Steele, Stuart Crawford, Navin Doshi, Kashyap Babu Rao Kolipaka, Prasun Kumar, Sergei Tolmanov
-
Patent number: 8175623Abstract: A mobile domain platform for subscribers (e.g. businesses, institutions, advertising agencies, partners, providers, individuals, and enterprises) to offer a text message based campaign to new or potential customers (users). A subscriber can create a mobile domain by selecting and registering at least one available keyword with a mobile domain platform for the subsequent processing of text messages sent to the platform which include one or more of the registered keywords. Also, the subscriber can register one or more keywords as a root for a mobile domain such that subsequent text messages sent to the mobile domain platform that include additional alphanumeric strings of text (root keyword plus one or more combinations of other predetermined keywords) can be automatically processed to enable one or more different actions. A mobile domain keyword is generally composed of one or more alphanumeric characters, and can be any one of a word, phrase, abbreviation, or character.Type: GrantFiled: August 30, 2006Date of Patent: May 8, 2012Assignee: Yahoo! Inc.Inventors: Shailesh Bhat, Shouvick Mukherjee, Subramanya Sharma, Navin Doshi, Mekin Maheshwari, Anoop Jain
-
Patent number: 7937335Abstract: The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.Type: GrantFiled: August 10, 2010Date of Patent: May 3, 2011Assignee: Fair Isaac CorporationInventors: Stuart Crawford, Gaurav Chhaparwal, Kashyap Babu Rao Kolipaka, Navin Doshi, Sergei Tolmanov
-
Publication number: 20100332514Abstract: Techniques are described for logically comparing strategies. In one aspect the strategies can be compared by receiving a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes, the second strategy graphically represented by a second set of linked nodes, each set of linked nodes linking a root node to at least one action node; identifying a subset of linked nodes from at least one of the first set of linked nodes and the second set of linked nodes based on an equivalence of a first subset of the first set of linked nodes to a second subset of the second set of linked nodes; and, providing a visual depiction of the identified subset of the linked nodes to a user, the visual depiction corresponding to the equivalence of the first subset to the second subset.Type: ApplicationFiled: June 26, 2009Publication date: December 30, 2010Inventors: Michael Steele, Stuart Crawford, Navin Doshi, Kashyap Babu Rao Kolipaka, Prasun Kumar, Sergei Tolmanov
-
Publication number: 20100306167Abstract: The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.Type: ApplicationFiled: August 10, 2010Publication date: December 2, 2010Inventors: Stuart Crawford, Gaurav Chhaparwal, Kashyap Babu Rao Kolipaka, Navin Doshi, Sergei Tolmanov
-
Patent number: 7831526Abstract: The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.Type: GrantFiled: August 27, 2007Date of Patent: November 9, 2010Assignee: Fair Isaac CorporationInventors: Stuart Crawford, Gaurav Chhaparwal, Kashyap Babu Rao Kolipaka, Navin Doshi, Sergei Tolmanov
-
Publication number: 20100060643Abstract: A system and method for drawing directed acyclic graphs is disclosed. In particular, an algorithm, as implemented in a method and system, to aesthetically layout directed acyclic graphs is presented. The algorithm includes methods to reduce the number of edge crossings and increase the number of straight edges in such drawings. The algorithm keeps short and straight edges wherever possible and gives preference to vertical edges. It also provides an edge-crossing reduction heuristic to refine the layout obtained after standard median heuristic layout, and further provides a method to focus on important paths in the graph through layout.Type: ApplicationFiled: September 8, 2008Publication date: March 11, 2010Inventors: Kashyap Babu Rao Kolipaka, Navin Doshi, Gaurav Chhaparwal
-
Publication number: 20100060642Abstract: A system and method for drawing curved edges in graphs is disclosed. The system and method implement a heuristic algorithm to draw curved edges in graphs using Bezier curves. The algorithm assumes that every pair of nodes has a unique edge between them. It also assumes that the graph is “leveled,” which means the nodes can be grouped such that all the nodes in a group are laid out at the same y location in a vertical layout. Any generic graph can be converted to a leveled graph, so the techniques described in the algorithm are applicable to any graph.Type: ApplicationFiled: September 8, 2008Publication date: March 11, 2010Inventors: Gaurav Chhaparwal, Navin Doshi, Kashyap Babu Rao Kolipaka
-
Publication number: 20090063389Abstract: A request to compare strategies is received. The first strategy can be graphically represented by a first set of linked nodes arranged in a first form of decision logic. The second strategy can be graphically represented by a second set of linked nodes arranged in a second form of decision logic. The first set of linked nodes can be converted to a first modified set of linked nodes arranged in a third form of decision logic. The second set of linked nodes can be converted to a second modified set of linked nodes arranged in the third form of decision logic. A visual representation of the first modified set of linked nodes and the second modified set of linked nodes can be provided to a user. Related apparatus, techniques, and articles are also described.Type: ApplicationFiled: August 29, 2008Publication date: March 5, 2009Inventors: Stuart L. Crawford, Michael Steele, Navin Doshi, Sergei Tolmanov, Kashy Ap Rao Kolipaka, Gaurav Chhaparwal
-
Publication number: 20090064053Abstract: Techniques for visualization of decision logic are provided. In one aspect, the techniques can be implemented by providing a control within a graphical user interface to a user. The control can display a plurality of graphical user interface elements corresponding to linked nodes within a hierarchical structure. An input identifying a selected graphical user interface element within the control can be generated by a user. A selected node within the hierarchical structure can be identified based on the selected graphical user interface element. In response to a request from a user, modifying an appearance of a subset of the linked nodes within the hierarchical structure based on a desired visualization criteria, the linked nodes within the hierarchical structure and the selected node.Type: ApplicationFiled: August 29, 2008Publication date: March 5, 2009Inventors: Stuart L. Crawford, Gaurav Chhaparwal, Navin Doshi, Kashyap Babu Rao Kolipaka, Sergei Tolmanov, Michael Steele, Megan Thorsen
-
Publication number: 20070293247Abstract: A mobile domain platform for subscribers (e.g. businesses, institutions, advertising agencies, partners, providers, individuals, and enterprises) to offer a text message based campaign to new or potential customers (users). A subscriber can create a mobile domain by selecting and registering at least one available keyword with a mobile domain platform for the subsequent processing of text messages sent to the platform which include one or more of the registered keywords. Also, the subscriber can register one or more keywords as a root for a mobile domain such that subsequent text messages sent to the mobile domain platform that include additional alphanumeric strings of text (root keyword plus one or more combinations of other predetermined keywords) can be automatically processed to enable one or more different actions. A mobile domain keyword is generally composed of one or more alphanumeric characters, and can be any one of a word, phrase, abbreviation, or character.Type: ApplicationFiled: August 30, 2006Publication date: December 20, 2007Applicant: Yahoo! Inc.Inventors: Shailesh Bhat, Shouvick Mukherjee, Subramanya Sharma, Navin Doshi, Mekin Maheshwari, Anoop Jain