Abstract: Processes may be assigned to specific processors when memory objects consumed by the processes are located in memory banks closely associated with the processors. When assigning processes to threads operating in a multiple processor NUMA architecture system, an analysis of the memory objects accessed by a process may identify processor or group of processors that may minimize the memory access time of the process. The selection may take into account the connections between memory banks and processors to identify the shortest communication path between the memory objects and the process. The processes may be pre-identified as functional processes that make little or no changes to memory objects other than information passed to or from the processes.

Abstract: Processes may be assigned heap memory within locally accessible memory banks in a multiple processor NUMA architecture system. A process scheduler may deploy a process on a specific processor and may assign the process heap memory from a memory bank associated with the selected processor. The process may be a functional process that may not change state of other memory objects, other than the input or output memory objects defined in the functional process.

Abstract: Executable code may be fingerprinted by inserting NOP codes into the executable code in a pattern that may reflect a fingerprint. The NOP codes may be single instructions or groups of instructions that perform no operation. A dictionary of NOP codes and their corresponding portion of a fingerprint may be used to create a series of NOP codes which may be embedded into executable code. The fingerprinted executable code may be fully executable and the presence of the NOP codes may not be readily identifiable. The fingerprinting mechanism may be used to authenticate executable code in various scenarios.

Abstract: Architecture is provided that facilitates user-controlled access to user profile information related to spam filtering. A user is allowed to selectively expose (or mask) portions of his/her profile related to spam filtering to third parties. Additionally, advertisers and/or content providers can offer incentives or enticement in response to the acceptance of which a user exposes larger portions of their profiles related to spam filtering. The architecture comprises a system that facilitates profile management utilizing a profile component that facilitates creation and storage of an electronic profile including spam filtering information of a user, and a control component under control of the user for controlling access to the profile.

Abstract: Embodiments of the invention relate to an architecture or extension to a window manager. In particular, the extension can provide for a window rotation feature that can be exposed as a rotate button. Additionally or alternatively, the rotation feature can be activated based upon a diverse set of conditions, events, and/or commands. Upon activation of the rotation feature, the window manager can rotate a window about an axis to expose a secondary surface that can be populated with alternative content that is distinct from the content of the primary surface of the window. In addition, the architecture provides techniques for identifying both double-sided graphical objects and potentially double-sided objects.

Abstract: The present disclosure relates generally to determining influencers in a Web 2.0 environment. More specifically, in some implementations, an influence of an electronically-accessed content on an involvement between an accessor and a third party is determined. In further implementations, a provider of the electronically accessed content is rewarded based on the assessed influence.

Abstract: A social network service provides trusted, timely and managed communications between a querying individual and an informed individual by optimizing distribution of queries to reflect a requisite amount of expertise necessary (i.e., interest, background, education, demographic attribute, etc.). Those candidate recipients with a rare level of expertise or specialization can specify a desired level of participation, which is respected. In order not to exhaust their availability, those who are less qualified or part of a larger demographic category appropriate for the query are selected to handle queries of lesser difficulty or less specialization. Anonymity if desired by the recipient party can be supported by increasing the pool of candidate recipients so that the querying party cannot reasonably ascertain who is responding. Timeliness of response, as well as satisfaction in the response, is tracked in order to affect redirection of a query.

Abstract: The claimed subject matter relates to an architecture that can characterize an item involved in a consumer transaction and/or a behavior of a consumer as a virtual financial instrument. The architecture can monitor the future performance of the virtual instrument in order to identify trendspotters as well as trend followers in a particular market domain.

Abstract: An execution environment for functional code may treat application segments as individual programs for memory management. A larger program of application may be segmented into functional blocks that receive an input and return a value, but operate without changing state of other memory objects. The program segments may have memory pages allocated to the segments by the operating system as other full programs, and may deallocate memory pages when the segments finish operating. Functional programming languages and imperative programming languages may define program segments explicitly or implicitly, and the program segments may be identified at compile time or runtime.

Abstract: Executable code may be recompiled so that generic portions of code may be replaced with specific portions of code. The recompilation may customize executable code for a specific use or configuration, making the code lightweight and executing faster. The replacement mechanism may replace variable names with fixed values, replace conditional branches with only those branches which are known to be executed, and may eliminate executable code portions that are not executed. The replacement mechanism may comprise identifying known values defined in the executable code for variables, and replacing those variables with the constant value. Once the constants are substituted, the code may be analyzed to identify branches that may be evaluated using the constant values. Those branches may be reformed using the constant value and the rest of the conditional code that may not be accessed may be removed.

Abstract: A hybrid operating system may allocate two sets of resources, one to a first operating system and one to a second operating system. Each operating system may have a memory manager, process scheduler, and other components that are aware of each other and cooperate. The hybrid operating system may allow one operating system to provide one set of services and a second operating system to provide a second set of services. For example, the first operating system may have monitoring applications, user interfaces, and other services, while the second operating system may be a lightweight, high performance operating system that may not provide the same services as the first operating system.

Abstract: An operating system may be configured using a control flow graph that defines relationships between each executable module. The operating system may be configured by analyzing an application and identifying the operating system modules called from the application, then building a control flow graph for the configuration. The operating system may be deployed to a server or other computer containing only those components identified in the control flow graph. Such a lightweight deployment may be used on a large scale for datacenter servers as well as for small scale deployments on sensors and other devices with little processing power.

Abstract: A process scheduler may use a scheduling graph to determine which processes, threads, or other execution elements of a program may be scheduled. Those execution elements that have not been invoked or may be waiting for input may not be considered for scheduling. A scheduler may operate by scheduling a current set of execution elements and attempting to schedule a number of generations linked to the currently executing elements. As new elements are added to the scheduled list of execution elements, the list may grow. When the scheduling graph indicates that an execution element will no longer be executed, the execution element may be removed from consideration by a scheduler. In some embodiments, a secondary scan of all available execution elements may be performed on a periodic basis.

Abstract: Embodiments of the invention relate to an architecture or extension to a window manager. In particular, the extension can provide for a window rotation feature that can be exposed as a rotate button. Additionally or alternatively, the rotation feature can be activated based upon a diverse set of conditions, events, and/or commands. Upon activation of the rotation feature, the window manager can rotate a window about an axis to expose a secondary surface that can be populated with alternative content that is distinct from the content of the primary surface of the window. In addition, the architecture provides techniques for identifying both double-sided graphical objects and potentially double-sided objects.

Abstract: Embodiments of the invention relate to an architecture or extension to a window manager. In particular, the extension can provide for a window rotation feature that can be exposed as a rotate button. Additionally or alternatively, the rotation feature can be activated based upon a diverse set of conditions, events, and/or commands. Upon activation of the rotation feature, the window manager can rotate a window about an axis to expose a secondary surface that can be populated with alternative content that is distinct from the content of the primary surface of the window. In addition, the architecture provides techniques for identifying both double-sided graphical objects and potentially double-sided objects.

Abstract: The claimed subject matter relates to an architecture or extension to a window manager. In particular, the extension can provide for a window rotation feature that can be exposed as a rotate button. Additionally or alternatively, the rotation feature can be activated based upon a diverse set of conditions, events, and/or commands. Upon activation of the rotation feature, the window manager can rotate a window about an axis to expose a secondary surface that can be populated with alternative content that is distinct from the content of the primary surface of the window. In addition, the architecture provides techniques for identifying both double-sided graphical objects and potentially double-sided objects.

Abstract: A logical file system is described that distributes copies of files across various different physical storage resources yet provides a consistent view to the user of his or her data, regardless of which machine the user is accessing the files from, and even when the user's computer is offline. The distributed file system uses smart data redundancy to enable a virtually infinite amount of storage as long as additional storage resources are made available to the distributed file system. The result is a reliable storage system that does not necessarily tie the user's data to the user's particular computer. Instead, the user's data is associated with the user—for life—or for however long the user would like the data to be maintained, regardless of whether the user's computer or data storage components are replaced or destroyed.

Abstract: Architecture is provided that facilitates user-controlled access to user profile information. A user is allowed to selectively expose (or mask) portions of his/her profile to third parties. Additionally, advertisers and/or content providers can offer incentives or enticement in response to the acceptance of which a user exposes larger portions of their profile. The architecture comprises a system that facilitates profile management utilizing a profile component that facilitates creation and storage of an electronic profile of a user, and a control component under control of the user for controlling access to the profile. Machine learning and reasoning is provided to make inferences and automate aspects thereof.

Abstract: The claimed subject matter relates to an architecture that can create a wish list based upon a variety of inputs and criteria. In one aspect the architecture can generate a wish list based upon one or more images of an item desired by a user. Accordingly, the architecture can examine the image to identify the desired item and to extract relevant features from the item in order to, e.g., match the imaged item to a catalog item for sale by a vendor. In another aspect, the architecture can access information associated with a third party to build a wish list for a user. Appreciably, according to the particular aspect, the wish list can include items that are designated to a particular beneficiary.

Abstract: The claimed subject matter provides systems and/or methods that facilitate dynamically allocating resources (e.g., hardware, software, . . . ) supported by a third party service provider. The third party service provider can support any number of services that can be concurrently requested by several clients without user perception of degraded computing performance as compared to conventional systems/techniques due to improved connectivity and mitigated latencies. An interface component can receive a request from a client device. Further, a dynamic allocation component can apportion resources (e.g., hardware resources) supported by the third party service provider to process and respond to the request based at least in part upon subscription data. Moreover, a user state evaluator can determine a state associated with a user and/or the client device; the state can be utilized by the dynamic allocation component to tailor resource allocation.