896 results about "Cluster based" patented technology

A clustering architecture that dynamically groups the search result documents into clusters labeled by phrases extracted from the search result snippets. Documents related to the same topic usually share a common vocabulary. The words are first clustered based on their co-occurrences and each cluster forms a potentially interesting topic. Keywords are chosen and then clustered by counting co-occurrences of pairs of keywords. Documents are assigned to relevant topics based on the feature vectors of the clusters.

Methods of generating heat maps of assets using clustering of assets are disclosed. Some methods include receiving a list of assets, assigning the assets to one or more heat range categories based on the status of the assets, assigning assets operating within a zone to a zone cluster, assigning the assets of the zone cluster to category clusters based on the heat range categories assigned to the assets. The positions of the clusters may be calculated for mapping, and may be displayed on a map. Some embodiments of these methods allow a user to quickly detect and locate non-standard assets on a map while standard assets are consolidated to clusters that are less prominent to the user. This leads to minimizing the time required to form responses to de-load hotspots in an electrical grid, minimizing the cost of assets by reducing the need for hardware redundancy, and minimized equipment outages.

Systems and methods are described for coordinating transmissions in distributed wireless systems via user clustering. For example, a method according to one embodiment of the invention comprises: measuring link quality between a target user and a plurality of distributed-input distributed-output (DIDO) distributed antennas of base transceiver stations (BTSs); using the link quality measurements to define a user cluster; measuring channel state information (CSI) between each user and each DIDO antenna within a defined user cluster; and precoding data transmissions between each DIDO antenna and each user within the user cluster based on the measured CSI.

A method for balancing load among firewall security devices in a network is disclosed. Firewall security devices are arranged in multiple clusters. A switching device is configured with the firewall security devices by communicating control messages and heartbeat signals. Information regarding the configured firewall security devices is then included in a load balancing table. A load balancing function is configured for enabling the distribution of data traffic received by the switching device. A received data packet by the switching device is forwarded to one of the firewall security devices in a cluster based on the load balancing function, the load balancing table and the address contained in the data packet.

A clustering based load adaptive sleeping protocol for ad hoc networks includes a plurality of nodes forming a cluster, where the nodes in the cluster are partitioned into n groups. This partitioning is performed based on the node ID (e.g. node_id modulo n). The cluster head transmits a beacon at fixed intervals. The beacon interval is divided into N slots, where N is a multiple of n. Node sleep/activation times are synchronized to the beacon interval slots. The node's group number is used to determine the slots within a beacon interval that a node begins it s sleep cycle. Therefore, no additional signaling is required between nodes to indicate sleep patterns. The sleeping time of each node may be increased when extended periods of inactivity are detected according to an adaptive procedure.

Approaches are used for efficiently and effectively managing the dynamic allocation of resources of multi-node database systems between services provided by the multi-node database server. A service is a category of work that is hosted on the database server. The approaches manage allocation of resources at different levels. For services that use a particular database, the performance realized by the services is monitored. Resources assigned to the database are allocated between these services to ensure performance goals for each are met. Resources assigned to a cluster of nodes are allocated between the databases to ensure that performance goals for all the services that use the databases are met. Resources assigned to a farm of clusters are assigned amongst clusters based on service level agreements and back-end policies. The approach uses a hierarchy of directors to manage resources at the different levels.

A system forms search results clustered by address or telephone number. When clustering by address, the system may receive a search query and identify a geographical area of interest based, at least in part, on the search query. The system may identify documents that are associated with addresses located within the geographical area of interest, group the identified documents into clusters based, at least in part, on the addresses located within the geographical area of interest, and present the clusters as the search results. When clustering by telephone number, the system may receive a search query that includes at least one portion of a telephone number and identify documents that are associated with telephone numbers that match the at least one portion of the telephone number. The system may group the identified documents into clusters based on the telephone numbers included in the identified documents and present the clusters as the search results.

According to a disclosed embodiment of the invention, an improved cluster-based collection of computers (nodes) is realized using conventional computer hardware. Software is provided that enables at least one virtual machine to be presented to guest operating systems, wherein each node participating with the virtual machine has its own emulator or virtual machine monitor. VM memory coherency and I/O coherency are provided by hooks, which result in the manipulation of internal processor structures. A private network provides communication among the nodes.

A scalable, cluster-based VoD system implemented with a multi-server, multi-storage architecture to serve large scale real-time ingest and streaming requests for content assets is provided. The scalable, cluster-based VoD system implements sophisticated load balancing algorithms for distributing the load among the servers in the cluster to achieve a cost-effective and high streaming and storage capacity solution capable of serving multiple usage patterns and large scale real-time service demands. The VoD system is designed with a highly-scalable and failure-resistant architecture for streaming content assets in real-time in various network configurations.

The present invention relates to a disk drive including a cache memory having a plurality of sequentially-ordered memory clusters for caching disk data stored in sectors (not shown) on disks of a disk assembly. The disk sectors are identified by logical block addresses (LBAs). A cache control system of the disk drive comprises a cluster control block memory, having a plurality of cluster control blocks (CCB), and a tag memory 22, having a plurality of tag records, that are embedded within the cache control system. Each CCB includes a cluster segment record with an entry for associating the CCB with a particular memory cluster and for forming variable length segments of the memory clusters without regard to the sequential order of the memory clusters. Each tag record assigns a segment to a continuous range of LBAs and defines the CCBs forming the segment. Each segment of the memory clusters is for caching data from a contiguous range of the logical block addresses. The cache control system efficiently exploits available memory clusters for responding to host commands.

Methods of and systems for dynamically rearranging search results into hierarchically organized concept clusters are provided. A method of searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device includes providing a set of content items and receiving incremental input to incrementally identify search terms for content items. Content items are selected and grouped into sets based on how the incremental input matches various metadata associated with the content items. The selected content items are grouped into explicit conceptual clusters and user-implied conceptual clusters based on metadata in common to the selected content items. The clustered content items are presented according to the conceptual clusters into which they are grouped.

The invention discloses a high-availability database cluster system based on message-oriented middleware, comprising a database service layer composed of a plurality of database servers and a middle layer arranged between an application layer and the database service layer; wherein, the middle layer comprises a plurality of application proxies, a plurality of database middleware and a message bus; the application proxy is used for connection redirection when fault occurs on service nodes so as to keep service uninterrupted and improve reliability; the database middleware is used for interception, analysis, processing and retransmission of the database request message; and the message bus runs through the database middleware and the database server, which is responsible for global sorting of reading and writing operation sent by the data middleware so as to ensure data consistency and sending of the sorting result to the database server. A feasible approach is provided for the invention in order to obtain a high-performance database with high availability. The invention has the advantages of high availability, good scalability and easy construction and management.

The method and apparatus of the present invention provide for automatic recognition of fingerprint images. In an acquisition mode, subsets of the feature points for a given fingerprint image are generated in a deterministic fashion. One or more of the subsets of feature points for the given fingerprint image is selected. For each selected subset, a key is generated that characterizes the fingerprint in the vicinity of the selected subset. A multi-map entry corresponding to the selected subset of feature points is stored and labeled with the corresponding key. In the recognition mode, a query fingerprint image is supplied to the system. The processing of the acquisition mode is repeated in order to generate a plurality of keys associated with a plurality of subsets of feature points of the query fingerprint image. For each key generated in the recognition mode, all entries in the multi-map that are associated with this key are retrieved. For each item retrieved, a hypothesized match between the query fingerprint image and the reference fingerprint image is constructed. Hypothesized matches are accumulated in a vote table. This list of hypotheses and scores stored in the vote table are preferably used to determine whether a match to the query fingerprint image is stored by the system.

Systems and methods are disclosed for news events detection and visualization. In accordance with one implementation, a method is provided for news events detection and visualization. The method includes, for example, obtaining a document, obtaining from the document a plurality of tokens, obtaining a document vector based on a plurality of frequencies associated with the plurality of tokens, obtaining one or more clusters of documents, each cluster associated with a plurality of documents and a cluster vector, determining a matching cluster from the one or more clusters based at least on the similarity between the document vector and the cluster vector of the matching cluster, and updating a database to associate the document with the matching cluster.

Web page clustering techniques described herein are URL Clustering and Page Clustering, whereby clustering algorithms cluster together pages that are structurally similar. Regarding URL clustering, because similarly structured pages have similar patterns in their URLs, grouping similar URL patterns will group structurally similar pages. Embodiments of URL clustering may involve: (a) URL normalization and (b) URL variation computation. Regarding page clustering, page feature-based techniques further cluster any given set of homogenous clusters, reducing the number of clusters based on the underlying page code. Embodiments of page clustering may reduce the number of clusters based on the tag probabilities and the tag sequence, utilizing an Approximate Nearest Neighborhood (ANN) graph along with evaluation of intra-cluster and inter-cluster compactness.

A method and system for searching a document source. The method includes analyzing a query and then creating a query pattern. A document is search in a document source which match the query pattern. The retrieved documents are divided into subsets of similar documents, where each subset of the subsets of similar documents is described in terms of a subset pattern. An ordered list of clusters based on the subset pattern of each subset of similar documents is then retrieved. The ordered list of clusters includes separate clusters which contain similar documents retrieved in response to the query. A machine readable medium containing code for searching a document source is also provided.

Systems and methods of organizing a collection of objects are described. In one aspect, a sequence of objects is segmented into object clusters based on: comparisons of successive object intervals to weighted measures of cluster extent; and comparisons of successive object intervals to weighted measures of cluster object density. In another aspect, objects from the collection are segmented into clusters. Context-related meta data associated with the objects and parsable into multiple levels of a name hierarchy is extracted. Names are assigned to clusters based on the extracted context-related meta data corresponding to a level of the name hierarchy selected to distinguish segmented clusters from one another. In another aspect, a sequence of objects that are segmented into clusters is accessed. Each cluster includes multiple objects arranged in a respective sequence in accordance with context-related meta data associated with the objects. At least two constituent objects representative of beginning and ending instances in the corresponding object sequence are selected for each object cluster. The selected representative objects of each cluster are graphically presented on a screen.

Computer-implemented processes are disclosed for clustering items and improving the utility of item recommendations. One process involves applying a clustering algorithm to a user's collection of items. Information about the resulting clusters is then used to select items to use as recommendation sources. Another process involves displaying the clusters of items to the user via a collection management interface that enables the user to attach cluster-level metadata, such as by rating or tagging entire clusters of items. The resulting metadata may be used to improve the recommendations generated by a recommendation engine. Another process involves forming clusters of items in which a user has indicated a lack of interest, and using these clusters to filter the output of a recommendation engine. Yet another process involves applying a clustering algorithm to the output of a recommendation engine to arrange the recommended items into cluster-based categories for presentation to the user.

Object clustering techniques are disclosed. A nonnegative sparse similarity matrix is constructed for a set of objects. Nonnegative factorization of the nonnegative sparse similarity matrix is performed. Objects of the set of objects are allocated to clusters based on factor matrices generated by the nonnegative factorization of the nonnegative sparse similarity matrix.

A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint, One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.

A database has chronologically ordered images classified into event groups based upon a time difference threshold, and into subgroups based upon a similarity measure. In a method and system for combining new images into such a database, new image are ordered into clusters based upon assessed image features. A representative image is selected in each cluster. A database segment chronologically overlapping the new images is designated and a set of database images similar to each representative image are identified in the segment. Different subgroups including one or more retrieved images are associated with each of cluster to provide matched subgroups. The new images are assigned to matched subgroups associated with respective clusters.

The invention discloses a geographic and geomorphic characteristic construction method based on laser radar and image data fusion and belongs to the automatic control field. The method specifically comprises 1) obtaining 3D laser point clouds and panoramic pictures of the surrounding environment of a ground unmanned mobile platform at present; 2) matching the 3D laser point clouds and the panoramic pictures and obtaining matched images; 3) dividing the 3D laser point clouds based on different distribution characteristics corresponding to each laser point and carrying out clustering based on a dynamic clustering algorithm of each distribution characteristic to obtain a plurality of region classes; 4) finding passable region classes in the plurality of region classes based on travel ability of the ground unmanned mobile platform; 5)obtaining landform identification vectors of the passable region classes by utilizing a denseness SIFT algorithm; and 6) carrying out landform classification on the passable region classes based on the landform identification vectors and by utilizing a classifier. The method is suitable for passable geographic and geomorphic characteristic construction of the ground unmanned mobile platform.

In the area of network provisioning, there is a problem of selecting a suitable traffic-provisioning model for large networks due to the high management complexity of the resource-efficient trunk model and the poor bandwidth efficiency of the easy-to-configure hose model. The invention is based on the idea of partitioning at least part of the network into multi-node clusters, and defining traffic limitations on at least two levels, including the intra-cluster level and the inter-cluster level, where the traffic limitations include one or more node-to-cluster traffic limitations for inter-cluster traffic. Subsequently, cluster-based provisioning of the network is performed based on the traffic limitations. The novel node-to-cluster limitations proposed by the invention are preferably applied in a cluster-based trunk or hose model on the inter-cluster level. In other words, for the description of the inter-cluster traffic (traffic between the clusters) cluster-based trunk or hose models can be used, preferably depending on the available information about the traffic. The cluster-based provisioning makes it possible to find a trade-off between management complexity and overprovisioning.

A secure cluster-based server system includes a plurality of firewalls, a plurality of back-end servers, a logically external firewall dispatcher, a logically internal firewall dispatcher, and a plurality of second stage dispatchers. The external firewall dispatcher is configured for routing packets received from the external network through one or more of the firewalls to the internal firewall dispatcher, the internal firewall dispatcher is configured for dispatching packets received from the one or more firewalls to one or more of the second stage dispatchers, and the second stage dispatchers are configured for dispatching packets received from the internal firewall dispatcher to one or more of the back-end servers for processing. A computerized method of interfacing an external network to a cluster-based server includes receiving packets from a plurality of firewalls with a first stage dispatcher, dispatching each received packet from the first stage dispatcher to one of a plurality of second stage dispatchers, and dispatching each packet received by one of the second stage dispatchers to one of a plurality of servers for processing.

Embodiments are directed a method of rendering object-based audio comprising determining an initial spatial position of objects having object audio data and associated metadata, determining a perceptual importance of the objects, and grouping the audio objects into a number of clusters based on the determined perceptual importance of the objects, such that a spatial error caused by moving an object from an initial spatial position to a second spatial position in a cluster is minimized for objects with a relatively high perceptual importance. The perceptual importance is based at least in part by a partial loudness of an object and content semantics of the object.

A machine learning algorithm is trained to learn to cluster a plurality of original-destination routes in a network for transporting cargo into a plurality of clusters based on similarities of the original-destination routes, and to learn to cluster the plurality of clusters into a plurality of subgroups based on customer behavior. Influencing criteria associated with each of the subgroups may be determined and based on the influencing criteria, a price elasticity curve for each of the subgroups may be generated. Based on the price elasticity curve and current network traffic, cargo transportation price associated with each of the subgroups may be determined.

The invention discloses a clustering-based blind source separation method for synchronous orthogonal frequency hopping signals. The method comprises the following steps of: acquiring M sampled paths of discrete time-domain mixed signals; obtaining M time-frequency domain matrixes of the mixed signals; preprocessing the time-frequency domain matrixes of the frequency hopping mixed signals; estimating frequency hopping moments, normalized mixed matrix column vectors and frequency hopping frequency; estimating time-frequency domain frequency hopping source signals by utilizing the estimated normalized mixed matrix column vectors; splicing the time-frequency domain frequency hopping source signals between different frequency hopping points; and recovering time-domain source signals according to time-frequency domain estimate values of the source signals. According to the method, the frequency hopping source signals are estimated only according to the received mixed signals of a plurality of frequency hopping signals under the condition of unknown channel information, and the frequency hopping signals can be subjected to blind estimation under the condition that the number of receiving antennae is smaller than that of the source signals; short-time Fourier transform is utilized, so that the method is low in computation amount; and the frequency hopping signals are subjected to blind separation, and meanwhile, a part of parameters can also be estimated, so that the method is high in practicability.

A system, software module, and computer program product for performing clustering based data mining that improved performance in model building, good integration with the various databases throughout the enterprise, flexible specification and adjustment of the models being built, and flexible model arrangement and export capability. The software module for performing clustering based data mining in an electronic data processing system comprises: a model setup block operable to receive client input including information specifying a setup of a clustering data mining models, generate the model setup, and generate parameters for the model setup based on the received information, a modeling algorithms block operable to select and initialize a clustering modeling algorithm based on the generated model setup, a model building block operable to receive training data and build a clustering model using the training data and the selected clustering modeling algorithm and a model scoring block operable to receive scoring data and generate predictions and/or recommendations using the scoring data and the clustering model.

Systems and methods for automatically generating a playlist of series assets and systems and methods for grouping assets of a playlist in clusters are provided. In one embodiment, series assets may automatically be included into a playlist for that series. In another embodiment, an interactive media guidance application may group assets in clusters based on one or more user selected parameters or may group assets in cluster based on automatically determined parameters. In yet another embodiment, the interactive media guidance application may group assets in clusters and display at least one identifier in connection with each cluster to indicate a basis for forming the cluster. The identifier may be a key word or catch phrase that succinctly identifies a trait or characteristic of assets in a particular cluster associated with the identifier.

This invention relates to a distributed border gateway protocol system based on a cluster router structure characterizing in selecting a node as the master control one, an other one as the back up node of the master one, a connection node and a slave node, in which, the reliability of the system is increased since the system has no single failure point by the backing up to the master control node, the load of the slave nodes is balanced by the reasonable distribution of partition algorithm to increase the performance of the entire BGP system so as to realize quick process of BGP information and reliable service of BGP.