International Business Machines Corporation

David Joel Edelsohn

Hubertus Franke

Robert William Wisniewski

Orran Yaakov Krieger

Bryan Savoye Rosenburg

Marc Alan Auslander

Dinesh C Verma

Jose Eduardo Moreira

David Michael Daly

Shahrokh Daijavad

Kaoutar El Maghraoui

Ayal Zaks

Jessica Hui-Chun Tseng

Tracy Jay Kimbrel

Priya Ashok Nagpurkar

Olga Golovanevsky

Alon Dayan

Dan Gutfreund

Mechanisms are provided for customizing an avatar in a virtual environment. A user that is interacting with the virtual environment, and to whom the avatar is to be rendered in the virtual environment, is identified and classified with regard to a plurality of affinity groups specifying levels of affinity between the first user and an operator of the avatar. A user security and privacy policy (USPP) data structure, associated with the operator, is retrieved that specifying security and privacy policies for each affinity group in the plurality of affinity groups. Based on the user classification and the security and privacy policy, an anonymization operation is applied to static and/or dynamic characteristics data for the operator which are used to render the avatar, to thereby generate anonymized characteristic data. The anonymized characteristic data is output for rendering the avatar in the virtual environment.

Personalized avatars with custom levels of privacy

A method includes embedding clothing with at least one sensor and at least one control unit; a power unit powering on the at least one sensor and the at least one control unit; the at least one sensor monitoring a sensed condition; the at least one control unit conducting a heat prediction based on the sensed condition; and the at least one control unit controlling threads within the clothing based on the heat prediction to actively adjust properties of the clothing.

Actively controlled performance clothing

A data layout optimization may utilize affinity estimation between pairs of fields of a record in a computer program. The affinity estimation may be determined based on a trace of an execution and in view of actual processing entities performing each access to the fields. The disclosed subject matter may be configured to be aware of a specific architecture of a target computer having a plurality of processing entities, executing the program so as to provide an improved affinity estimation which may take into account both false sharing issues, spatial locality improvement and the like.

Architecture-aware field affinity estimation

A method and apparatus for performing efficient interprocess communication (IPC) in a computer system. With this invention, a memory region called the IPC transfer region is shared among all processes of the system to enable more efficient IPC. The unique physical address of the region is mapped into a virtual address from each of the address spaces of the processes of the system. When one of the processes needs to transfer data to another of the processes, the first process stores arguments describing the data in the region using the virtual address in its address space that maps into the unique physical address. When the other or second process needs to receive the data, the second process reads the data from the second region using the virtual address in its memory space that maps into the unique physical address. With this invention, in most cases, control of the IPC transfer region occurs automatically without any kernel intervention.

Technique for efficiently transferring moderate amounts of data across address space boundary

In a computer system, a method and apparatus for scheduling activities' access to a resource with minimal involvement of the kernel of the operating system. More specifically, a &ldquo;next bid&rdquo; is maintained, and this parameter identifies the highest bid for the resource by any activity not currently accessing the resource. The accessing activity then compares its bid, which can be time varying, with the &ldquo;next bid&rdquo; to determine whether it should release the resource to another activity. The &ldquo;next bid&rdquo; can be accessed without any system calls to the operating system. This allows the activity to determine whether to relinquish control to the system without the necessity of communication between the two. Likewise, the operating system can access the bid of the accessing activity without explicit communication. This allows the system to determine whether to preempt the accessing activity without the necessity of communication between the two.

Locally made, globally coordinated resource allocation decisions based on information provided by the second-price auction model

Growing community of inventors

White Plains, NY, United States of America

David Joel Edelsohn