Patents by Inventor Yi Shang

Yi Shang 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: 8472644
    Abstract: A high efficiency audio amplifier is disclosed. The high efficiency audio amplifier includes an input end for receiving an input audio signal, an output end for outputting an output audio signal, a signal generator coupled to the input end for determining a frequency of an oscillating signal according to the distribution of the input audio signal and a reference voltage, and generating the oscillating signal accordingly, a waveform transformer coupled to the input end and the signal generator for comparing the input audio signal with the oscillating signal to generate a pulse width modulation (PWM) signal, a pre-drive circuit for generating a pre-drive signal according to the PWM signal, an output stage coupled to the pre-drive circuit for generating an output signal, and a filter coupled to the output stage for filtering the output signal to generate the output audio signal to the output end.
    Type: Grant
    Filed: June 2, 2010
    Date of Patent: June 25, 2013
    Assignee: Wistron Corporation
    Inventors: Yi-Shang Chen, Chun-Hao Hsu
  • Publication number: 20110019843
    Abstract: A high efficiency audio amplifier is disclosed. The high efficiency audio amplifier includes an input end for receiving an input audio signal, an output end for outputting an output audio signal, a signal generator coupled to the input end for determining a frequency of an oscillating signal according to the distribution of the input audio signal and a reference voltage, and generating the oscillating signal accordingly, a waveform transformer coupled to the input end and the signal generator for comparing the input audio signal with the oscillating signal to generate a pulse width modulation (PWM) signal, a pre-drive circuit for generating a pre-drive signal according to the PWM signal, an output stage coupled to the pre-drive circuit for generating an output signal, and a filter coupled to the output stage for filtering the output signal to generate the output audio signal to the output end.
    Type: Application
    Filed: June 2, 2010
    Publication date: January 27, 2011
    Inventors: Yi-Shang Chen, Chun-Hao Hsu
  • Publication number: 20100295698
    Abstract: A remote control setting method for an electronic device for setting a plurality of functions of the electronic device to be controlled by a plurality of keypads of a remote controller includes displaying an indication message according to a control signal, to indicate codes of a function of the plurality of functions and ask a user to press a keypad of the plurality of keypads, receiving a triggering signal generated by pressing the keypad, and storing codes including relation between the triggering signal and the function according to the control signal.
    Type: Application
    Filed: December 31, 2009
    Publication date: November 25, 2010
    Inventors: Yi-Shang Chen, Chun-Hao Hsu
  • Publication number: 20100289470
    Abstract: A power supply device of a LCD display device comprising an AC rectifier; a square wave generator; an AC voltage converting module, coupled to the square wave generator, for providing an AC voltage to a backlight module of the LCD display device; and a plurality of DC voltage converting modules, for providing a plurality of voltage sources to a plurality of load circuits of the LCD display device, each DC voltage converting module comprising a control circuit for masking off the first oscillating signal, to generate a second oscillating signal according to a feedback signal of a corresponding load circuit; a voltage converting unit, coupled to the control circuit and the load circuit, for transforming the second oscillating signal into a voltage source for the load circuit; and a feedback control unit, coupled to the control circuit and the load circuit, for generating the feedback signal.
    Type: Application
    Filed: January 21, 2010
    Publication date: November 18, 2010
    Inventors: Yi-Shang Chen, Chun-Hao Hsu
  • Patent number: 7577107
    Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.
    Type: Grant
    Filed: June 3, 2003
    Date of Patent: August 18, 2009
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Ying Zhang, Markus P. J. Fromherz, Lara S. Crawford, Yi Shang
  • Patent number: 7577108
    Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.
    Type: Grant
    Filed: June 3, 2003
    Date of Patent: August 18, 2009
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Ying Zhang, Markus P. J. Fromherz, Yi Shang, Sergei Vassilvitskii, Lara S. Crawford
  • Publication number: 20090044291
    Abstract: This application provides a recombinant expression cassette for expressing the H subunit of Mg-chelatase, a plant gene product that is newly identified as an abscisic acid receptor. Also provided are a transgenic plant with drought-resistance and a method for producing such plants.
    Type: Application
    Filed: August 28, 2007
    Publication date: February 12, 2009
    Applicant: D-Helix
    Inventors: Da-Peng Zhang, Yuan-Yue Shen, Xiao-Fang Wang, Fu-Qing Wu, Shu-Yuan Du, Zheng Cao, Yi Shang, Yan-Hong Xu
  • Patent number: 7486627
    Abstract: A method is presented for a time-aware strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.
    Type: Grant
    Filed: June 3, 2003
    Date of Patent: February 3, 2009
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Ying Zhang, Markus P. J. Fromherz, Sergei Vassilvitskii, Yi Shang
  • Patent number: 7457860
    Abstract: Disclosed herein is a method for deriving node localization information within communication networks having a plurality of nodes, which are separated by node paths. The method includes estimating the shortest path between multiple pairs of nodes in the network and constructing a matrix encompassing the estimated shortest paths. Multidimensional scaling is then applied to the matrix and the largest eigenvectors of the transformed matrix are identified. From this is constructed a relative map of the location of the pairs of nodes within the network by utilization of the eigenvectors.
    Type: Grant
    Filed: October 9, 2003
    Date of Patent: November 25, 2008
    Assignee: Palo Alto Research Center, Incorporated
    Inventors: Yi Shang, Wheeler Ruml
  • Patent number: 7089220
    Abstract: A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.
    Type: Grant
    Filed: June 24, 2003
    Date of Patent: August 8, 2006
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Markus P. J. Fromherz, Yi Shang, Lara S. Crawford
  • Patent number: 7089221
    Abstract: A method for feedback control of cooperative problem solving for real-time applications in complex systems utilizes solvers parameterized by control variables. The method includes initializing the time setting and selecting at least one solver parameter value. The solver is operated with the selected solver parameter value or values for a specified interim and the operational conditions are reviewed. A solution is transmitted to the system if a solution quality condition is satisfied. The solver continues to operate if the solution quality condition is not satisfied and the performance differential is not greater than a specified threshold. If the solution quality condition is unsatisfied, but the performance differential exceeds the threshold, at least one alternate solver parameter value is selected and the solver is operated with the new solver parameter value for a specified interim. The solver continues to operate until the solution quality condition is satisfied.
    Type: Grant
    Filed: June 24, 2003
    Date of Patent: August 8, 2006
    Assignee: Palo Alto Research Center Incorporated
    Inventors: Markus P. J. Fromherz, Lara S. Crawford, Yi Shang
  • Publication number: 20050080924
    Abstract: Disclosed herein is a method for deriving node localization information within communication networks having a plurality of nodes, which are separated by node paths. The method includes estimating the shortest path between multiple pairs of nodes in the network and constructing a matrix encompassing the estimated shortest paths. Multidimensional scaling is then applied to the matrix and the largest eigenvectors of the transformed matrix are identified. From this is constructed a relative map of the location of the pairs of nodes within the network by utilization of the eigenvectors.
    Type: Application
    Filed: October 9, 2003
    Publication date: April 14, 2005
    Inventors: Yi Shang, Wheeler Ruml
  • Publication number: 20040267679
    Abstract: A cooperative solving method for controlling a plurality of constraint problem solvers identifies complexity criteria, which provide direction for selecting and for transitioning between constraint problem solvers. The method includes randomly selecting a test point and determining whether the test point satisfies a first complexity criterion. A first constraint problem solver is selected, and an alternate test point is identified by the first solver if the complexity criterion has not been satisfied. If the alternate test point is a problem solution, it is transmitted to the system. If the alternate test point is not a problem solution or if the original randomly-selected test point satisfies the complexity criterion, a second constraint solver selects a new test point. If the new test point is a problem solution, it is transmitted to the system; if the new test point is not a solution, the cooperative solver is restarted.
    Type: Application
    Filed: June 24, 2003
    Publication date: December 30, 2004
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Markus P.J. Fromherz, Yi Shang, Lara S. Crawford
  • Publication number: 20040267680
    Abstract: A method for feedback control of cooperative problem solving for real-time applications in complex systems utilizes solvers parameterized by control variables. The method includes initializing the time setting and selecting at least one solver parameter value. The solver is operated with the selected solver parameter value or values for a specified interim and the operational conditions are reviewed. A solution is transmitted to the system if a solution quality condition is satisfied. The solver continues to operate if the solution quality condition is not satisfied and the performance differential is not greater than a specified threshold. If the solution quality condition is unsatisfied, but the performance differential exceeds the threshold, at least one alternate solver parameter value is selected and the solver is operated with the new solver parameter value for a specified interim. The solver continues to operate until the solution quality condition is satisfied.
    Type: Application
    Filed: June 24, 2003
    Publication date: December 30, 2004
    Applicant: Palo Alto Research Center Incorporated
    Inventors: Markus P.J. Fromherz, Lara S. Crawford, Yi Shang
  • Publication number: 20040246901
    Abstract: A method is presented for a time-aware strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.
    Type: Application
    Filed: June 3, 2003
    Publication date: December 9, 2004
    Applicant: Palo Alto Research Center, Incorporated
    Inventors: Ying Zhang, Markus P.J. Fromherz, Sergei Vassilvitskii, Yi Shang
  • Publication number: 20040246900
    Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.
    Type: Application
    Filed: June 3, 2003
    Publication date: December 9, 2004
    Applicant: Palo Alto Research Center, Incorporated
    Inventors: Ying Zhang, Markus P.J. Fromherz, Yi Shang, Sergei Vassilvitskii, Lara S. Crawford
  • Publication number: 20040246904
    Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.
    Type: Application
    Filed: June 3, 2003
    Publication date: December 9, 2004
    Applicant: Palo Alto Research Center, Incorporated
    Inventors: Ying Zhang, Markus P.J. Fromherz, Lara S. Crawford, Yi Shang
  • Patent number: 5799317
    Abstract: A data management system is connected to a Signaling System 7 telecommunications network (SS#7). Network elements and other data sources of the SS#7 network provide alarm data to the management system when problems occur with the network. The data management system includes a database library that classifies the problem and provides prioritized resolutions, based on past historical events. The library continues to expand with data each time an alarm is resolved. Data from the network elements are also stored for generation of reports, such as those dealing with configuration, performance, faults, and security.
    Type: Grant
    Filed: November 8, 1995
    Date of Patent: August 25, 1998
    Assignee: MCI Communications Corporation
    Inventors: Jingsha He, Yi-Shang Shen
  • Patent number: D601249
    Type: Grant
    Filed: November 14, 2008
    Date of Patent: September 29, 2009
    Assignee: Industrial Technology Research Institute
    Inventors: Chih Hsien Su, Kun Feng Lee, Yu-Jin Kao, Jhao-Syong Chen, Yi-Shang Lin, Yuh-Jiuan Lin
  • Patent number: D602387
    Type: Grant
    Filed: November 14, 2008
    Date of Patent: October 20, 2009
    Assignee: Industrial Technology Research Institute
    Inventors: Jhao-Syong Chen, Kun Feng Lee, Yu-Jin Kao, Chih Hsien Su, Yi-Shang Lin, Yuh-Jiuan Lin