Abstract: A chemical reactor for inductive heating has a non-conductive reactor wall (104) defining an interior (106) of the reactor, a conductive electromagnetic metamaterial susceptor (102) having an open cell 3D lattice structure distributed throughout a volumetric region within the interior of the reactor, electromagnetic coils (100) surrounding the susceptor, and a power supply (116) connected to the electromagnetic coils and adapted to produce AC electrical power at a predetermined operating frequency, thereby generating an electromagnetic field having a predetermined wavelength causing inductive heating of the susceptor. The susceptor has a predetermined effective AC conductivity response Gefr as a predetermined function of position within the volumetric region at the predetermined operating frequency.

Abstract: Disclosed is a system and method of generating, for a given game map, an LOS catalog before gameplay and identifying a spawn location during gameplay based on the LOS catalog. For every unique pair of map nodes in a game map, the LOS catalog may indicate the minimum distance that must be traveled from a first map node of the pair to achieve LOS to a second map node of the pair, an identifier for the first map node, and an identifier for the second map node. When a gameplay session is initiated, the LOS catalog may be retrieved and used to identify relatively safe spawn points based on distances that must be traveled from enemy positions to achieve LOS to potential spawn points.

Abstract: The present invention provides methods for executing a private computer program on untrusted computers. The present invention also provides for products produced by the methods of the present invention and for apparatuses used to perform the methods of the present invention.

Abstract: Disclosed is a system and method of generating, for a given game map, an LOS catalog before gameplay and identifying a spawn location during gameplay based on the LOS catalog. For every unique pair of map nodes in a game map, the LOS catalog may indicate the minimum distance that must be traveled from a first map node of the pair to achieve LOS to a second map node of the pair, an identifier for the first map node, and an identifier for the second map node. When a gameplay session is initiated, the LOS catalog may be retrieved and used to identify relatively safe spawn points based on distances that must be traveled from enemy positions to achieve LOS to potential spawn points.

Abstract: Techniques for storing information representing a venue are described. A venue data provider may upload venue data to a venue data service. The venue data can include locations, geometries, and business categories of the buildings and floors. The venue data service can validate the venue data, and request a survey service to survey the venue using the validated venue data. A survey can include recording measurements of an environment variable at various locations of the venue. The location service can generate location fingerprint data from the survey. The location fingerprint data can include expected measurements of the environment variable at various locations of the building. The venue data service can provide the location fingerprint data to a mobile device such that the mobile device can determine a location of the mobile device in the venue using sensor readings of the environment variable.

Abstract: Disclosed is a system and method of generating, for a given game map, an LOS catalog before gameplay and identifying a spawn location during gameplay based on the LOS catalog. For every unique pair of map nodes in a game map, the LOS catalog may indicate the minimum distance that must be traveled from a first map node of the pair to achieve LOS to a second map node of the pair, an identifier for the first map node, and an identifier for the second map node. When a gameplay session is initiated, the LOS catalog may be retrieved and used to identify relatively safe spawn points based on distances that must be traveled from enemy positions to achieve LOS to potential spawn points.

Abstract: A method, system and computer program product for cache replacement. The present invention leverages Belady's optimal replacement algorithm by applying it to past cache accesses to inform future cache replacement decisions. The occupied cache capacity of a cache is tracked at every time interval using an occupancy vector. The cache capacity is retroactively assigned to the cache lines of the cache in order of their reuse, where a cache line is considered to a cache hit if the cache capacity is available at all times between two subsequent accesses. The occupancy vector is updated using a last touch timestamp of a current memory address. A determination is made as to whether the current memory address results in a cache hit or a cache miss based on the updated occupancy vector. The replacement state for the cache line is stored using the results of the determination.

Abstract: The present invention provides methods for executing a private computer program on untrusted computers. The present invention also provides for products produced by the methods of the present invention and for apparatuses used to perform the methods of the present invention.

Abstract: The present invention provides methods for executing a private computer program on untrusted computers. The present invention also provides for products produced by the methods of the present invention and for apparatuses used to perform the methods of the present invention.

Abstract: Techniques for storing information representing a venue are described. A venue data provider may upload venue data to a venue data service. The venue data can include locations, geometries, and business categories of the buildings and floors. The venue data service can validate the venue data, and request a survey service to survey the venue using the validated venue data. A survey can include recording measurements of an environment variable at various locations of the venue. The location service can generate location fingerprint data from the survey. The location fingerprint data can include expected measurements of the environment variable at various locations of the building. The venue data service can provide the location fingerprint data to a mobile device such that the mobile device can determine a location of the mobile device in the venue using sensor readings of the environment variable.

Abstract: Techniques for storing information representing a venue are described. A venue data provider may upload venue data to a venue data service. The venue data can include locations, geometries, and business categories of the buildings and floors. The venue data service can validate the venue data, and request a survey service to survey the venue using the validated venue data. A survey can include recording measurements of an environment variable at various locations of the venue. The location service can generate location fingerprint data from the survey. The location fingerprint data can include expected measurements of the environment variable at various locations of the building. The venue data service can provide the location fingerprint data to a mobile device such that the mobile device can determine a location of the mobile device in the venue using sensor readings of the environment variable.

Abstract: Disclosed is a system and method of generating, for a given game map, an LOS catalog before gameplay and identifying a spawn location during gameplay based on the LOS catalog. For every unique pair of map nodes in a game map, the LOS catalog may indicate the minimum distance that must be traveled from a first map node of the pair to achieve LOS to a second map node of the pair, an identifier for the first map node, and an identifier for the second map node. When a gameplay session is initiated, the LOS catalog may be retrieved and used to identify relatively safe spawn points based on distances that must be traveled from enemy positions to achieve LOS to potential spawn points.

Abstract: A method, system and computer program product for cache replacement. The present invention leverages Belady's optimal replacement algorithm by applying it to past cache accesses to inform future cache replacement decisions. The occupied cache capacity of a cache is tracked at every time interval using an occupancy vector. The cache capacity is retroactively assigned to the cache lines of the cache in order of their reuse, where a cache line is considered to a cache hit if the cache capacity is available at all times between two subsequent accesses. The occupancy vector is updated using a last touch timestamp of a current memory address. A determination is made as to whether the current memory address results in a cache hit or a cache miss based on the updated occupancy vector. The replacement state for the cache line is stored using the results of the determination.

Abstract: The present invention provides methods for executing a private computer program on untrusted computers. The present invention also provides for products produced by the methods of the present invention and for apparatuses used to perform the methods of the present invention.

Abstract: Techniques for storing information representing a venue are described. A venue data provider may upload venue data to a venue data service. The venue data can include locations, geometries, and business categories of the buildings and floors. The venue data service can validate the venue data, and request a survey service to survey the venue using the validated venue data. A survey can include recording measurements of an environment variable at various locations of the venue. The location service can generate location fingerprint data from the survey. The location fingerprint data can include expected measurements of the environment variable at various locations of the building. The venue data service can provide the location fingerprint data to a mobile device such that the mobile device can determine a location of the mobile device in the venue using sensor readings of the environment variable.

Abstract: The preferred embodiment is a construction kit for small structures that can be built without tools and used as a shelter for animals, or an amusement device for people. In one embodiment, the kit includes two sizes of wall pieces and two sizes of corner pieces that connect to create a solid structure capable of withstanding the elements of nature. The wall and corner pieces have cavities that are arranged on the top, bottom and sides of the pieces. The pieces connect to each other using common connectors that fit snugly into the cavities. The pieces can be used to create a variety of differently sized and shaped structures. The preferred embodiment further comprises pieces that are used to create a roof structure and a floor structure that connect to the wall and corner pieces using connectors and said cavities. In the preferred embodiment the pieces are made of plastic using plastic-injection manufacturing processes.

Abstract: The preferred embodiment is a construction kit for small structures that can be built without tools and used as a shelter for animals, or an amusement device for people. In one embodiment, the kit includes two sizes of wall pieces and two sizes of corner pieces that connect to create a solid structure capable of withstanding the elements of nature. The wall and corner pieces have cavities that are arranged on the top, bottom and sides of the pieces. The pieces connect to each other using common connectors that fit snugly into the cavities. The pieces can be used to create a variety of differently sized and shaped structures. The preferred embodiment further comprises pieces that are used to create a roof structure and a floor structure that connect to the wall and corner pieces using connectors and said cavities. In the preferred embodiment the pieces are made of plastic using plastic-injection manufacturing processes.

Abstract: A method for preforming memory prefetching is disclosed. A stream length histogram (SLH) is initially generated based on a stream of Read and Write requests intended for a system memory. A determination is then made whether or not to issue a prefetch command after a Read request based on information within the generated SLH. In a determination that a prefetch command should be issued, prefetch command to be sent to the system memory is issued along with other commands.

Abstract: A method for preforming memory prefetching and scheduling prefetch commands inside the memory controller is disclosed. A set of prefetch commands is generated based on a stream of Read requests intended for a system memory, and the prefetch commands are stored in a low priority queue (LPQ). A set of regular commands is generated based on a stream of Read and Write requests intended for the system memory, and the regular commands are stored in a centralized arbiter queue. One of the prefetch commands is issued from the LPQ depending on the status of the other queues in the memory controller.