190results about How to "Efficiently find" patented technology

Entity disambiguation resolves which names, words, or phrases in text correspond to distinct persons, organizations, locations, or other entities in the context of an entire corpus. The invention is based largely on language-independent algorithms. Thus, it is applicable not only to unstructured text from arbitrary human languages, but also to semi-structured data, such as citation databases and the disambiguation of named entities mentioned in wire transfer transaction records for the purpose of detecting money-laundering activity. The system uses multiple types of context as evidence for determining whether two mentions correspond to the same entity and it automatically learns the weight of evidence of each context item via corpus statistics. The invention uses multiple search keys to efficiently find pairs of mentions that correspond to the same entity, while skipping billions of unnecessary comparisons, yielding a system with very high throughput that can be applied to truly massive data.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories and compression history indexes across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

A method for performing a handover in a mesh network for a plurality of nodes (A, A′, B) of said mesh network from a first access point (AP1) to a second access point (AP2), whereas said plurality of nodes (A, A′, B) forms a tree of nodes, said tree comprising a root node (B) and one or more further nodes (A,A′) connected to said root node either directly or via intermediate nodes, and said handover being performed for said tree of nodes in a coordinated fashion, said method comprising: forwarding to said members of said tree (A, A′, B) information about said second access point (AP2) and timing information to enable a coordinated handover of said nodes of said tree; switching said root node (B) and said further (A,A′) nodes from said first access point to said second access point according to said timing information.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

A method of allocating a radio resource for a relay station in a wireless communication system is disclosed. The method comprise allocating a relay zone to the relay station in a subframe and transmitting a relay control channel to the relay station by using the relay zone, wherein the subframe comprises a plurality of orthogonal frequency division multiplexing (OFDM) symbols in a time domain and a plurality of subcarriers in a frequency domain, wherein the subframe is divided into a user zone used by a user equipment in a cell and the relay zone used by the relay station, and wherein the relay zone comprises some of the plurality of subcarriers. According to the present invention, a subframe structure provides backward compatibility with a legacy wireless communication system. A relay station can effectively find a radio resource allocated to the relay station, thereby decreasing a decoding time.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Provided are methods and systems that extract facts of unstructured documents and build an oracle for various domains. The present invention addresses the problem of efficient finding and extraction of facts about a particular subject domain from semi-structured and unstructured documents, makes inferences of new facts from the extracted facts and the ways of verification of the facts, thus becoming a source of knowledge about the domain to be effectively queried. The methods and systems can also extract temporal information from unstructured and semi-structured documents, and can find and extract dynamically generated documents from Deep or Dynamic Web.

Adenovirus serotypes differ in their natural tropism. The adenovirus serotypes 2, 4, 5, and 7 all have a natural affiliation towards lung epithelia and other respiratory tissues. In contrast, serotypes 40 and 41 have a natural affiliation towards the gastrointestinal tract. The serotypes described, differ in at least capsid proteins (penton-base, hexon), proteins responsible for cell binding (fiber protein), and proteins involved in adenovirus replication. This difference in tropism and capsid protein among serotypes has led to the many research efforts aimed at redirecting the adenovirus tropism by modification of the capsid proteins.

Dynamical methods for obtaining the global optimal solution of general optimization problems having closed form or black box objective functions, including the steps of first finding, in a deterministic manner, one local optimal solution starting from an initial point, and then finding another local optimal solution starting from the previously found one until all the local optimal solutions starting from any initial point are found, and then finding from said points the global optimal solution.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories and compression history indexes across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Approximate substring indexing is accomplished by decomposing each string in a database into overlapping “positional q-grams”, sequences of a predetermined length q, and containing information regarding the “position” of each q-gram within the string (i.e., 1st q-gram, 4th q-gram, etc.). An index is then formed of the tuples of the positional q-gram data (such as, for example, a B-tree index or a hash index). Each query applied to the database is similarly parsed into a plurality of positional q-grams (of the same length), and a candidate set of matches is found. Position-directed filtering is used to remove the candidates which have the q-grams in the wrong order and / or too far apart to form a “verified” output of matching candidates. If errors are permitted (defined in terms of an edit distance between each candidate and the query), an edit distance calculation can then be performed to produce the final set of matching strings.

An improved system and method for previewing search results from a search query is provided. A search results page may provide a preview link selectable by a user to preview text on pages of a website that include terms in the search query. A user may select a preview link for one of the search results, and a request may be sent to the server to preview content of a URL in the search results. In response, the server may return content of web pages of the website that include search terms in the search query. The content may be displayed in a preview window for a user to browse. Furthermore, advertisements may also be served and displayed in the preview window. A user may then browse through the specific context in which the search terms of the query appear and may more effectively find the content desired.

A method of selecting an optimal relay node in a multi-hop radio communications network has the steps of receiving, at a particular node, detection response signals which are transmitted from a plurality of other nodes, each of which has received a detection signal, and are not addressed to the particular node, and selecting a relay node based on the received detection response signals. The detection response signal includes, for example, an actual parameter in a node which transmits the detection response signal, and an optimum parameter for use as a criterion for establishing a path. The particular node selects the relay node from among those nodes which have transmitted the detection response signals each having the actual parameter equal to or larger than the optimum parameter.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Embodiments of the invention relate to methods and systems for evaluating entities for a target user, the method comprising obtaining, at a server computer, entity data from a plurality of data sources. The entity data is then stored in an entity database. The method further comprises merging the entity data from the plurality of data sources, mapping the entity data to a corresponding entity, and differentiating the entity. Then a relevance is determined associated with the entity data and data source. The method further comprises generating a set of entity evaluations to the target user using the relevance, determining a set of one or more entities relevant to the primary user based on the entity data, user data, and the relevance, with an initial order of relevance, and displaying, on a user device, the set of relevant entities to the target user in the order of relevance.

An acoustic modeling system and an acoustic modeling method use beam tracing techniques that accelerate computation of significant acoustic reverberation paths in a distributed virtual environment. The acoustic modeling system and method perform a priority-driven beam tracing to construct a beam tree data structure representing “early” reverberation paths between avatar locations by performing a best-first traversal of a cell adjacency graph that represents the virtual environment. To further accelerate reverberation path computations, the acoustic modeling system and method according to one embodiment perform a bi-directional beam tracing algorithm that combines sets of beams traced from pairs of avatar locations to efficiently find viable acoustic reverberation paths.

The invention relates to the technical field of database keyword search, in particular to a graph-index-based graph database keyword vicinity searching method. The method comprises an off-line index constructing step and an on-line searching step, wherein the off-line index constructing step comprises the following steps of: defining a d-distance sub-graph for a weighted graph G=(V, E, w), generating d-distance sub-graphs which take certain nodes in the graphs as centers by an incomplete Dijkstra algorithm, storing the acquired largest d-distance sub-graph in a sub-graph base, constructing indexes from the nodes to the sub-graphs, designing a d-distance graph index structure, and storing the d-distance graph indexes in an interpreted mode; and the on-line searching step comprises the following steps of: searching in a combined sub-graph by a searching algorithm, and outputting a top-k answer. By zooming out a search target from an integral graph to a group of sub-graphs of limited sizes, the searching efficiency can be greatly improved.

Real-time parking availability system. The system includes a database including an inventory of parking spaces in a city including their location, size, and level of demand. A mobile phone is programmed for access to the database to locate a vacant space, to pay for a requested time duration in the space, and to update the database to remove the space from the database of available parking spots for the requested time duration. The parking spaces may accommodate an automobile or a plurality of bicycles.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Apparatuses, computer program product, and method for digital image processing. A digital image processing apparatus includes an input interface to obtain a first digital image and a second digital image, and a processing unit coupled with the input interface. The processing unit defines at least one block in the first digital image, defines for each block a search area in the second digital image, the search area being larger than the block, maps the block and its search area to an equal size, calculates pixelwise errors between each block and its search area that are mapped to an equal size, collects the errors into a motion register, and defines a motion between the first digital image and the second digital image by utilizing the motion register.

The invention is a database adapter providing improved methods for storing and retrieving relational data. Suitable source data is structured as a table with a fixed number of columns of predetermined types and a variable number of rows. The invention reduces the space and time used to store data and the time taken to retrieve stored data. The invention is best implemented inside Object Relational Database Systems, but can also be implemented in any database that can execute routines written in programming languages such as C#, C or Java. Functionally, the invention combines the concept of nested tables with fast compression techniques so that nested tables are practical for solving a wide class of problems.

A computer implemented method and system for training a machine to identify a target within video data, the method comprising the steps of providing a training data set including identified labelled targets within video data having the same target within different video views. Generating, using a learning model, a bounding box action policy for determining required adjustments to a bounding box around a target in the video data by: generating a bounding box around a labelled target within a first view of the video data. Converting the target bounded by the bounding box to a quantitative representation. Determining a matching level between the quantitative representation and a quantitative representation of a further labelled target within the video data from a second view different to the first view. Looping the following steps one or more times, the looped steps comprising: using the bounding box action policy to determine an action to change the bounding box. Applying the determined action to change the bounding box to a new bounding box. Converting the target bounded by the new bounding box to a new quantitative representation. Determining a further matching level between the new quantitative representation and the quantitative representation of the labelled target within the video data from the second view. Applying a reward to the learning model to adjust the bounding box action policy based on an improvement in the matching level.