Patents by Inventor Siyu Yang

Siyu Yang 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: 12199529
    Abstract: Devices and methods for charging a power storage device using a piezoelectric energy-harvest charger that employs a single switched inductor stage. The charger may maintain a maximum power point without requiring a second switched inductor stage.
    Type: Grant
    Filed: November 1, 2021
    Date of Patent: January 14, 2025
    Assignee: Georgia Tech Research Corporation
    Inventors: Siyu Yang, Gabriel Alfonso Rincon-Mora
  • Patent number: 11271576
    Abstract: Certain aspects of the present disclosure provide a digital-to-analog converter (DAC). The DAC generally includes a plurality of current-steering cells, each having a bypass switch, and a resistor ladder circuit having multiple segments. Each segment may include a first resistive element and a second resistive element, the bypass switch being configured to selectively provide a bypass current to a common node between the first resistive element and the second resistive element.
    Type: Grant
    Filed: April 6, 2021
    Date of Patent: March 8, 2022
    Assignee: QUALCOMM Incorporated
    Inventors: Andrew Weil, Ashok Swaminathan, Siyu Yang
  • Publication number: 20220069741
    Abstract: Devices and methods for charging a power storage device using a piezoelectric energy-harvest charger that employs a single switched inductor stage. The charger may maintain a maximum power point without requiring a second switched inductor stage.
    Type: Application
    Filed: November 1, 2021
    Publication date: March 3, 2022
    Inventors: Siyu Yang, Gabriel Alfonso Rincon-Mora
  • Patent number: 11194825
    Abstract: A distributed sequential pattern data mining framework mines user data to determine statistically-relevant sequential patterns which are used to correlate the sequential patterns to a particular outcome. The correlation is provided by a statistical model, a binary predictive model and/or a logistic regression model which uses the sequential patterns to learn the behavior of end users during their usage of a software application.
    Type: Grant
    Filed: September 23, 2018
    Date of Patent: December 7, 2021
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC.
    Inventors: Shengyu Fu, Sai Tulasi Neppali, Neelakantan Sundaresan, Siyu Yang
  • Patent number: 10671355
    Abstract: A code completion tool uses machine learning models to more precisely predict the likelihood of a method invocation completing a code fragment that follows one or more method invocations of a same class in a same document during program development. In one aspect, the machine learning model is a n-order Markov chain model that is trained on features that represent characteristics of the context of method invocations of a class in commonly-used programs from a sampled population.
    Type: Grant
    Filed: March 29, 2018
    Date of Patent: June 2, 2020
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC.
    Inventors: Jorge Banuelos, Shengyu Fu, Roshanak Zilouchian Moghaddam, Neelakantan Sundaresan, Siyu Yang, Ying Zhao
  • Patent number: 10615345
    Abstract: Measurements on organic single crystals reveal remarkable optical and electrical characteristics compared to disordered films but practical device applications require uniform, pinhole-free films. Disclosed herein is a process to reliably convert as-deposited amorphous thin films to ones that are highly crystalline, with grains on the order of hundreds of microns. The disclosed method results in films that are pinhole-free and that possess grains that individually are single crystal domains.
    Type: Grant
    Filed: June 2, 2017
    Date of Patent: April 7, 2020
    Assignee: THE TRUSTEES OF PRINCETON UNIVERSITY
    Inventors: Barry P. Rand, Michael A. Fusella, Siyu Yang
  • Publication number: 20200097589
    Abstract: A distributed sequential pattern data mining framework mines user data to determine statistically-relevant sequential patterns which are used to correlate the sequential patterns to a particular outcome. The correlation is provided by a statistical model, a binary predictive model and/or a logistic regression model which uses the sequential patterns to learn the behavior of end users during their usage of a software application.
    Type: Application
    Filed: September 23, 2018
    Publication date: March 26, 2020
    Inventors: SHENGYU FU, SAI TULASI NEPPALI, NEELAKANTAN SUNDARESAN, SIYU YANG
  • Patent number: 10516412
    Abstract: An interleaved digital-to-analog converter (DAC) system may include a first sub-DAC and a second sub-DAC and may be configured to provide both a converter output signal and a calibration output signal. The converter output signal may be provided by adding the first sub-DAC output signal and the second sub-DAC output signal. The calibration output signal may be provided by subtracting one of the first and second sub-DAC output signals from the other. The calibration output signal may be used as feedback to adjust the phase of one of the sub-DACs relative to the other, to promote phase matching their output signals.
    Type: Grant
    Filed: September 21, 2018
    Date of Patent: December 24, 2019
    Assignee: QUALCOMM Incorporated
    Inventors: Shahin Mehdizad Taleie, Ashok Swaminathan, Sudharsan Kanagaraj, Negar Rashidi, Siyu Yang, Behnam Sedighi, Honghao Ji, Jaswinder Singh, Andrew Weil, Dongwon Seo, Xilin Liu
  • Publication number: 20190227774
    Abstract: A code completion tool uses machine learning models to more precisely predict the likelihood of a method invocation completing a code fragment that follows one or more method invocations of a same class in a same document during program development. In one aspect, the machine learning model is a n-order Markov chain model that is trained on features that represent characteristics of the context of method invocations of a class in commonly-used programs from a sampled population.
    Type: Application
    Filed: March 29, 2018
    Publication date: July 25, 2019
    Inventors: JORGE BANUELOS, SHENGYU FU, ROSHANAK ZILOUCHIAN MOGHADDAM, NEELAKANTAN SUNDARESAN, SIYU YANG, YING ZHAO
  • Patent number: 10021026
    Abstract: A router has a shape graph that is a compressed form of a trie that represents routing information for routing data packets in a network, and an update data structure that includes plural entries corresponding to nodes of the shape graph, the plural entries containing count values indicating respective numbers of nodes of the tie represented by the corresponding nodes of the shape graph. The router incrementally updates the shape graph as a portion of the routing information changes, where the incremental updating uses information in the update data structure.
    Type: Grant
    Filed: January 31, 2013
    Date of Patent: July 10, 2018
    Assignees: Hewlett Packard Enterprise Development LP, Hangzhou H3C Technologies Co., LTD
    Inventors: ZhiYong Shen, QunYang Lin, JunQing Xie, Peng Xie, Yong Tang, SiYu Yang, David Lee, Mihalis Yannakakis
  • Publication number: 20170352720
    Abstract: Measurements on organic single crystals reveal remarkable optical and electrical characteristics compared to disordered films but practical device applications require uniform, pinhole-free films. Disclosed herein is a process to reliably convert as-deposited amorphous thin films to ones that are highly crystalline, with grains on the order of hundreds of microns. The disclosed method results in films that are pinhole-free and that possess grains that individually are single crystal domains.
    Type: Application
    Filed: June 2, 2017
    Publication date: December 7, 2017
    Applicant: The Trustees of Princeton University
    Inventors: Barry P. Rand, Michael A. Fusella, Siyu Yang
  • Publication number: 20150372915
    Abstract: A router has a shape graph that is a compressed form of a trie that represents routing information for routing data packets in a network, and an update data structure that includes plural entries corresponding to nodes of the shape graph, the plural entries containing count values indicating respective numbers of nodes of the tie represented by the corresponding nodes of the shape graph. The router incrementally updates the shape graph as a portion of the routing information changes, where the incremental updating uses information in the update data structure.
    Type: Application
    Filed: January 31, 2013
    Publication date: December 24, 2015
    Inventors: ZhiYong SHEN, QunYang LIN, JunQing XIE, Peng XIE, Yong TANG, SiYu YANG, David LEE, Mihalis YANNAKAKIS
  • Publication number: 20150256450
    Abstract: A system and method for generating shape graphs for a routing table are described herein. The method includes splitting a binary trie representing a routing table of a router into a number of layers, wherein each layer includes a number of nodes. The method also includes, for each layer, determining a number of groups of isomorphic nodes and merging the isomorphic nodes within each group to generate a shape graph.
    Type: Application
    Filed: September 28, 2012
    Publication date: September 10, 2015
    Inventors: Siyu Yang, Zhi-Yong Shen, Peng Xie, Tang Yong, Ping Luo, Jun-Qing Xie, Linpeng Tang, Mihalis Yannakakis, Robert Tarjan, David Lee
  • Publication number: 20110295626
    Abstract: Social networks have become platforms to disseminate and market information and ideas. A social network, users, and interactions of users may be modeled by graphs, which may be analyzed to determine influential users. In one example, nodes within a graph may be concurrently grouped into node groupings. Influence values corresponding to node counts within node groupings may be assigned to nodes within node groupings. Influential nodes may be determined based upon the assigned influence values. In another example, degrees of nodes (e.g., an edge count of a node) may be used to determine influential nodes within the graph. Upon selecting a node, degrees of neighboring nodes of the selecting node may be discounted because the node was selected. In another example, trees corresponding to a current node and (e.g., maximum) influential paths from other nodes to the current node may be constructed and evaluated to determine a group of nodes.
    Type: Application
    Filed: May 28, 2010
    Publication date: December 1, 2011
    Applicant: Microsoft Corporation
    Inventors: Wei Chen, Yajun Wang, Siyu Yang, Chi Wang