2156 results about "Cluster based" patented technology

A document categorization system, including a clusterer for generating clusters of related electronic documents based on features extracted from the documents, and a filter module for generating a filter on the basis of the clusters to categorize further documents received by the system. The system may include an editor for manually browsing and modifying the clusters. The categorization of the documents is based on n-grams, which are used to determine significant features of the documents. The system includes a trend analyzer for determining trends of changing document categories over time, and for identifying novel clusters. The system may be implemented as a plug-in module for a spreadsheet application for permitting one-off or ongoing analysis of text entries in a worksheet.

A method for real-time speaker recognition including obtaining speech data of a speaker, extracting, using a processor of a computer, a coarse feature of the speaker from the speech data, identifying the speaker as belonging to a pre-determined speaker cluster based on the coarse feature of the speaker, extracting, using the processor of the computer, a plurality of Mel-Frequency Cepstral Coefficients (MFCC) and a plurality of Gaussian Mixture Model (GMM) components from the speech data, determining a biometric signature of the speaker based on the plurality of MFCC and the plurality of GMM components, and determining in real time, using the processor of the computer, an identity of the speaker by comparing the biometric signature of the speaker to one of a plurality of biometric signature libraries associated with the pre-determined speaker cluster.

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.

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.

Provided are an apparatus and method for controlling a distributed memory cluster. A distributed computing system may include a computing node cluster, a distributed memory cluster, and a controlling node. The computing node cluster may include a plurality of computing nodes including first computing nodes that each generates associated data. The distributed memory cluster may be configured to store the associated data of the first computing nodes. The controlling node may be configured to select memory blocks of the associated data for distribution on the distributed memory cluster based on a node selection rule and memory cluster structure information, and to select second computing nodes from the computing node cluster based on a location selection rule and the memory cluster structure information.

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.

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.

Provided is a complier which optimizes parallel processing. The complier records the number of execution cores, which is the number of processor cores that execute a target program. First, the compiler detects a dominant path, which is a candidate of an execution path to be consecutively executed by a single processor core, from a target program. Subsequently, the compiler selects dominant paths with the number not larger than the number of execution cores, and generates clusters of tasks to be executed by a multi-core processor in parallel or consecutively. After that, the compiler computes an execution time for which each of the generated clusters is executed by the processor cores with the number equal to one or each of a plurality natural numbers selected from the natural numbers not larger than the number of execution cores. Then, the compiler selects the number of processor cores to be assigned for execution of each of the clusters based on the computed execution time.

In one embodiment, a method for detecting malicious software agents, such as domain-flux botnets. The method applies a co-clustering algorithm on a domain-name query failure graph, to generate a hierarchical grouping of hosts based on similarities between domain names queried by those hosts, and divides that hierarchical structure into candidate clusters based on percentages of failed queries having at least first- and second-level domain names in common, thereby identifying hosts having correlated queries as possibly being infected with malicious software agents. A linking algorithm is used to correlate the co-clustering results generated at different time periods to differentiate actual domain-flux bots from other domain-name failure anomalies by identifying candidate clusters that persist for relatively long periods of time. Persistent candidate clusters are analyzed to identify which clusters have malicious software agents, based on a freshness metric that characterizes whether the candidate clusters continually generate failed queries having new domain names.

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 method of operation of a navigation system includes: extracting navigation-related web documents having a point of interest; generating formatting sequences of the navigation-related web documents; selecting a user-defined percentile representing reciprocal fraction of an expected number of clusters; calculating a threshold value for a first cluster with the threshold value to be equal to the user-defined percentile of a first normalized distribution of sample comparison values between the first cluster and formatting sequence samples from the formatting sequences, the first cluster is from the clusters; computing an associated comparison value between a first formatting sequence from the formatting sequences and the first cluster; grouping the first formatting sequence with the first cluster when the associated comparison value exceeds the threshold value for the first cluster; and generating a travel route for the point of interest related to the first cluster for displaying on a device.

The present invention relates to a user interface, data structure and method to facilitate management and / or access to data, such as by grouping graphical representations of the data in an image space relative to cluster indicators. A given graphical representation for selected data (e.g., a graphical object) can be associated with a corresponding cluster indicator based on its proximity to the cluster indicator. Thus, cluster membership can be changed, in accordance with an aspect of the present invention, by moving graphical objects relative to the cluster indicators.

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.

A scalable packet forwarding approach to speed up unicast and multicast routing-table lookups in the Internet which we refer to as "Cluster-based Aggregation Switching Technique" or "CAST". CAST integrates the use of two mechanisms: (i) organizing table entries into clusters and (ii) using cluster-label swapping so that packets can refer to specific clusters within which the routing-table lookup should take place. The motivation for introducing CAST is the escalating rate of improvement of Internet bandwidth available at backbone routers, which continues to exceed the maximum rate of packet processing power of high-speed routers. Simulations show that the hybrid approach used in CAST to expedite routing table lookups is more attractive for unicast routing than all prior approaches in terms of its lookup power and total memory size. Furthermore, CAST applies equally well to multicast routing, while many prior schemes do not.

In a virtualized environment, provisioned virtual machines may be migrated between different servers as needed and, accordingly, may be clustered according to particular configurations and requirements. The system described herein provides techniques for controlling the provisioning of users' virtual machines among clusters based on determined requirements obtained from users' service level agreements (SLAs) and in accordance with an optimized allocation of resources to service the processes corresponding to the virtual machines. The provisioning of virtual machines according to the system described herein may be dynamically controlled and allow for over-provisioning of virtual machines to a cluster beyond that which would normally be supported at the cluster absent the provisioning control techniques provided by the system described herein. The over-provisioning may be controllable according to specific requirements identified in each user's SLA.

A static heat transfer model is derived from a system of dynamic equations by integrating the dynamic equations over different time periods. That static heat transfer model links periodic (e.g., monthly) energy usage with cooling and heating degree hours, humidifying and dehumidifying hours. Its coefficients of measuring correlations correspond to the thermal parameters of buildings. Temporal data from a building may be used to estimate the overall heat transfer parameters. A clustering scheme may be developed to decompose all the buildings into different clusters based on one or more similarity criteria. The overall heat transfer parameters are separated into values for the wall, roof and window using multiple buildings' data in the same cluster or group.

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.