Patent application number | Description | Published |
20100198837 | IDENTIFYING QUERY ASPECTS - Methods, systems, and apparatus, including computer program products, for generating aspects associated with entities. In some implementations, a method includes receiving data identifying an entity; generating a group of candidate aspects for the entity; modifying the group of candidate aspects to generate a group of modified candidate aspects comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score; and storing an association between one or more highest ranked modified candidate aspects and the entity. The aspects can be used to organize and present search results in response to queries for the entity. | 08-05-2010 |
20110302194 | SCALABLE RENDERING OF LARGE SPATIAL DATABASES - Aspects of the invention provide a service for data management and integration across a wide range of applications. Clustered computers may be arranged in a cloud-type configuration for storing and handling large amounts of user data under the control of a front-end management server. Communities of distributed users may collaborate on the data across multiple enterprises. Very large tabular data files are uploaded to the storage facilities. The data files are maintained as tables, and a composite table of related information is created and maintained in response to user queries. Different ways of visualizing the data are provided. Depending on the amount of information that can be displayed, features in a spatial index may the thinned for presentation. Spatial and structured queries are processing and results are intersected to obtain information for display. | 12-08-2011 |
20120011115 | TABLE SEARCH USING RECOVERED SEMANTIC INFORMATION - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for searching tables using recovered semantic information. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of receiving a collection of tables, each table including a plurality of rows, each row including a plurality of cells; recovering semantic information associated with each table of the collection of tables, the recovering including determining a class associated with each respective table according to a class-instance hierarchy including identifying a subject column of each table of the collection of tables; and labeling each table in the collection of tables with the respective class. | 01-12-2012 |
20120278313 | SCALABLE RENDERING OF LARGE SPATIAL DATABASES - Aspects of the invention provide a service for data management and integration across a wide range of applications. Clustered computers may be arranged in a cloud-type configuration for storing and handling large amounts of user data under the control of a front-end management server. Communities of distributed users may collaborate on the data across multiple enterprises. Very large tabular data files are uploaded to the storage facilities. The data files are maintained as tables, and a composite table of related information is created and maintained in response to user queries. Different ways of visualizing the data are provided. Depending on the amount of information that can be displayed, features in a spatial index may the thinned for presentation. Spatial and structured queries are processing and results are intersected to obtain information for display. | 11-01-2012 |
20130031083 | Determining keyword for a form page - Among other disclosed subject matter, a computer-implemented method of analyzing a form page for indexing includes identifying a form page that is configured for use in requesting any of multiple target pages, the form page including at least one text input control for retrieving any of the multiple target pages. The method includes identifying at least one keyword as being informative with regard to the text input control. The method includes updating an indexing record associated with the form page to reflect the identified keyword. | 01-31-2013 |
20130031503 | Analyzing a Form Page for Indexing - Among other disclosure, a computer-implemented method of analyzing a form page for indexing includes identifying a form page that is configured for use in requesting any of multiple target pages. The form page includes multiple input controls. The method includes identifying at least one of the multiple input controls as being informative with regard to requesting the multiple target pages. The method includes updating an indexing record associated with the form page to reflect the identification. | 01-31-2013 |
20140074854 | SCALABLE RENDERING OF LARGE SPATIAL DATABASES - Aspects of the invention provide a service for data management and integration across a wide range of applications. Clustered computers may be arranged in a cloud-type configuration for storing and handling large amounts of user data under the control of a front-end management server. Communities of distributed users may collaborate on the data across multiple enterprises. Very large tabular data files are uploaded to the storage facilities. The data files are maintained as tables, and a composite table of related information is created and maintained in response to user queries. Different ways of visualizing the data are provided. Depending on the amount of information that can be displayed, features in a spatial index may the thinned for presentation. Spatial and structured queries are processing and results are intersected to obtain information for display. | 03-13-2014 |
20150161201 | CLUSTERING QUERY REFINEMENTS BY INFERRED USER INTENT - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets. | 06-11-2015 |
Patent application number | Description | Published |
20120173507 | SEARCHING THROUGH CONTENT WHICH IS ACCESIBLE THROUGH WEB-BASED FORMS - One embodiment of the present invention provides a system that facilitates searching through content which is accessible though web-based forms. During operation, the system receives a query containing keywords. Next, the system analyzes the query to create a structured query. The system then performs a lookup based on the structured query in a database containing entries describing the web-based forms. Next, the system ranks forms returned by the lookup, and uses the rankings and associated database entries to facilitate a search through content which is accessible through the forms. | 07-05-2012 |
20120179667 | SEARCHING THROUGH CONTENT WHICH IS ACCESSIBLE THROUGH WEB-BASED FORMS - One embodiment of the present invention provides a system that facilitates searching through content which is accessible though web-based forms. During operation, the system receives a query containing keywords. Next, the system analyzes the query to create a structured query. The system then performs a lookup based on the structured query in a database containing entries describing the web-based forms. Next, the system ranks forms returned by the lookup, and uses the rankings and associated database entries to facilitate a search through content which is accessible through the forms. | 07-12-2012 |
20120179695 | SEARCHING THROUGH CONTENT WHICH IS ACCESSIBLE THROUGH WEB-BASED FORMS - One embodiment of the present invention provides a system that facilitates searching through content which is accessible though web-based forms. During operation, the system receives a query containing keywords. Next, the system analyzes the query to create a structured query. The system then performs a lookup based on the structured query in a database containing entries describing the web-based forms. Next, the system ranks forms returned by the lookup, and uses the rankings and associated database entries to facilitate a search through content which is accessible through the forms. | 07-12-2012 |
Patent application number | Description | Published |
20130179481 | MANAGING OBJECTS STORED IN STORAGE DEVICES HAVING A CONCURRENT RETRIEVAL CONFIGURATION - A data storage method for storing data in a plurality of storage devices having a concurrent retrieval configuration. The data storage method comprises storing data in a plurality of data container objects distributed among in a plurality of storage devices, storing a plurality of metadata container objects and a plurality of metadata directory objects in the plurality of storage devices, wherein each metadata directory object indexes a group of the plurality of metadata container objects and each the metadata container object comprises metadata including storage location data of at least one of the plurality of data container objects and the plurality of metadata directory objects, and managing access to the plurality of data container objects by locally executing a plurality of data control requests by the plurality of storage devices, by a module installed in the plurality of storage devices or in a proxy. | 07-11-2013 |
20130325800 | FILE MIGRATION IN A NETWORK FILE SYSTEM - A computerized method for managing file migration in one or more storage devices. The method comprises separately categorizing a plurality of segments of a file stored in a pNFS storage according to at least one control data request received from at least one client in real time, receiving a request to migrate the file from at least one source storage location of the pNFS storage to at least one destination storage location of the pNFS storage, separately copying a plurality of different subsets of the file to the at least one destination storage location in a plurality of separate instances where in each the instance a respective the subset selected according to a respective the categorization, and deleting the file from the at least one source storage location. | 12-05-2013 |
20140074899 | METHODS AND SYSTEM FOR EFFICIENT LIFECYCLE MANAGEMENT OF STORAGE CONTROLLER - A computerized method for efficient retirement process of an old controller in a computer network storage system. The method provides for combining legacy non-pNFS data storage with a new temporary parallel NFS data storage. In an embodiment, the method comprises a series of relatively short time consuming operations wherein a storage system efficiently migrates the stored data from the old controller storing legacy data stored solely under pNFS storage, wherein the efficient data migration implements the ability to reclaim layouts (pNFS, stand alone pNFS MDS) and redirect the old data to new controllers. In another embodiment the method comprises a sequence of operations under which a storage system efficiently migrates data from a storage controller that has non-pNFS data storage. In this embodiment the storage utilization during the retirement period combines both legacy non-pNFS storage, as well as new temporary pNFS storage space management. | 03-13-2014 |
20140379767 | OUT OF BAND METHODS AND SYSTEM OF ACQUIRING ACCESS DATA IN A PARALLEL ACCESS NETWORK FILE SYSTEM AND METHODS OF USING SUCH ACCESS DATA - A method for gathering access data of a file stored in one or more storage devices of a parallel access network file system. The method comprises monitoring layout requests received from a plurality of clients of the parallel access network file system, each the layout request is for a layout of data segments of one of a plurality of data objects which are stored in a plurality of storage devices of a parallel access network file system, sending to the plurality of clients a plurality of recall requests to recall a plurality of layouts requested by the plurality of layout requests, monitoring a plurality of recurring layout requests for mapping data segments of at least some of the plurality of data objects from at least some of the plurality of clients, and updating access data of the plurality of data objects according to the plurality of recurring layout requests. | 12-25-2014 |
20150201016 | METHODS AND SYSTEM FOR INCORPORATING A DIRECT ATTACHED STORAGE TO A NETWORK ATTACHED STORAGE - A Computerized storage system management methods and system configurations. In some embodiments the invention comprises a computer storage data access structure, a DS management and a storage system solution related to methods and a system geared for implementing a scale-out NAS that can effectively utilize client side Flashes while the Flash utilization solution is based on pNFS, the pNFS is comprised of a meta-data server (MDS) and data servers (DSs). There are at least one client and two Data servers, wherein at least one of them is a Direct Attached (Tier0), client level DS. Tier0 DS is a client-side resident low latency memory selected from a group of solid state memories, defined as Storage Class Memories, such as a Flash memory, serving as an integral lowest level of a storage system with a shared storage hierarchy of levels (Tier 0, 1, 2 and so on) and the unified name space. | 07-16-2015 |
Patent application number | Description | Published |
20110109309 | TECHNIQUES FOR CORRECTING MEASUREMENT ARTIFACTS IN MAGNETIC RESONANCE THERMOMETRY - Techniques for correcting measurement artifacts in MR thermometry predict or anticipate movements of objects in or near an MR imaging region that may potentially affect a phase background and then acquire a library of reference phase images corresponding to different phase backgrounds that result from the predicted movements. For each phase image subsequently acquired, one reference phase image is selected from the library of reference phase images to serve as the baseline image for temperature measurement purposes. To avoid measurement artifacts that arise from phase wrapping, the phase shift associated with each phase image is calculated incrementally, that is, by accumulating phase increments from each pair of consecutively scanned phase images. | 05-12-2011 |
20130119984 | TECHNIQUES FOR CORRECTING MEASUREMENT ARTIFACTS IN MAGNETIC RESONANCE THERMOMETRY - Techniques for correcting measurement artifacts in MR thermometry predict or anticipate movements of objects in or near an MR imaging region that may potentially affect a phase background and then acquire a library of reference phase images corresponding to different phase backgrounds that result from the predicted movements. For each phase image subsequently acquired, one reference phase image is selected from the library of reference phase images to serve as the baseline image for temperature measurement purposes. To avoid measurement artifacts that arise from phase wrapping, the phase shift associated with each phase image is calculated incrementally, that is, by accumulating phase increments from each pair of consecutively scanned phase images. | 05-16-2013 |
20150359603 | SIMULATION-BASED FOCUSED-ULTRASOUND TREATMENT PLANNING - A focused-ultrasound or other procedure for treating a target within a tissue region can be planned iteratively by creating a treatment plan specifying a treatment location pattern and stimuli applied thereto, simulating the treatment, computationally predicting an effect of the simulated treatment, comparing the predicted effect against one or more treatment constraints (such as efficacy and/or safety thresholds), and, if a constraint is violated, repeating the simulation for an adjusted treatment plan. | 12-17-2015 |
Patent application number | Description | Published |
20080273545 | Channel service manager with priority queuing - A system and method are provided for prioritizing network processor information flow in a channel service manager (CSM). The method receives a plurality of information streams on a plurality of input channels, and selectively links input channels to CSM channels. The information streams are stored, and the stored the information streams are mapped to a processor queue in a group of processor queues. Information streams are supplied from the group of processor queues to a network processor in an order responsive to a ranking of the processor queues inside the group. More explicitly, selectively linking input channels to CSM channels includes creating a fixed linkage between each input port and an arbiter in a group of arbiters, and scheduling information streams in response to the ranking of the arbiter inside the group. Finally, a CSM channel is selected for each information stream scheduled by an arbiter. | 11-06-2008 |
20120327951 | Channel Service Manager with Priority Queing - A system and method are provided for prioritizing network processor information flow in a channel service manager (CSM). The method receives a plurality of information streams on a plurality of input channels, and selectively links input channels to CSM channels. The information streams are stored, and the stored the information streams are mapped to a processor queue in a group of processor queues. Information streams are supplied from the group of processor queues to a network processor in an order responsive to a ranking of the processor queues inside the group. More explicitly, selectively linking input channels to CSM channels includes creating a fixed linkage between each input port and an arbiter in a group of arbiters, and scheduling information streams in response to the ranking of the arbiter inside the group. Finally, a CSM channel is selected for each information stream scheduled by an arbiter. | 12-27-2012 |
20140092915 | Channel Service Manager - A system and method are provided for prioritizing network processor information flow in a channel service manager (CSM). The method receives a plurality of information streams on a plurality of input channels, and selectively links input channels to CSM channels. The information streams are stored, and the stored the information streams are mapped to a processor queue in a group of processor queues. Information streams are supplied from the group of processor queues to a network processor in an order responsive to a ranking of the processor queues inside the group. More explicitly, selectively linking input channels to CSM channels includes creating a fixed linkage between each input port and an arbiter in a group of arbiters, and scheduling information streams in response to the ranking of the arbiter inside the group. Finally, a CSM channel is selected for each information stream scheduled by an arbiter. | 04-03-2014 |