88 results about "Clique" patented technology

A system for determining electrophysiological data comprising an electronic control unit configured to acquire electrophysiology signals from a plurality of electrodes (130) of one or more catheters, select at least one clique of electrodes from the plurality of electrodes (136) to determine a plurality of local E field data points, determine the location and orientation of the plurality of electrodes, process the electrophysiology signals from the at least one clique from a full set of bipole subcliques to derive the local E field data points associated with the at least one clique of electrodes, derive at least one orientation independent signal from the at least one clique of electrodes (138) from the information content corresponding to weighted parts of electrogram signals, and display or output catheter orientation independent electrophysiologic information to a user or process.

An anonymous trading system comprises an interconnected network of broking noted arranged in cliques which receive buy and sell orders from trader terminals via connected trading engines and which match persistent orders, executed deals and distribute price information to trader terminals. Where two orders are matched, a proposed deal message is sent by the matching broker. If another broker has processed an event which makes the matched quote unavailable the match fails and rematch may occur. Rematch may be attempted by an intermediate broker provided it owns one side of the match, or it received both sides of the match from brokers in different cliques. The intermediate broker attempts to match with the next available quote in the queue.

An anonymous trading system comprises an interconnected network of broking nodes arranged in cliques which receive buy and sell orders from trader terminals via connected trading engines and which match persistent orders, executed deals and distribute price information to trader terminals. The system has the ability for a trader to call out for a quote (request for a quote) anonymously. RFQs are only transmitted on to potential counterparties if they are within a predetermined price range. The RFQs include a price at which the requesting party is willing to deal, but this price is not communicated potential counterparties. Counterparty responses are matches on a time, price basis and non-matched responses may be matched with themselves. Similarly, non-matched RFQs may be matched with each other.

Systems, methods and articles solve queries or database problems through the use of graphs. An association graph may be formed based on a query graph and a database graph. The association graph may be solved for a clique, providing the results to a query or problem and / or an indication of a level of responsiveness of the results. Thus, unlimited relaxation of constraint may be achieved. Analog processors such as quantum processors may be used to solve for the clique.

The embodiment of the invention discloses a method and device for detecting network hot topics found based on a maximal clique. The method comprises the following steps of: acquiring data of a network news website, a forum, a blog and a microblog in a real time; carrying out word segmentation, word frequency statistics and other processing on the acquired data to find all hot point word pairs and construct a hot point word pair set; expressing each hot-point word by using a unique serial number; viewing the hot point word pair set as an undirected graph and excavating the undirected graph to obtain all maximal cliques; and transforming each maximal clique into a word combination for expressing one hot point topic. The invention also discloses a device for detecting the network hot topics. According to the embodiment of the invention, the hot point topics in the network can be accurately found in a real time, the detection speed and precision of the hot point topics are improved and higher practical value is obtained.

A system and method are provided for determining electrophysiological data. The system comprises an electronic control unit that is configured to receive electrical signals from a set of electrodes, receive position and orientation data for the set of electrodes from a mapping system, compensate for position and orientation artifacts of the set of electrodes, compose cliques of a subset of neighboring electrodes in the set of electrodes, determine catheter orientation independent information of a target tissue, and output the orientation independent information to a display. The method comprising receiving electrogram data for a set of electrodes (80), compensating for artifacts in sensor positions in the mapping system (81), resolving the bipolar signals into a 3D vector electrogram in the mapping system coordinates (82), manipulating observed unipolar voltage signals and the tangent component of the e-field to estimate the conduction velocity vector (83), and outputting the catheter orientation independent information (84).

A method and apparatus for organizing deep Web services are provided. In one aspect, the method and apparatus obtains a collection of sources and their associated attributes and / or input modes, for instance, using a crawling algorithm. The method and apparatus uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.

An anonymous trading system has a clique of arbitrators which match orders from trader terminals and execute deals. One or more branches is attached to each arbitrator connecting trader terminals through a city node and one or more market distributors. At any one time only one arbitrator is active with the passive arbitrators active as market distributors. The active arbitrator is switched according to the geographical location of the greatest market activity.

A soft clustering method comprises (i) grouping items into non-exclusive cliques based on features associated with the items, and (ii) clustering the non-exclusive cliques using a hard clustering algorithm to generate item groups on the basis of mutual similarity of the features of the items constituting the cliques. In some named entity recognition embodiments illustrated herein as examples, named entities together with contexts are grouped into cliques based on mutual context similarity. Each clique includes a plurality of different named entities having mutual context similarity. The cliques are clustered to generate named entity groups on the basis of mutual similarity of the contexts of the named entities constituting the cliques.

The invention relates to a method for locating a first mobile terminal within a radio network. Said method comprises the following steps: a first locating process is carried out to determine an initial position of the first terminal; the first locating process is deactivated; a second locating process is carried out to at least approximately determine the current position of the first terminal relative to the initial position; and the first locating process is activated and carried out again to determine a new initial position of the first terminal when the current position reaches a minimum distance from the initial position. The invention also relates to a method for determining cliques of mobile terminals in a radio network encompassing a plurality of mobile terminals. Said method comprises the following steps: one or more independent numbers of terminals is determined, each couple of terminals of each of the independent numbers being located at a distance from each other that is greater than a predetermined threshold value; and at least one clique of terminals is determined, the couples of which are located at a shorter distance from each other than a predetermined threshold value, each independent number containing a maximum of one terminal of the clique.

Techniques for enumerating at least one maximal clique are provided. The techniques include obtaining data, wherein the data comprises a graph, obtaining a user-specified minimum size restriction on at least one maximal clique of interest, filtering the data using the user-specified minimum size restriction to reduce graph size, and enumerating at least one maximal clique from the graph provided that at least one maximal clique exists above the user-specified minimum size restriction.

An automated method optimally designs plates to satisfy an order book at a steel plant so as to maximize the yield of the plates designed while using capacity fully to reduce the production of surplus slabs or plates, and satisfy order deadlines. Our method consists of four main components: (1) mother plate design, (2) slab design, (3) cast design, and (4) material allocation. A column generation framework for mother plate design is used where the problem is decomposed into a master problem and a subproblem. The master problem is used to evaluate packing patterns that should be used to fulfill the order book and the subproblem generates potential one-dimensional and two-dimensional feasible packing patterns as candidates to be evaluated by the master problem. The solution to the master problem produces a list of mother plates that need to be produced. These mother plates are transformed into candidate slabs, which are represented via an interval graph. The maximal cliques in the interval graph—maximal subsets of slabs which can be grouped together to form casts—are enumerated to generate candidate casts, from which redesign information is sent to the plate / slab design processes. The cast design process is integrated with the plate design / slab design processes in the sense that information is passed from the plate / slab design processes to the cast design process and vice versa. Finally, our method has a material allocation component to assign order plates to inventory mother-plates and slabs.

The invention discloses a method for the rough draft shape matching based on the Modular product graph and the maximum clique. The method comprises the following specific steps that shape analysis and feature extraction are conducted on graphic data, so that essential data expressing images are obtained; based on shape feature expressions of the labeled graph and the weight graph, the extracted data are labeled or coded, so that topological graphs are obtained; the topological graphs are compared through a similarity calculation model, the labeled or coded data are completely matched or part of the data are matched, similarity data are obtained through calculation, and whether the graphs are similar to one another is judged. According to the method, matching of graph models with different numbers of nodes can be processed and partial matching can be conducted as well. Compared with the matching method based on vectors, the method for the rough draft shape matching based on the Modular product graph and the maximum clique is higher in accuracy, higher in adaptability and higher in matching capacity.

A method for diagnosing software crashes includes retrieving a stack-trace from at least one of a new problem report, updated problem report, and authorized analysis report from a repository. A vector is automatically created from the retrieved stack-trace using the function name and associating the resultant vector with the problem report and authorized analysis reports. Vector space modeling is used to calculate the angles between the resultant vectors to determine similarities. Similar problem reports and authorized analysis reports are grouped into similar sets using a maximal cliques process. New software crashes are automatically diagnosed by extracting the stack-trace from a new problem report of the new software crash, and selecting a potential solution by searching the grouped problem reports and authorized analysis reports for a stack-trace similar to the new stack-trace.

This method includes: During installation, the system auto sets the calling thresholds of the large group and the traditional group in the database of the dispatch residing register (DRR) and presets the group types as the system default group, the compel-boosting group and the compel-tradition group. The configuration console, the acceptance console and the management console complete operations of releasing the group numbers / the clique numbers / the user numbers, building groups, setting group type and adding users into a group. When a terminal or a dispatcher starts a group calling (GC), DRR judges which group type this group belonging to and sets the calling mode as the traditional type GC or the boosting type GC depending on the comparison conditions. The system dispatch server builds the calling according to the set GC mode and regulates in time the system configuration parameters. This invention solves the problem that the system GC mode cannot be automatically optimal.

The invention provides an urban public transport network optimization method capable of improving overall transfer performance. In the method, a public transport network is expressed as relation between stations and lines (cliques, the largest complete subgraph in the network). The method comprises the following steps: setting network diameter to be N; simulating the growth process of the actual public transport network to be optimized; starting from an original network with only one clique, adding one clique to the original network at each time step, and forming the network which is composedof overlapped cliques and is logically shown as a structure with (N+1) layers, wherein, the clique at a (m-1) layer is mapped into a point at a m layer, and m is not less than 1 and not more than N+1; and regulating the network after one clique is added at each time step so as to ensure that the network at each layer is composed of the cliques so that the optimized public transport network becomes an ideal clique network with the depth N. By utilizing the method, average transfer time and average shortest path time coefficient of the public transport network can be effectively reduced, and concentration degree of the bus lines is improved, thus realizing higher transfer efficiency of a public transport system.

A soft clustering method comprises (i) grouping items into non-exclusive cliques based on features associated with the items, and (ii) clustering the non-exclusive cliques using a hard clustering algorithm to generate item groups on the basis of mutual similarity of the features of the items constituting the cliques. In some named entity recognition embodiments illustrated herein as examples, named entities together with contexts are grouped into cliques based on mutual context similarity. Each clique includes a plurality of different named entities having mutual context similarity. The cliques are clustered to generate named entity groups on the basis of mutual similarity of the contexts of the named entities constituting the cliques.

The invention discloses a microblog interestingness circle mining method based on intimacy degree and influence power and a microblog interestingness circle mining device based on the intimacy degree and the influence power. The mining method comprises the following steps of discovering a social intercourse interestingness circle seed on a center user first-stage interaction diagram on the basis of a KCC (K-Clique-Community) algorithm; expanding the social intercourse interestingness circle seed according to the intimacy degree among nodes; expanding a PageRank algorithm through the user microblog interesting similarity degree, and calculating the user influence power; expanding the expanded social intercourse interestingness circle seed again through the user influence power; and automatically marking the discovered social intercourse interestingness circle through the re-expanded social intercourse interestingness circle. The mining device comprises a discovering module, a first expansion module, a calculation module, a second expansion module and a marking module. The social intercourse interestingness circle obtained through mining by the method and the device can be applied to various fields such as interestingness modeling, cooperated recommendation, personalized searching and ranking, precise advertisement putting and knowledge mapping; and wide application prospects and values are realized.

The invention discloses a method for constructing and analyzing a tissue-specific interaction topology network. The method comprises the following steps of: measuring similarity of integrated interaction network nodes; constructing a tissue-specific gene interaction network, a tissue-specific transcription factor interaction network and a tissue-specific encoded protein interaction network by a construction module of the tissue-specific interaction network; counting connection degree of each node in the network, counting betweenness of each node in the network, calculating closeness of each node in the network, calculating max clique in the interaction network and counting a Hub node in the interaction network by a topology analysis module of the interaction network; and acquiring related tissue-specific knowledge from a gene ontology database and a KEGG (Kyoto Encyclopedia of Genes and Genomes) biological field knowledge base by an identification module of the tissue-specific functional module. The invention provides an ideal method for constructing the interaction network from genetic information; and the method is a more ideal analysis tool for researching a tissue-specific intrinsic mechanism.

Each embodiment of this invention relates to a method and an apparatus for grouping users' friends. In one embodiment, provided is the method for grouping users' friends, comprising generating at least one complete subgraph based on the relationship of a plurality of friends in a friend list of the user; expanding the at least one complete subgraph to form at least one clique; and dividing the friends in one of the at least one clique into one group; wherein the connectivity rate of the clique is not less than a first threshold, the first threshold associating with the friend quantity in the friend list of the user. In another embodiment, provided is the apparatus for grouping users' friends.

By applying a set of simple geometric rules to the connections within a connected graph of ‘topics’ it is possible to uncover hidden relationships that are otherwise inaccessible to the lay person. Interesting, potentially non-obvious threads of content, termed indirect connection clusters (ICCs), can be found from an online encyclopedia or other graph of articles that are not directly connected to a starting topic, but instead are connected via an intermediate clique of articles. A system performing a search of an information graph can receive a request for identifying relevant content, identify (in a traversal of the information graph) one or more ICCs using a starting topic associated with the request, refine the one or more ICCs (eliminating certain ICCs) and generate a refined set of ICCs, and rank ICCs within the refined set. The ranked ICCs can be provided in response to the request for identifying relevant content.

A method for organizing deep Web services is provided. In one aspect, the method obtains a collection of sources and their associated attributes and / or input modes, for instance, using a crawling algorithm. The method uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.

A method of modeling includes quantifying a co-operative strength value for a plurality of pairs of variables, and identifying a clique of at least three variables based on a graph of the co-operative strength values of a plurality of pairs of variables. The method also includes selecting a first pair of variables of the plurality of pairs of variables having a high co-operative strength value. A second clique may also be identified. A model of the first clique and a model of the second clique are made. The outputs of these models are combined to form a combined model which is used to make various decisions with respect to real time data.

The invention provides an organizational overlapping core drug group discovery method based on complex network community discovery, which comprises the following steps: 1) the construction of a traditional Chinese medical formula (TCMF) network: a) the appear contribution (AC) of each drug in a given amount of formula is calculated, and the drugs of which the AC is smaller than a certain threshold value are deleted; b) AC values of two-tuple components are calculated to be cut, and then AC values of triple drugs are calculated to be cut; c) the TCMF network is constructed by using the rest triple drugs; d) the step 1) is completed; and 2) organizational overlapping core drug group discovery of the TCMF network: a) the TCMF network obtained in the step 1) is pre-processed; b) a max clique growing algorithm (MAIGA) is executed on the pre-processed TCMF network, so as to discover drug groups; c) a drug group division result is returned; and d) the step 2) is completed. The organizational overlapping core drug group discovery method explores the compatibility law of the TCMF a viewpoint of complex network, provides a new model for the research of TCMF mining, and solves the problem of traditional single distribution of a cluster.

The invention discloses a distributed multi-hop wireless network clock synchronization method based on a mean field, and aims to solve the technical problem that a clock reference is difficult to determine in an existing distributed clock synchronization method. According to the technical scheme, the method comprises the following steps: realizing bidirectional time stamp exchange in a broadcast way firstly; making a clock difference overall effect between nodes be equivalent to a mean field; establishing a clock synchronization model of a network based on a spatial Markov random field; introducing a neighbor system and a clique potential according to the equivalence between the Markov random field and a Gibbs random field to obtain a clock synchronization energy function based on a mean field Ising model; and giving a clock synchronization algorithm adopting energy minimization optimization, namely, a whole-network clock distributed synchronization algorithm based on a mean field model. Through adoption of a whole-network clock synchronization method based on the mean field model, a whole-network virtual clock reference is determined through a mean action between the nodes, so that the technical problem that the clock reference is difficult to determine in the distributed clock synchronization method in the prior art is solved.