Patents by Inventor Nong Ye

Nong Ye 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: 6907436
    Abstract: A method for classifying data involves receiving a set of training data from a physical process such as a computer network (20). The training data has attribute data and target data. The target data has a class label associated with the attribute data. Dummy clusters are derived from centroid coordinates of the training data associated with the class label (22). Distance measures are determined between the training data and a plurality of clusters which include the dummy clusters (24). Real clusters are created in the plurality of clusters if the training data is closest to a dummy cluster or a cluster having a class label different than the class label associated with the training data (26). A closest match between data to be classified and the plurality of clusters is identified (28) and the data is classified as the class label of the closest match from the plurality of clusters (30).
    Type: Grant
    Filed: October 26, 2001
    Date of Patent: June 14, 2005
    Assignee: Arizona Board of Regents, acting for and on behalf of Arizona State University
    Inventors: Nong Ye, Xiangyang Li
  • Publication number: 20040237087
    Abstract: Job scheduling techniques to reduce the variance of waiting time for stable performance delivery jobs from requesting entities such as PCs connected by a network to a resource such as a server in batches. Each batch contains N or less jobs. A first, waiting buffer can receive the requests and a second, processing buffer receives each batch from the waiting buffer. A batch of jobs to be processed are arranged by a routine called the “Yelf Spiral” in which the list of jobs is begun by placing the smallest job at the center of the list and each succeeding larger job (the next smallest) is placed alternately to the left and right of the smallest job until the largest job has been placed on the list. The jobs are then performed in the order that places the largest job last.
    Type: Application
    Filed: May 10, 2004
    Publication date: November 25, 2004
    Inventors: Nong Ye, Xueping Li, Toni Farley, Harish Bashettihalli
  • Publication number: 20020161763
    Abstract: A method for classifying data involves receiving a set of training data from a physical process such as a computer network (20). The training data has attribute data and target data. The target data has a class label associated with the attribute data. Dummy clusters are derived from centroid coordinates of the training data associated with the class label (22). Distance measures are determined between the training data and a plurality of clusters which include the dummy clusters (24). Real clusters are created in the plurality of clusters if the training data is closest to a dummy cluster or a cluster having a class label different than the class label associated with the training data (26). A closest match between data to be classified and the plurality of clusters is identified (28) and the data is classified as the class label of the closest match from the plurality of clusters (30).
    Type: Application
    Filed: October 26, 2001
    Publication date: October 31, 2002
    Inventors: Nong Ye, Xiangyang Li