Abstract: A system and method is provided that simulates gameplay of non-player characters (NPCs) distributed across networked end user devices. The system may identify end user devices that are connected to the system through a network and are available to participate in a simulation in which each participating end user device is provided with one or more NPCs to be executed. An end user device may be available to participate when it has sufficient computing capacity, such as when in an idle or standby state. As such, the system may leverage spare computing capacity of networked end user devices to execute NPCs at networked end user devices during a simulation. In this manner, the behavior of an NPC may be tested using real-world conditions that may affect gameplay, such as a network connection quality, user-to-user game engine coordination and data exchanges, and/or other real-world conditions associated with networked end user devices.

Abstract: A system and method is provided for continuous gameplay in a multiplayer video game through an unbounded gameplay session. Players may join, exit, and later rejoin a given unbounded gameplay session at any time. A given unbounded gameplay session may therefore continue indefinitely so long as at least one player wishes to continue to gameplay. To facilitate an unbounded gameplay session, the system may score players using time-based or other parameters in a manner that is fair to players who have been playing in the unbounded gameplay session longer than other players.

Abstract: A system and method for providing dynamically variable maps in a video game is disclosed. A map is provided that defines a playable space available to one or more game players in a video game. Gameplay is monitored in real-time for the detection of a trigger event. Upon detection of a trigger event, a map management engine dynamically modifies a configuration of the map to improve the gameplay experience based on the type of trigger event. Dynamic modification of a map may comprise altering one or more of the map boundary, and/or the location, position, size, number, state, etc. of one or more static map objects or dynamic map objects. As a result of the dynamic modification of the map, the map may transform from its initial (or first or beginning) configuration to a modified (or new or second) configuration.

Abstract: A method for monitoring the health of a compute resource includes determining a baseline for the amount of time required for the resource to complete a specific task, monitoring the resource to measure the amount of time actually used by the resource to complete the task in a given instance, comparing the baseline time to the measured time, and determining if the resource is operating within acceptable tolerances based on the comparison. An alert may be created or other remedial action may be taken if the resource is not operating within acceptable tolerances.

Abstract: Aspects of the invention provide for management of storage space utilized by video game information based in part on the engagement of the video game user. For example, one aspect of the invention provides a method of providing information for play of a video game, comprising determining a storage parameter based on user game play related information, the storage parameter indicative of level of commitment of the user to the video game; outside of a game play session of the video game, providing, over a communications network, first information to a compute device associated with the user, the first information for use in providing for game play of the video game by the compute device, the first information being an amount of information determined based on the storage parameter; and during a game play session of the video game, providing additional information for use in providing for game play of the video game by the compute device.

Abstract: A matchmaking system and method is provided that facilitates optimization of player matches for multiplayer video games. The system may provide a generalized framework for matchmaking using historical player data and analytics. The framework may facilitate automatic determinations of an optimal mix of players and styles to produce the most satisfying user experiences. The system may dynamically update analytical processes based on statistical or otherwise observed data related to gameplay at any given time. In this manner, the system may continually tune the matchmaking process based on observations of player behavior, gameplay quality, and/or other information.

Abstract: A system and method is provided that recommends group compositions in multiplayer video games. The system may suggest a composition of a group of players using a matchmaking process. For example, one or more players may wish to form or join a group of players for a given game, but not know what would be an appropriate mix of player styles, player roles, skill levels, and/or other player characteristics that would make an optimal group, given the player's own characteristics. The system may identify optimal groups based on matchmaking related information such as, without limitation, game profile, player profile, prior match scores, prior quality scores, and/or other information. Optimal groups may be those that have performed successfully (e.g., accomplished the most wins, objectives, etc.), are associated with the highest player enjoyment (e.g., based on match and/or quality scores), and/or otherwise are deemed to be desirable.

Abstract: A soft reservation system and method is provided facilitates an unrequested reservation of a gameplay session in multiplayer video games. A soft reservation may include a match between two or more players for one or more subsequent gameplay sessions that are reserved for the players. The system may, for instance, anticipate an interest by players in a gameplay session and make a soft reservation for the players, who may not have explicitly requested the reservation, to play in the gameplay session. A soft reservation may be made for a player based on a match score, a game profile, a player profile, and/or other information.

Abstract: A system and method is provided that drives microtransactions in multiplayer video games. The system may include a microtransaction arrange matches to influence game-related purchases. For instance, the system may match a more expert/marquee player with a junior player to encourage the junior player to make game-related purchases of items possessed/used by the marquee player. A junior player may wish to emulate the marquee player by obtaining weapons or other items used by the marquee player.

Abstract: A technique for obfuscating code. A list of one-byte instructions for a particular processor is created. Bytes in a function to be obfuscated are randomly selected, and these bytes are replaced with one-byte instructions from the list. A table that identifies the replaced bytes and their original values is inserted into the executable that contains the function. When the function is called, the function is deobfuscated by consulting the table to restore the replaced bytes to their original values.

Abstract: An optimal filter kernel, formed by convolving a box filter with a filter of fixed integer width and unity area, is used to perform image resizing and reconstruction. The optimal filter has forced zeros at locations along a frequency scale corresponding to the reciprocal of the spacing of one or more pixels that comprise a source image to be resized. When a rescale value for a source image is selected, the optimal filter kernel is computed, mapped to the source image, and centered upon a location within the source image corresponding to the position of an output pixel to be generated. The number of pixels that lie underneath the optimal filter kernel is established by multiplying the number of pixels that comprise the width of the source image by the selected rescale value. Upon mapping the optimal filter kernel, the output pixel values that comprise the resized image are then evaluated by processing the one or more source image pixels, such as through interpolation.

Abstract: A technique for obfuscating code. A list of one-byte instructions for a particular processor is created. Bytes in a function to be obfuscated are randomly selected, and these bytes are replaced with one-byte instructions from the list. A table that identifies the replaced bytes and their original values is inserted into the executable that contains the function. When the function is called, the function is deobfuscated by consulting the table to restore the replaced bytes to their original values.

Abstract: An optimal filter kernel, formed by convolving a box filter with a filter of fixed integer width and unity area, is used to perform image resizing and reconstruction. The optimal filter has forced zeros at locations along a frequency scale corresponding to the reciprocal of the spacing of one or more pixels that comprise a source image to be resized. When a rescale value for a source image is selected, the optimal filter kernel is computed, mapped to the source image, and centered upon a location within the source image corresponding to the position of an output pixel to be generated. The number of pixels that lie underneath the optimal filter kernel is established by multiplying the number of pixels that comprise the width of the source image by the selected rescale value. Upon mapping the optimal filter kernel, the output pixel values that comprise the resized image are then evaluated by processing the one or more source image pixels, such as through interpolation.

Abstract: A valve is disclosed that generally includes: a valve body that preferably has at least three exhaust ports, which are preferably located in a recess, thereby allowing a larger volume of fluid to flow out from the passageway and providing less restrictive fluid flow; a valve stem with preferably a predetermined diameter along its length to take up less volume in the passageway and interfering less with the flow of pressurized fluid; a preferably aerodynamic seal that provides for less pressure on the seal, more fluid to flow between the valve chamber bore and the passageway, and less turbulence, thereby providing increased fluid flow and allowing the valve to be utilized with both high and low fluid pressure; and a strikable portion to regulate the valve without reliance on such external factors as fluid pressure, valve return spring pressure, striker spring pressure, and striker weight.

Abstract: A collision of a moving object with another object in a 3D virtual world is efficiently determined in real time so that the technique is usable over a network. An object in the 3D virtual world is projected onto a 2D plane. The projection of the object is bounded by a two-sided edge cycle that is formed from a sequence of line segments having endpoints that are consecutively joined at an ordered series of vertices. One side, which is formed by a counterclockwise ordering of the line segments and their respective vertices, is characterized as "front facing." The other side is characterized as "back facing." Additionally, the front and back facing characterization of a side of the edge cycle is determined by the disposition of the moving object, i.e., the closest side of the edge cycle to the moving object is its back facing side. A path line segment is developed for the projection of a path of a moving object onto the 2D plane, and a path line equation is determined for the path line segment.