Processing Sequentially Ordered Data, E.g., Alpha-numerically Ordered, Etc. (epo) Patents (Class 707/E17.104)
  • Patent number: 11941065
    Abstract: Systems and methods are described for generating record clusters. The methods comprise receiving a plurality of records from data sources and providing at least a subset of the records to a scoring model that determines scores for various pairings of the records, a score for a given pair of the records representing a probability that the given pair of records contain data elements about the same entity. The method further comprises generating a graph data structure that includes a plurality of nodes, individual nodes representing a different record from the records. The method also comprises assigning a different unique identifier to individual clusters of the final clusters and responding to a request for data regarding a given entity by providing aggregated data elements from those records of the records associated with a cluster of the final clusters having an identifier that represents the given entity.
    Type: Grant
    Filed: September 11, 2020
    Date of Patent: March 26, 2024
    Assignee: Experian Information Solutions, Inc.
    Inventors: Hua Li, Sophie Liu, Yi He, Zhixuan Wang, Chi Zhang, Kevin Chen, Shanji Xiong, Christer Dichiara, Mason Carpenter, Mark Hirn, Julian Yarkony
  • Patent number: 11841909
    Abstract: A method, computer system, and a computer program for analyzing a webpage content is provided. The present invention may include receiving a plurality of terms, including a plurality of structural information, derived from one or more responses to a faceted search query. The present invention may also include extracting a plurality of facet values from the plurality of terms. The present invention may then include generating an analysis of each facet value of the plurality of facet values. The present invention may further include determining a type of each facet value of the plurality of facet values based on the analysis. The present invention may also include generating an optimized web site mode interface including the analysis and displaying the optimized web site mode interface to a user.
    Type: Grant
    Filed: February 11, 2022
    Date of Patent: December 12, 2023
    Assignee: International Business Machines Corporation
    Inventors: Keisuke Nitta, Daiki Tsuzuku, Tohru Hasegawa, Shunsuke Ishikawa, Yasumasa Kajinaga
  • Patent number: 11693832
    Abstract: An example method of generating telemetry data from application programming interface (API) data in a computing system includes: obtaining the API data from a plurality of software components executing in a plurality of client computers; serializing the API data for transmission from the client computers to a server computer, the serialized data including a parent object having a child object; and generating the telemetry data having a relational schema from the serialized telemetry data by generating a table for the parent object and storing attributes of the child object in the table generated for the parent object.
    Type: Grant
    Filed: March 15, 2018
    Date of Patent: July 4, 2023
    Assignee: VMWARE, INC.
    Inventor: Rumen Barov
  • Patent number: 10909169
    Abstract: An information processing apparatus includes a first acquiring unit configured to acquire file management information regarding one or more image files contained in a folder, a sorting unit configured to sort the file management information acquired by the first acquiring unit, a second acquiring unit configured to access image files corresponding to a first piece of the file management information and a last piece of the file management information among the pieces of file management information sorted by the sorting unit and acquire meta information regarding the two image files, and an identifying unit configured to identify a range of capture dates of the image files contained in the folder based on the meta information acquired by the second acquiring unit.
    Type: Grant
    Filed: August 3, 2016
    Date of Patent: February 2, 2021
    Assignee: Canon Kabushiki Kaisha
    Inventor: Mizuki Hayakawa
  • Patent number: 10417097
    Abstract: A system is provided for creating selective snapshots of a database that is stored as one or more segments, wherein a segment comprises one or more memory pages. The system includes a memory storage comprising instructions and one or more processors in communication with the memory. The one or more processors execute the instructions to determine whether a snapshot process is configured to access a selected segment of the one or more segments, assign a positive mapping status to an accessed segment for which the determining unit has determined that it is accessed by the snapshot process and to assign a negative mapping status to a non-accessed segment, and create a snapshot comprises a step of forking the snapshot process with an address space that comprises a subset of the one or more segments.
    Type: Grant
    Filed: September 11, 2017
    Date of Patent: September 17, 2019
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Eliezer Levy, Antonios Iliopoulos, Shay Goikhman, Israel Gold
  • Patent number: 10025823
    Abstract: Techniques are described herein for filtering data from a table during an in-memory scan. Predicates are pushed to in-memory scan to avoid scanning unnecessary columnar units and reduce the overhead of decompressing, row stitching and distributing data during evaluation. Techniques are described herein for generating implied predicates that have conditions on single columns from complex predicates that have multiple conditions on the same column, which can be evaluated during an in-memory scan. Techniques are also described herein to reduce the overhead of a table scan for processing a join query. When redistributing a first table for performing a hash-join, the nodes performing an in-memory scan of the first table may create a filter that tracks unique values from the join key. Data from the second table is only processed and transferred to other nodes in the cluster if the values from the join key pass through the filter.
    Type: Grant
    Filed: July 22, 2015
    Date of Patent: July 17, 2018
    Assignee: Oracle International Corporation
    Inventors: Dinesh Das, Jiaqi Yan, Mohamed Zait, Nirav Vyas
  • Patent number: 9858590
    Abstract: Different ad selection techniques may be evaluated and compared by (i) combining ads generated using at least two different techniques and (ii) determining performance statistics of these combined (e.g., interleaved) advertising serves over time. The relative performance of the different techniques can then be determined. These principles can also be used to gauge different ad scoring techniques. These principles can also be used to gauge different ad rendering techniques.
    Type: Grant
    Filed: December 30, 2003
    Date of Patent: January 2, 2018
    Assignee: Google Inc.
    Inventors: Jeffrey A. Dean, Georges R. Harik, Noam Shazeer, Simon Tong
  • Patent number: 9661074
    Abstract: A method begins by a dispersed storage (DS) processing module of a dispersed storage network (DSN) determining whether a change has occurred to a data object of a set of data objects. When a change has occurred, the method continues with the DS processing module accessing de-duplication tracking data for the set of data objects. When the change is deletion of an identified data object of the set of data objects, the method continues with the DS processing module determining whether the identified data object is the only data object in the set of data objects. When the identified data object is not the only data object in the set of data objects, the method continues with the DS processing module updating the linking information to delete linking the identified data object to addressing information.
    Type: Grant
    Filed: June 30, 2014
    Date of Patent: May 23, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONS
    Inventor: Andrew George Peake
  • Patent number: 9594742
    Abstract: A method and apparatus for matching equivalent words across languages takes advantage of a set of rules that are built from a user-defined language specification (UDLS), which may be open source and customizable by a language expert. The UDLS is used to build a customer language library (CLL) that includes a list of consonants, a list of vowels, and rules defining phoneme equivalencies across two languages. The CLL is used to match equivalent words by both two-set and three-set matching to not only increase the number of true matches (i.e., overall accuracy), but also improve recognition of variations in a manner that is not language specific.
    Type: Grant
    Filed: July 17, 2014
    Date of Patent: March 14, 2017
    Assignee: Acxiom Corporation
    Inventors: Gon Yi, Aaron Miyahira, Pavan Marupally
  • Patent number: 9418151
    Abstract: Generally discussed herein are systems and methods for lexically enriching structured and semi-structured data. In one or more embodiments, a method can include receiving a code, lexicalizing the code, lexically combining the lexicalized code with a lexical descriptor, and sending the lexical combination to a keyword database.
    Type: Grant
    Filed: June 12, 2013
    Date of Patent: August 16, 2016
    Assignee: Raytheon Company
    Inventor: Arthur R. Culbertson
  • Publication number: 20130290352
    Abstract: Methods for generating a query input string include sorting a first input relation and a second input relation in order from the first relation to the second relation. The second input relation is concatenated to the first input relation, and the concatenated input relations are stored in a single string.
    Type: Application
    Filed: April 26, 2012
    Publication date: October 31, 2013
    Inventors: Qiming Chen, Meichun Hsu
  • Publication number: 20130185316
    Abstract: This document describes, in various implementations, controlling access to information stored in a storage device. The information stored in the storage device is accessed in a desired order without sorting the stored information prior to access.
    Type: Application
    Filed: January 13, 2012
    Publication date: July 18, 2013
    Inventor: Hermann Sauer
  • Publication number: 20130054623
    Abstract: A computer-implemented method for tagging a database keyword to a data set or image file having the steps: initiating an act; recording a data set on an electronic device; transmitting the data set to a server; scanning the data set; scanning the database for database information that matches the data set; associating the database information that matches the data set with the matching data set; transmitting a database keyword associated with the database information to the electronic device; tagging the database keyword to a data set file; and imbedding the database keyword into an image file associated with the data set.
    Type: Application
    Filed: June 14, 2012
    Publication date: February 28, 2013
    Inventor: Peichen Chang
  • Publication number: 20130007023
    Abstract: Embodiments of the invention relate to query processing and consolidation of query results. Multiple queries may be submitted to one or more search engines, with each query having the same or different returned query items with the same or different sorting arrangement of the returned query items. The returned query items are consolidated into a single sorted set, with the sort being based upon a logical assessment and comparison of the multiple returned query items.
    Type: Application
    Filed: June 29, 2011
    Publication date: January 3, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Michelle Davis, Mark E. Maresh, Eric A. Stegner, Robert W. Stegner
  • Publication number: 20120284286
    Abstract: In a mobile terminal, which is able to access resources available over a network, a navigation history is stored. Specifically, the resources are stored in an order in which they are visited by a user, whereby the user can navigate through the stored resources in reverse order by means of a back button. When the stored resources contain a predetermined number of occurrences of a specific resource, the predetermined number being at least two, and the user navigates to the specific resource again, the stored resources between two of said occurrences of the specific resource, and one of said occurrences of the specific resource, are deleted from the stored navigation history.
    Type: Application
    Filed: February 12, 2010
    Publication date: November 8, 2012
    Applicant: Telefonaktiebolaget L M Ericsson (publ)
    Inventor: Frederik Hugo Zwaal
  • Publication number: 20120271838
    Abstract: The present invention relates to an algorithm that retrieves only k data elements having the largest (or smallest) key values from a dataset (i.e., top-k results) in a time linearly proportional to the size of the dataset. The proposed method using the algorithm finds the top-k results using a k-sized min (or max) heap structure that maintains candidate elements of the top-k results by scanning all data elements in the dataset only once. In other words, the present invention provides a linear-time top-k sort method that finds top-k results in a time linearly proportional to the size of the dataset (i.e., O(n) time complexity), while conventional sort algorithms for finding top-k results cannot find the top-k results in a time linearly proportional to the size of the dataset (i.e., at least O(n log n) time complexity).
    Type: Application
    Filed: November 28, 2011
    Publication date: October 25, 2012
    Applicant: KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY
    Inventors: Kyu-Young WHANG, Min Soo KIM, Jeong-Hoon LEE
  • Publication number: 20120259871
    Abstract: Methods, systems, and apparatuses, including computer programs encoded on computer readable media, for generating Venn-like diagram illustrating cross channel conversion paths. In one aspect, a plurality of conversion paths are received. Each conversion path includes one or more user interactions that include a plurality of dimensional data. A sorted list of channel groups that includes one or more group rules is received and each user interaction is grouped into a channel based upon the channel groups. A selection of channels to visualize is received and an image including one circle for each selected channel is generated. The circles are optimally placed to maximize the accuracy of the overlapped regions with channel group data.
    Type: Application
    Filed: April 11, 2011
    Publication date: October 11, 2012
    Inventors: Laura HOLMES, Cody Cai, Leo Baghdassarian, Sissie Ling-Ie Hsiao
  • Publication number: 20120166453
    Abstract: A request is received, over a network from a requesting user to sort a plurality of comments relating to online content by a social status of a respective one of a plurality of commenters associated with each of the plurality of comments. The social status of the each of the plurality of commenters is determined using a computing device. The plurality of comments are sorted, using the computing device, by the social status of the respective one of the plurality of commenters associated with each of the plurality of comments. A representation of the sorted comments is transmitted, over the network, to the requesting user. The social status of commenters can reflect, in various embodiments, the status of commenters as favorite commenters of the requesting user, as members of the requesting user's social network, or as a top rated commenters in an online community.
    Type: Application
    Filed: December 22, 2010
    Publication date: June 28, 2012
    Applicant: Yahoo! Inc.
    Inventor: Andrei Broder
  • Publication number: 20120166454
    Abstract: A computer-implemented method for generating a hierarchy-based trace log includes: receiving a log generated by a trace program performed in a computer system, the log having entries organized by sequence number, each entry including an object key for an object involved in the traced event and a log message about the traced event; identifying all object keys that occur in the log; assigning different separation values to each of the entries; generating respective adjusted sequence numbers for all of the entries by combining each entry's sequence number with the separation value for that entry; and storing an adjusted log having entries organized by the adjusted sequence numbers.
    Type: Application
    Filed: December 22, 2010
    Publication date: June 28, 2012
    Applicant: SAP AG
    Inventor: Long Fung Chen
  • Publication number: 20120150877
    Abstract: A method for compressing data. The method includes accessing, within an electronic system, a database relation comprising a plurality of attributes and determining a sort order of the plurality of attributes of the database relation. The method further includes determining an order of a plurality of compression operators operable to compress the database relation and compressing the database relation to produce a compressed database based on the sort order and the order of the plurality compression operators.
    Type: Application
    Filed: December 9, 2010
    Publication date: June 14, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Ravishankar Ramamurthy, Abhijeet Mohapatra
  • Publication number: 20120089607
    Abstract: Methods and systems for organizing, representing and processing polymeric sequence information, including biopolymeric sequence information such as DNA sequence information and related information are disclosed herein. Polymeric sequence and associated information may be represented using a plurality of data units, each of which includes one or more headers and a payload containing a representation of a segment of the polymeric sequence. Each header may include or be linked to a portion of the associated information.
    Type: Application
    Filed: August 31, 2011
    Publication date: April 12, 2012
    Applicant: ANNAI SYSTEMS, INC.
    Inventors: Lawrence Ganeshalingam, Patrick Nikita Allen
  • Publication number: 20120054207
    Abstract: The present invention relates to a circuit for sorting a set of data values, the circuit comprising a first set of p+q registers for storing the p+q largest data values of the set of data values including p statistical outliers; a second set of p+q registers for storing the p+q smallest data values of the set of data values including p statistical outliers, wherein p is a non-negative integer and q is a positive integer; a controller coupled to each register in said first and second sets, said controller being arranged to: receive the set of data values and for each data value obtain a comparison result of the data value with the respective data values in each of said registers; and update said registers as a function of said comparison results; the circuit further comprising a data processing circuit coupled to at least the q registers in said first and second sets, which for instance may be used to produce an average value of the data values stored in said q registers in response to the controller.
    Type: Application
    Filed: July 26, 2011
    Publication date: March 1, 2012
    Applicant: NXP B.V.
    Inventors: Hubertus Gerardus Hendrikus Vermeulen, Jan Staschulat, Andre Krijn Nieuwland, Elisabeth Francisca Maria Steffens
  • Publication number: 20120047146
    Abstract: The present invention is directed to methods and systems for assisting users in an ecommerce environment. The method includes displaying a user interface of including products. Each of the products have associated attributes. Each of the associated attributes are displayed in the user interface with an associated selection tool. The method further includes receiving one or more selections of the selection tools indicating selection of one or more of the associated attributes. The one or more selections provide a ranking of each of the selected attributes. For each of the products, the method calculates a real-time score total and displays the real-time score total within the user interface. The calculating includes determining a weighted value for each of the products based on an aggregation of each of the selected associated attributes of the product. Further, the method includes displaying a ranked list of the products based on the determined weighted values of each of the products.
    Type: Application
    Filed: August 17, 2010
    Publication date: February 23, 2012
    Applicant: Oracle International Corporation
    Inventors: Kannan Balakrishnan, Robert Carini
  • Publication number: 20120016890
    Abstract: Systems, methods and computer program products are disclosed herein for assigning visual characteristics to records of a data structure and displaying those records. In response to an attribute being selected, records of the data structure may be sorted by values of the selected attribute of the records. A first set of records having values of the selected attribute that correspond to a first value may be identified. A second set of records having values of the selected attribute that correspond to a second value also may be identified. A first visual characteristic may automatically be assigned to each record of the first set of records and a second visual characteristic, that is different from the first visual characteristic, may be automatically assigned to each record of the second set of records.
    Type: Application
    Filed: July 15, 2010
    Publication date: January 19, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sukadev Bhattiprolu, Venkateswararao Jujjuri, Haren Myneni, Malahal R. Naineni, Badari Pulavarty, Chandra Seetharaman, Narasimha N. Sharoff
  • Publication number: 20110307471
    Abstract: Techniques for accelerating an operation in a database management system are provided. The techniques include reading data pertaining to a database management system operation from a storage unit, sending the database management system operation data to an accelerator unit, and processing the database management system operation data via the accelerator unit, wherein processing the data via the accelerator unit comprises using a multithreaded execution unit and compression hardware to perform the database management system operation with reduced execution time.
    Type: Application
    Filed: June 9, 2010
    Publication date: December 15, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Vadim Sheinin
  • Publication number: 20110289094
    Abstract: Media content databases are integrated by comparing metadata from records and determining that the metadata are a match based on the comparison. Alphanumeric strings are generated and assigned to the metadata, and the alphanumeric strings and fields of the records are stored in a data structure.
    Type: Application
    Filed: September 3, 2010
    Publication date: November 24, 2011
    Applicant: ROVI TECHNOLOGIES CORPORATION
    Inventor: James R. Fisher
  • Publication number: 20110231415
    Abstract: The present invention relates to a web search system and a method thereof based on a web page connection time and a web page visiting frequency. The web search system and the method thereof based on the web page connection time and the web page visiting frequency according to an embodiment of the present invention comprises the steps of: extracting the web page connection time of a user; calculating an accumulated connection time of the web page using the extracted connection time; and providing a list of web pages searched by the user after sorting the web pages in order of a ratio of the accumulated connection time.
    Type: Application
    Filed: November 28, 2008
    Publication date: September 22, 2011
    Applicant: ESTsoft Corp
    Inventor: Jang-Joong Kim
  • Publication number: 20110173212
    Abstract: A computer-implemented method is provided for ranking files from an Internet search. In one embodiment, the method comprises assigning a score to each file based on at least one of the following factors: recency, editorial popularity, clickthru popularity, favorites metadata, or favorites collaborative filtering. The file may be organized based on the assigned scores to provide users with more accurate search results.
    Type: Application
    Filed: March 18, 2011
    Publication date: July 14, 2011
    Inventors: Timothy D. Tuttle, Adam L. Beguelin, Peter F. Kocks
  • Publication number: 20110153623
    Abstract: A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform.
    Type: Application
    Filed: December 22, 2009
    Publication date: June 23, 2011
    Inventor: Kiem-Phong Vo
  • Publication number: 20110125800
    Abstract: An ordered sequence of two or more facet provider objects are associated and each is configured to select successive subsets of data in a registry via a database upon a user request to create and configure a faceted selection. Upon a user selection of a save feature, each associated facet provider object is serialized in the ordered sequence, and each serialization is collected into an ordered list of serializations and saved. The serialization of each facet provider object is performed by one of the respective facet provider object and a facet provider object of a same type as the respective facet provider object. A selection statement is constructed from the associated facet provider objects in the ordered sequence. A difference between the constructed selection statement and an actual selection statement is calculated and the selection statement difference is appended to the saved ordered list of serializations.
    Type: Application
    Filed: January 12, 2010
    Publication date: May 26, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David J. Seager, Martin J. Smithson
  • Publication number: 20110106822
    Abstract: A computer implemented method, data processing system, and computer program product for performing a virtual list view search in a distributed directory environment using a proxy server. The mechanism described in the illustrative embodiments enables a proxy server to provide virtual list view search support in a distributed directory environment when data is partitioned across multiple directory servers.
    Type: Application
    Filed: January 11, 2011
    Publication date: May 5, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Yogesh Vilas Golwalkar, Kristin Marie Hazlewood, Rajalakshmi S. Iyer, Magesh Rajamani
  • Publication number: 20110093477
    Abstract: A computer-implemented method for estimation of order-based statistics on slowly changing distributions of data stored on a computer. An initial set of data is converted to an initial histogram based representation of the data set's distribution. New or removed data is converted into a new histogram separate from the initial histogram. The new histogram is combined with the initial histogram to build a combined histogram. Percentiles and order-based statistics are estimated from the combined histogram to provide analysis of a combination of the initial set of data combined with the new or removed data.
    Type: Application
    Filed: February 10, 2010
    Publication date: April 21, 2011
    Applicant: TERADATA US, INC.
    Inventor: Bruce E. Aldridge
  • Publication number: 20110078161
    Abstract: A system and method for sharing and displaying lists among multiple users is disclosed. In one embodiment, the method comprises receiving a first list of items from a first user device, generating a sorted list based on at least the first list and a second list, and displaying the sorted list. Multiple lists of items can be received from user devices having a small screen and the sorted list can be displayed on a large screen viewable by the multiple users of the user devices.
    Type: Application
    Filed: September 30, 2009
    Publication date: March 31, 2011
    Applicant: Samsung Electronics Co., Ltd.
    Inventors: Dang Tran, Andrew Shelansky, Esther Zheng, Michael Lovelace
  • Publication number: 20110078150
    Abstract: A method comprises receiving a plurality of emails. Each of the plurality of emails comprises message information and header information. The header information comprises subject information and one or more email addresses. The method further comprises generating filtered email data comprising email addresses by at least filtering message information and subject information from each of the plurality of emails. The method further comprises correlating sender information and recipient information in the filtered email data, the correlation based at least in part on the one or more email addresses. The method further comprises storing in memory one or more email addresses from the filtered email data.
    Type: Application
    Filed: June 4, 2010
    Publication date: March 31, 2011
    Applicant: Bank of America Corporation
    Inventors: Tamer Rashad, Kenneth Brady, Kenny Keung Sing Lee, Jillian Moo-Young, Sapna Vyas
  • Publication number: 20110055203
    Abstract: Methods, systems, graphical user interfaces, and computer-readable media for visually searching and exploring a set of objects are provided. A computer system executes a method that generates three-dimensional representations or two-dimensional representations for a set of objects in response to a user interaction with an interface that displays the three-dimensional representations or the two-dimensional representations. The interface includes filter controls, sorting controls, and classification controls, which are dynamically altered based on the content of a user query or the attributes of the objects in the three-dimensional representations or two-dimensional representations.
    Type: Application
    Filed: August 31, 2009
    Publication date: March 3, 2011
    Applicant: Microsoft Corporation
    Inventors: ZACHARY MARK GUTT, PAUL RONALD RAY, RODNEY COLEMAN EDWARDS, DARWIN KENGO YAMAMOTO, HADY MOUSTAFA ABOU EL KHEIR, BRIAN WHALEN MACDONALD, JERRY DANIEL BAIN
  • Publication number: 20110016024
    Abstract: A computerized system and method for organizing and cataloging product approval data wherein on-line access to such data is provided via a global computer network is disclosed. The system continuously imports data from each approval entity and provides a singular, next generation, information retrieval functions. The system also advances the art of approval information management by allowing manufacturers of approved products the ability to add metadata, which provides additional information to be searched along with product approval data. A significant aspect of the present invention involves providing a search system, available via a global computer network such as the Internet, having the ability to enter, search, use, and most importantly assist in sorting and applying data from the product approvals to assist the user in gaining an accurate understanding of the approved product. Forward and reverse search features “inside” product approvals, product comparisons, and product details are provided.
    Type: Application
    Filed: July 14, 2010
    Publication date: January 20, 2011
    Inventor: Frank Bennardo
  • Publication number: 20100228783
    Abstract: A method for desensitizing character strings comprises ordering an original set of character strings and generating a tree structure that has nodes corresponding to the ordered set of sensitive strings. The sensitive characters on the nodes of the tree are then desensitized in depth-first order such that a set of desensitized strings is generated that preserves the ordering of the original sensitive set.
    Type: Application
    Filed: March 6, 2009
    Publication date: September 9, 2010
    Inventors: Maria G. Castellanos, Umeshwar Dayal, Bin Zhang
  • Publication number: 20100228745
    Abstract: Embodiments of methods, apparatuses, devices and systems associated with sorting candidate values are disclosed.
    Type: Application
    Filed: March 3, 2009
    Publication date: September 9, 2010
    Applicants: Yahoo!, Inc., a Delaware Corporation, Brown University
    Inventors: Aris Anagnostopoulos, Shanmugasundaram Ravikumar, Mohammad Mahdian, Eli Upfal
  • Publication number: 20100223236
    Abstract: A processing device and a method dynamically aggregates desired content. A user may specify a fallback definition for a pivot point via a user interface. The fallback definition may include at least a first and a second desired value for the pivot point. Only assets, including content having metadata with values corresponding to provided desired values for one or more pivot points, may be listed in a created list of assets. The list of assets may be sorted to provide a sorted list of assets, which may be ordered such that assets having content associated with a first desired value of the fallback definition appear before assets having content associated with a second desired value of the fallback definition. Each respective asset listed in the sorted list of assets may be added to a set of aggregated content when an equivalent asset is not already included in the set.
    Type: Application
    Filed: February 27, 2009
    Publication date: September 2, 2010
    Applicant: Microsoft Corporation
    Inventors: Paul Buckley Lorah, Corneliu Moiceanu, Miguel Angel Gonzalez Perez, Columbus Steward, JR.
  • Publication number: 20100223241
    Abstract: The disclosed embodiments present a system, method, and computer program product for certifying a timestamp generated by a data processing system. In some embodiments, the method includes receiving a request to certify a timestamp generated by a trusted data processing system, analyzing historical data related to a system time of the data processing system, and certifying the timestamp in response to determining that the historical data indicates a trustworthy system time of the data processing system when the timestamp was generated.
    Type: Application
    Filed: February 27, 2009
    Publication date: September 2, 2010
    Applicant: International Business Machines Corporation
    Inventors: Riaz Y. Hussain, Phani Gopal V. Achanta, Frank Eliot Levine
  • Publication number: 20100223269
    Abstract: An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set.
    Type: Application
    Filed: February 27, 2009
    Publication date: September 2, 2010
    Applicant: International Business Machines Corporation
    Inventors: Yefim Shuf, Hong Min, Hubertus Franke, Allan B. Lebovitz
  • Publication number: 20100211578
    Abstract: In an embodiment, a computer system includes a plurality of inventor profile records stored on one or more storage devices, the plurality of inventor profile records each recording a name of a living person in a name field. The system further includes a plurality of patents represented by a plurality of patent records stored on the one or more storage devices, wherein each patent record records at least an inventor name and a patent number, in respectively, at least one inventor name field and a patent number field. A computer program operable on one or more processors adapts a computer system to display a patent search interface on a display device, the patent search interface including at least one field or selection tool to receive patent search criteria input from at least one user input device to match to one or more fields in a patent record.
    Type: Application
    Filed: February 12, 2010
    Publication date: August 19, 2010
    Applicant: Patent Buddy, LLC
    Inventors: Steven W. Lundberg, Janal Kalis
  • Publication number: 20100153450
    Abstract: Disclosed herein are systems, computer-implemented methods, and computer-readable media for authentication using a shared table. The method receives an authentication challenge from a first entity including an accumulator with an initial value, lists of elements in a shared table, and a list of sorting algorithms, each sorting algorithm is associated with one of the lists of elements and modified to include embedded instructions operating on the accumulator. The method then generates a temporary table for each list of elements in the shared table by copying elements from the shared table as indicated in each respective list of elements, each temporary table being associated with one sorting algorithm in the list of sorting algorithms. The method sorts each generated temporary table with the associated sorting algorithm, thereby updating the accumulator with the embedded instructions. Finally, the method transmits the updated accumulator to the first entity for verification.
    Type: Application
    Filed: December 15, 2008
    Publication date: June 17, 2010
    Applicant: Apple Inc.
    Inventors: Pierre Betouin, Mathieu Ciet, Augustin J. Farrugia
  • Publication number: 20100125579
    Abstract: A data storage apparatus, for allowing querying of structured data, in which the structure of the data and the values of the data are stored separately, the apparatus comprising a computer system including a memory, a sequence of data values stored in a first location of the memory and a structural definition data stored in a second location in the memory, each data value in the record having a stored definition identifier which corresponds to at least a portion of the structural definition data, wherein the queryable structured data comprises the sequence of data values set to a structure defined by the values corresponding portion(s) of the structural definition data, such that the structure of the data and the data content/values can be altered independently by altering the structural definition data or sequence of data values respectively or by altering one or more definition identifiers.
    Type: Application
    Filed: March 26, 2007
    Publication date: May 20, 2010
    Inventors: Andrew Pardoe, Jason Hart
  • Publication number: 20100121848
    Abstract: Systems and methods (“utility”) for sorting a plurality of complex objects are provided herein. The utility may include a sorting algorithm that sorts references to the complex objects, rather than the complex objects themselves, such that the need to copy and swap complex objects in their locations in memory is reduced. Further, the sorting algorithm may utilize a recursive divide and conquer process, using multiple pivot elements at each sorting level. For example, the sorting algorithm is based on a modified Quicksort algorithm that uses multiple pivot elements at each level to sort an array of references that point to complex objects.
    Type: Application
    Filed: November 12, 2008
    Publication date: May 13, 2010
    Applicant: SUN MICROSYSTEMS, INC.
    Inventors: Vladimir Yaroslavskiy, Elena Ivanova, Vitaly Bychkov
  • Publication number: 20100070513
    Abstract: A method for sorting look-and-feel contents includes: obtaining a look-and-feel package which comprises attribute information of the look-and-feel package; and creating an appropriate storage object for the look-and-feel package and storing the look-and-feel package in association with the storage object. A method for managing look-and-feel contents includes: receiving a look-and-feel package management command which comprises attribute information of a look-and-feel package and type information of the management command; and performing an appropriate management operation on a storage object associated with the look-and-feel package according to the type information of the management command.
    Type: Application
    Filed: August 12, 2009
    Publication date: March 18, 2010
    Applicant: Huawei Technologies Co., Ltd.
    Inventors: Rui Wang, Xiaoqian Chai, Kepeng Li, Hui Zhao, Yaoping Luo
  • Publication number: 20100062425
    Abstract: The invention relates to a method for determining the level of Fel d1 expression in a cat, the method comprising: a) typing one or more polymorphic positions of the Fel d1 gene in a sample from the cat; and b) thereby determining the level of Fel d1 expression.
    Type: Application
    Filed: July 6, 2006
    Publication date: March 11, 2010
    Applicant: MARS INCORPORATED
    Inventors: Chris Jones, Paul Jones, Clive Tregaskes, Carina Salt
  • Publication number: 20090319524
    Abstract: A customized, specialty-oriented database and index, of a subject matter area and methods for constructing and using such a database are provided. Selection and indexing of articles is done by experts in the topic with which the database is concerned. As a result, articles are indexed in a manner that allows facile, rapid retrieval of highly relevant articles with few or no false positives with much reduced database maintenance cost through frugal limitation of number of documents in the database, number of terms in a Master Index, and number of codes assigned to each document. A thesaurus allows indexing and search in accordance with terminology familiar to different anticipated groups of users (e.g. doctors, patients, nurses, technicians, and the like). Key articles collections and rapid access to documents therein are also provided.
    Type: Application
    Filed: May 26, 2009
    Publication date: December 24, 2009
    Inventor: John Marshall Nelson
  • Publication number: 20090299954
    Abstract: A library of jobs is created, with the jobs performing predetermined functions. The jobs include a termination indication, which is success or failure. Input file formats of known file types are determined and a job stream to process the input files is constructed of the jobs linked according to the termination success or failure of the preceding job.
    Type: Application
    Filed: July 31, 2009
    Publication date: December 3, 2009
    Inventors: Gary A. Hoberman, Lestan D'Souza
  • Publication number: 20090276428
    Abstract: In the field of computer-based data processing, data sorting is an important issue. Among various sorting methods, Quick Sort is generally used. However, there is a problem that using Quick Sort makes sort time longer if the data to be sorted is already partially or fully in order. The invention solves the above-mentioned problem and makes the complexity of the sorting lower than or at least equal to that of Quick Sort. Thus, it provides a faster sorting method than Quick Sort does.
    Type: Application
    Filed: April 30, 2008
    Publication date: November 5, 2009
    Inventors: BYUNG BOK AHN, INSIK CHIN, KYUNGCHEOL KIM, HUNGTAE KIM, JUNGWON RHYU