Abstract: A message transport system may use a publication subscription mechanism to connect nodes and transport messages through the nodes. Each node may establish connections to other nodes, and subscription requests and publication notifications may be passed across the nodes to establish paths for messages. When a message is published, the message may be passed over those connections for which a subscription is active. A path identifier may be added to the message as it is passed between nodes, and the path identifier may be used by a subscribing node for identification of the information being received. When a subscriber notification is removed, the path may be deconstructed across multiple nodes. The nodes may be arranged such that each node is agnostic to any connections past the nodes to which it is connected, and may allow any node to subscribe to any information published within the network.

Abstract: This document describes techniques and apparatuses for asynchronous handling of a user interface manipulation. These techniques handle a user interface manipulation with two or more asynchronous processes. One asynchronous process, for example, may determine a position responsive to the user interface manipulation while another asynchronous process determines the pixels to render. By so doing, these techniques enable a quick and/or consistent response to a user interface manipulation.

Abstract: Architecture that employs a “trainer” camera which uses various pieces of information about the scene being photographed in order to provide the user with options for improving the quality of the photo. The user is guided to emulate professionally or highly rated photographs of the same scene and in the process is trained by the camera to take better pictures. As cameras come equipped with sensory functions such as geolocation capabilities, compass, altimeter, and wireless connectivity such as cellular, Wi-Fi, and Bluetooth, the architecture assists the consumer to take higher quality photos by leveraging these new capabilities as well as the vast amount of photo data and information stored on the Internet and other locations.

Abstract: Interactive relighting with dynamic reflectance involves relighting a graphical scene with dynamic changes to the reflectance(s) in the graphical scene. A graphical scene may include source radiance, regions having reflectances, a surface spot, incident radiation from the source radiance at the surface sport, an incident direction, a viewing direction, exit radiance, and so forth. In an example embodiment, a graphical scene is relighted based on at least one adjusted reflectance of the graphical scene using an incident radiance at a surface spot that is separated into respective incident radiance components corresponding to different respective numbers of interreflections in the graphical scene. In another example embodiment, a graphical scene is relighted based on at least one adjusted reflectance of the graphical scene using a tensor representation for a reflectance of a surface spot with the tensor representation being segmented into three adjustable factors for lighting, viewing, and reflectance.

Abstract: Systems and methods are disclosed for synchronizing data stored in remote stores. Data stored in locations such as computer applications, consumer electronic devices and Internet websites is synchronized with a central database within a computer device. The computer device may also store constraints that limit the type of data that may be synchronized with individual stores. A graphical user interface may use different formats or icons to distinguish between data stored in a store and data included within the central database.

Abstract: Domain name caching mechanisms are provided to address cache-defeating approaches. Domain name lookup requests are processed and cached information associated with a non-identical domain name returned in response. Cache-defeating behavior including nonce injection can be detected or inferred and employed to map domain name requests to previously cached information thereby exposing the benefits of caching.

Abstract: Players in a gaming environment, particularly, electronic on-line gaming environments, may be scored relative to each other or to a predetermined scoring system. The scoring of each player may be based on the outcomes of games between players who compete against each other in one or more teams of one or more players. Each player's score may be represented as a distribution over potential scores which may indicate a confidence level in the distribution representing the player's score. The score distribution for each player may be modeled with a Gaussian distribution and may be determined through a Bayesian inference algorithm. The scoring may be used to track a player's progress and/or standing within the gaming environment, used in a leaderboard indication of rank, and/or may be used to match players with each other in a future game.

Abstract: Described is a technology by which an expression in a database engine is executed against stacks of data. Each instruction of the expression is evaluated against the data stacks until completed against each data stack, such as by iterating to execute an instruction through the data stacks before executing the next instruction. The data may be arranged in the data stacks (in memory) in various ways, such as to have each data stack contain the data of one database row, (e.g., with the data stack elements comprising column data. Data may be grouped, such as to put the data from different rows into the same data stack.

Abstract: Various methods and apparatuses are provided for generating and verifying digital signatures. In certain methods and apparatuses digital signature generating logic encrypts data based on a Jacobian of a curve, said Jacobian having a genus greater than one. The logic is configured by parameter data so as to select at least one Gap Diffie-Hellman (GDH) group of elements relating to the curve. The logic also determines private key data and corresponding public key data and signs the identified data with the private key data to create a corresponding digital signature. In other methods and apparatuses, the signature generating logic encrypts data based on a Weil pairing on a Jacobian of at least one super-singular curve having a genus greater than one.