621 results about "Order set" patented technology

A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.

A method of determining a path having an ordered set of waypoints to be visited by a mobile agent to accomplish a mission includes: producing candidate paths using a multi-objective optimization algorithm, subject to a path production heuristic; selecting a path from the candidate paths, subject to a path selection heuristic; instructing the mobile agent to move according to the selected path; modifying a maintained subset of the candidate paths to produce a new candidate path using the algorithm and subject to the path production heuristic; designating either the currently-selected path or the new candidate path as the newly-selected path, subject to the path selection heuristic; and instructing the mobile agent to move according to the newly-selected path. The method may further include iterating production of new candidate paths, either randomly or based on modifications of previous candidate paths, to continually update an operation plan for the mobile agent.

A method for assigning of geocodes to addresses identifying entities on a street includes ordering a set of entity geocodes associated with a street segment based on ordering criteria such as the linear distance of the geocodes along the length of the street segment. Assignable addresses are matched with the ordered geocodes creating a correspondence between a numerical order of the assignable addresses and a linear order of the ordered set of geocodes, consistent with address range direction data and street segment side data. The geocodes may be implicit or explicit, locally unique or globally unique. The set of entity geocodes may be obtained by identifying image features in aerial imagery corresponding to streets and buildings and correlating this information with data from a street map database.

A method and apparatus are described for providing a user with contextually relevant content from a library of information. According to one embodiment of the present invention, metadata tagged information about a user's work profile and working context, and content within a library of information are read. The metadata tagged information about content within the library of information to metadata tagged information about one or more of the user's work profile, the user's working context, or other content within the library of information is matched using one or more programmable rules. A rank ordered set of the most contextually relevant content from the library of information is then delivered to the user based on the matching of the metadata tagged information.

A workflow application allows users to store, manage, and perform tasks related to workflows comprised of ordered sets of documents. The application provides an interface for creating and managing a workflow. Each document added to the workflow is assigned to a particular position in the workflow. Via the interface, the user saves data defining the workflow. In this manner, the workflow may be shared or preserved for subsequent re-use. The application allows a user to perform various tasks with respect to the workflow. Via an interface control presented by the application, the user instigates such tasks. In response, the application causes the task to be performed for each document in the workflow in an order corresponding to the arrangement of the documents within the workflow. For example, the application may render and print each document in the workflow. Or, the application may generate a combined workflow report.

Duplicate hands are dealt in a remote game of poker or other card game of chance. Simulated cards or game pieces are dealt to players with the order of suits changed for each player. A map is maintained in a computer memory between a reference set of indices corresponding to card suits, and differently-ordered sets of playing suits for dealing in the game. A reference game is maintained at a server computer to track game status according to the reference set of indices. Game play is translated between the reference game and individual playing suits so that players are unaware of the order of suits used for other players.

The present invention provides a method for performing transactions on data entities in a database and a transactional database. The database comprises an ordered set of data stores with at least one static data store, wherein said static data store uses an index structure based on a non-updatable representation of an ordered set of integers according to the principle of compressed inverted indices. The method allows to generate a modifiable data store when the performed transaction comprises an insert, update or delete operation, to execute operations of the transaction on the ordered set being present at the time when the transaction has been started and, if present, on the modifiable data store and to convert data stores to a new static data store, The insert, update or delete operation are executed on the modifiable data store which is the only data store modifiable for the transaction.

Graphically displaying the proportion of a total value of a time dependent variable contributed by each of a set of elements. Applicable in a graph environment comprising the steps of displaying the proportion contributed by each element as an area within an ordered set of areas under a line representative of the total value of said time dependent variable. The user is enabled to interactively select one area in the set of areas and perform one of the following operations: hiding the selected area, displaying the selected area or reordering the position of the selected area within said ordered set responsive to said user selection. This implementation is effective in the manipulation of stacked area line graphs by visualizing how the various areas representative of the contributions of the individual elements to the whole time dependent variable affect and coact with the other variables in the set.

A simple and therefore highly usable non-blocking implementations of linked-lists can be provided using read, write, and CAS operations. Several realizations of linked-list based data-structures are described, which are non-blocking, linearizable, and exhibit disjoint-access for most operations. In other words, the realizations are non-blocking and linearizable while maintaining the property that operations on disjoint parts of the list do not interact, effectively lowering contention and increasing concurrency. We implement three exemplary data structures: sets, multi-sets, and ordered-sets. The exemplary implementations support insert, remove, and find operations, with natural semantics. An ordered-set implementation supports an additional removeGE operation.

Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint.

In an approach for supporting queries for hash-based data structures, a processor creates an ordered set of seeds, wherein the ordered set of seeds are a subset of values in a key domain. A processor links each hashed key of a plurality of hashed keys to at least another hashed key of the plurality of hashed keys using the ordered set of seeds, wherein the ordered set of seeds allows retrieval access to data located in the hash-based data structure.

A virtual conferencing system is described for implementing a speaker queue. For example, one embodiment of the virtual conferencing system comprises: a plurality of clients, each of the clients comprising state management logic to maintain a current state of a virtual conference; a virtual conferencing service to establish audio and/or video connections between the plurality of clients during the virtual conference, the virtual conferencing service further including a state synchronization service communicatively coupled to the state management logic on each client to ensure that the current state of the virtual conference is consistent on each client; wherein the current state on each client includes a speaker queue comprising an ordered set of participants to be designated as current speakers during the virtual conference, wherein participants are added to the speaker queue in response to input provided by the participants indicating a desire to be a current speaker, wherein one or more participants towards the top of the speaker queue are designated to be current speakers, wherein participants are initially added to the bottom of the speaker queue and are moved towards the top of the speaker queue as other participants are removed from the top of the speaker queue; a virtual conferencing graphical user interface (GUI) to display a video stream of one or more current speakers within one or more current speaker regions, the virtual conferencing GUI further providing a visual representation of the speaker queue to each of the participants, the visual representation comprising an ordered representation of each of the participants in the speaker queue.

A method and apparatus for renewable power generation utilizes the chemical potential dissimilarity between solutions of differing ionic formulations. A train is formed by a sequentially ordered set of a plurality of cells in which each successive cell is related to the preceding cell. Each cell has pumping means and hydro-power generation turbine means to form a closed hydraulic loop configured for specified volumetric and flow capacity. Adjacent cells share semipermeable membranes. Each cell is charged with a brine of specified ionizable inorganic salt quantity and type with the brine being cycled in a controlled concentration-pressure loop, with each of the cells operating at progressively increasing concentration and osmotic pressure ratio. A continuous and constant flow rate of substantially salt-free permeate flux is maintained across each cell, the flux being osmotically induced from low salt concentration water being fed at the first cell in the train and exiting at the last cell along with the discarded high concentration water brine. The salt-free permeate flux is continuously induced, in symbiotic mode, through the shared membranes, driven by the chemical influence of concentration potential field bounded by water of low to no salt concentration on one end of the train and by brine of high salt concentration on the other end of the train with sufficient concentration difference to provide driving force for said plurality of cells, while maintaining adequate concentration difference between adjacent cells to enhance osmosis function, as well as defining a concentration ratio within each cell to ensure a net positive power generation.

A method for grouping a plurality of orders in an order queue of a warehouse management system, each order including one or more items and each item being associated with a physical location in a warehouse. The method includes determining a physical location in the warehouse of each item in the plurality of orders. For each order, the method also includes establishing at least one cluster region, each cluster region including at least one item from the respective order. The method further includes grouping the plurality of orders based on the physical locations of the cluster regions in the warehouse to form at least one order set.

An improved system and method for optimizing online advertising auctions is provided by applying linear programming using special ordered sets. A linear programming model using special ordered sets of bids may first be created offline for the web page placements of advertisements for advertising campaigns. An expected number of impressions of advertisements for alternative bid levels may be determined for web page placements for advertising campaigns for a time period. Ordered sets of bid levels may be generated for web page placements of advertising campaigns and linear programming may be applied to determine optimal bid values for web page placements of advertising campaigns. Branching and cutting techniques may also be applied to the special ordered sets of bid values to rapidly obtain an optimal bid value for each special ordered set. Advertising campaigns may be updated with the optimal bid values for bidding in an online advertising auction.

A sensor module is for use in a semiotic processing system. The sensing module receives data in a pre-specified format. It identifies sequential elemental symbols in the received data. First order sets of identified sequential element symbols are defined such that no first order set has more than a maximum number of sequential elemental symbols. Second order sets of sequential first order sets are defined such that no second order set has more than a maximum number N of sequential first order sets.