173 results about "Location-allocation" patented technology

A method for developing traffic messages is disclosed. Data indicating traffic speed at a plurality of locations on a road network are obtained. Each of the locations is assigned a unique location reference code. The data indicating traffic speed for the location reference codes assigned to locations along a road of the road network are evaluated. Locations reference codes along the road having related traffic speeds are grouped into at least one congestion event along the road. The congestion events are transmitted as traffic messages.

Methods, apparatus, systems and articles of manufacture are disclosed to facilitate proximity detection and location tracking. An example method includes receiving messages collected by a badge in an environment, the messages including signal strength and a timestamp. The example method also includes assigning a location in the environment to the badge based on a first subset of the messages. The example method also includes identifying an asset in a second subset of the messages. The example method also includes updating a current location associated with the asset based on a relative proximity of the asset to the badge, wherein the current location corresponds to a first time and the updated location corresponds to a second time, and wherein a change in location between the current location and the updated location indicates movement of the asset in the environment.

One embodiment of the present invention provides a system that facilitates concurrent non-transactional operations in a transactional memory system. During operation, the system receives a load instruction related to a local transaction. Next, the system determines if an entry for the memory location requested by the load instruction already exists in the transaction buffer. If not, the system allocates an entry for the memory location in the transaction buffer, reads data for the load instruction from the cache, and stores the data in the transaction buffer. Finally, the system returns the data to the processor to complete the load instruction. In this way, if a remote non-transactional store instruction is received during the transaction, the remote non-transactional store proceeds and does not cause the local transaction to abort.

An internet router is implemented as a network fabric of fabric routers and links. The internet router receives data packets from trunk lines or other internet links and analyzes header information in the data packets to route the data packets to output internet links. The line interface also analyzes the header to define a fabric path through the router fabric. The internet packets are broken into flits which are transferred through the router according to a wormhole routing protocol. Flits are stored in fabric routers at storage locations assigned to virtual channels corresponding to destination internet links. The virtual channels and links within the fabric define virtual networks in which congestion in one virtual network is substantially nonblocking to data flow through other virtual networks. Arbitration is performed at each fabric router to assign packets to virtual channels and to assign virtual channels to output fabric links. A virtual channel is enabled for possible assignment to an output fabric link upon receipt of an indication that an input buffer is available at the next fabric router of the path.

A method of decoding a plurality of glyphs comprising the steps of scanning a group of glyphs to form image data for expected glyph locations, assigning for each location a first value indicative of the likelihood that location contains a glyph in a first state, assigning for each location a second value indicative of the likelihood that location contains a glyph in a second state, determining the difference between the first and second values for each potential glyph location, establishing a distribution analysis of the determined differences and using that distribution analysis at least in part to control decoding of the plurality of glyphs.

Techniques for geolocating social media are described. According to an embodiment, information from textual content of a non-geolocated social media data item stored in a database is extracted. A knowledge database is then searched for a cluster of geo-located social media data items to which the information most closely relates, and an estimated location is assigned to the non-geolocated social media data item according to the cluster to which the information most closely relates. Each cluster comprises one or more representative tags for a spatio-temporal region. The knowledge database is created from geolocated social media data by grouping data according to location and extracting representative tags from the location's grouping of data according to textual content as well as information related to reliability and truthfulness of the textual content.

A method of processing data for storage in a storage medium coupled to a processing unit adapted to access data stored in the storage medium as one or more pages of data, each page having a predetermined page size and a corresponding virtual memory address, the method comprising: obtaining a compressed data item including compressed data corresponding to a first memory page of uncompressed data; dividing the compressed data item into an initial part and a supplementary part, the initial part having an initial part size; determining respective second memory locations for the supplementary parts so as to reduce the number of sectors occupied by the supplementary parts; allocating the initial part together with an index data item at a first memory location associated with the first memory page, the index data item being indicative of a second memory location; allocating the supplementary part at the second memory location.

A data processing apparatus and method are provided for managing multiple program threads executed by processing circuitry. The multiple program threads include at least one high priority program thread and at least one lower priority program thread. At least one storage unit is shared between the multiple program threads and has multiple entries for storing information for reference by the processing circuitry when executing the program threads. Thread control circuitry is used to detect a condition indicating an adverse effect caused by a lower priority program thread being executed by the processing circuitry and resulting from sharing of the at least one storage unit between the multiple program threads. On detection of such a condition, the thread control circuitry issues an alert signal, and a scheduler is then responsive to the alert signal to cause execution of the lower priority program thread causing the adverse effect to be temporarily halted, for example by causing that lower priority program thread to be de-allocated and an alternative lower priority program thread allocated in its place. This has been found to provide a particularly efficient mechanism for allowing any high priority program thread to progress as much as possible, whilst at the same time improving the overall processor throughput by seeking to find co-operative lower priority program threads.

The invention discloses an optimization method for solving an omni-channel logistics distribution problem. In a first stage, a Lagrange relaxation technology is used to solve a LAP (Location-allocation Problem) problem. In a second stage, adaptive large-scale neighborhood search is used for solving a multi-vehicle-type vehicle path problem, a feasible solution can be searched in a large range in a solution space through one group of simple destruction and reconstruction algorithms, and a situation of falling into local optimum can be effectively avoided. Meanwhile, a simulated annealing acceptance criteria realized in the adaptive large-scale neighborhood search can guarantee the quality of a solution and the convergence of the algorithm, a result is output after the algorithm is executed for an appointed iteration number, a time constraint requirement can be met, and a good vehicle distribution scheme is solved for enterprises in limiting time. The simpleness of the Lagrange relaxation technology is combined with the efficiency of the adaptive large-scale neighborhood search, so that the integral solving efficiency of a mixed algorithm is high, and the problem of omni-channel logistics distribution can be effectively solved.

A method for representing the structure of an article of manufacture having a plurality of design variants includes defining a plurality of positions corresponding to different predefined locations on the article of manufacture and assigning at least one variant to each position. Each variant identifies a specific part that may be used in the respective position or a specific type of connection between a pair of parts. In any given position, at most one part or connection variant can be selected. Code rules are defined for each variant which indicate when a particular variant should be used in accordance with specified design options. The position and variant representation can be implemented as part of a bill of materials used for manufacturing resource planning. Improved methods for defining the code rules, for evaluating the code rules in the bill of materials to determine manufacturing parts requirements for a plurality of orders, and for generating documentation for manufactured variants of the article are also disclosed.

Position based WPAN (Wireless Personal Area Network) management. Based on either the relative position or the specific location of devices within a WPAN, communication between the various devices is managed by grouping the devices into two or more groups. In addition, the communication between theses various devices may be governed by profiles assigned to the groups (or even the actual individual devices) that are assigned based on their locations within the WPAN. The relative locations of the devices may be made using ranging that is performed by transmitting UWB (Ultra Wide Band) pulses between the various devices within the WPAN. Alternatively, each device may include GPS (Global Positioning System) functionality and information corresponding to the specific locations of the devices may be communicated between the devices, and that information may be used to group devices user and/or assign profiles to govern the communication to and from the devices.

Methods, apparatuses, and computer program products for selected alert delivery in a distributed processing system are provided. Embodiments include receiving a plurality of events from one or more event producing components of the distributed processing system; creating, by an incident analyzer, in dependence upon the events a truth space representing events that make one or more conditional event processing rules true, the truth space including a set of truth points, each truth point including a set of events and a set of event locations; creating, by the incident analyzer, in dependence upon the truth space one or more alerts including assigning one of the locations of the truth space to one or more of the alerts; and sending, by the incident analyzer, the alerts to at least one component of the distributed processing system.

A system and method for assigning a plurality of locations to individuals and for creating work schedules and routes for the individuals is disclosed. In one aspect of the invention, location data including a list of locations and location addresses is received. The location coordinates are determined from the location addresses. Next, individual data including addresses of the individuals is received, and individual coordinates are determined from the individual addresses. Next, the distances between the individual coordinates and location coordinates are determined, and the locations are assigned to the individuals based on the distances, the individual data and other predetermined criteria.

A transaction based location assignment system creates a complete and more accurate location assignment database for all products available in a store. Transaction data from checkout stands (point of sale terminals) spread around a department store, and the location of each of those checkout stands during POS transactions, is used to create a most probable location of items available in the store. Memory matrixes are built comprising product purchase or transaction information from the checkout stands, and the location of each of the checkout stands, and weighting based on other factors, provide for a best fit match to determine the most probable location within the store of all items within the store. The transaction based location system has the capability to work both for items having a single location in the store, as well as for items available from multiple physical locations in the store.

Embodiments of the invention are generally directed to a system and method for service parts planning in a multi-echelon network having one or more service parts. For at least a subset of the one or more service parts, a calculation is performed to determine a location within the multi-echelon network at which allocating the service part provides the greatest gain in system availability per item cost. In one embodiment, the calculations take into consideration violations of incremental optimal allocation. In an embodiment, the calculations take into consideration violations of convexity.

A system and method for transmitting IP packets arranged in an L×D matrix comprising data packets and L number of FEC packets, L corresponding to a number of columns in the matrix, and D corresponding to a number rows in the matrix includes assigning a first location in the matrix as an FEC packet location, skipping D number of locations in the matrix from the most recently assigned FEC packet location to a new location, and determining if the new location is positioned in the same column as an existing FEC packet location. The new location is assigned as an FEC packet location if it is determined that the new location is not positioned in the same column as an existing FEC packet location. If it is determined that the new location is positioned in the same column as an existing FEC packet location, then the location is moved back in the matrix until the moved-back location is not positioned in the same column as an existing FEC packet location, and the moved-back location is assigned as an FEC packet location. The skipping, determining, assigning, and moving back are repeatedly performed until the number of FEC packet locations is equal to L. The FEC packets protecting the D previous IP packets in the same column are transmitted in accordance with the identified FEC packet locations.

A data structure is provided for preventing access, in a computer system, to a data object having an identifier (ID). The data structure comprises a first lock object, in which the ID of the data object is stored, and in which a link to a storage location of the data object is assigned to the ID, and a second lock object, in which the ID of the data object is stored. In one embodiment, the ID is stored in the second lock object before storing the ID in the first lock object or before assigning the storage location of the data object to the ID in first lock object. Further, the ID is deleted from the second lock object after storing the ID in the first lock object or after assigning the storage location of the data object to the ID in the first lock object. The data object may be accessible by a software application, whereby the access of the software application to the data object is prevented if the ID is stored in the first or second lock object.

The present invention relates to a system 10 and method for identifying the position of cellular telephones 12 in a geographical area served by a mobile telephony network 14. The system 10 comprises a mobile location center 15 capable of analyzing information about the electromagnetic (RF) field transmitted by cellular telephones 12 with reference information including both RF information and probabilistic information associated with the morphology of the geographical area. The method involves assigning different weights to the location of cellular telephones 12 as a function of probabilistic reference information, and thus makes it possible to use statistical methods for resolving situations of ambiguity in locating cellular telephones which would otherwise be resolved in purely random fashion.

Techniques are provided for allocating storage space to a storage pool. A request for storage space for the storage pool is received. A list of locations associated with the storage pool is obtained, wherein the locations are capable of spanning multiple file systems or multiple directories within a single file system. One or more allocation techniques are applied to select one or more locations at which storage space is to be allocated. The storage space is allocated at the selected one or more locations.