Abstract: A source computer is associated with multiple certificates. The source signs each certificate with a separate private key. From time to time, the source generates (a) new key pair(s) to replace (an) old one(s). The source uses the new private key(s) to sign the associated certificate(s). The source then requests a connection to a destination computer, the request being associated with the multiple certificates which identify the source. The source also transmits the new public key(s). The destination receives the request, and checks the certificates for validity. If less than all but at least a threshold number of the certificates are valid, the destination notes that one or more new public keys are being distributed. The destination accepts the connection, receives the new public key(s) associated with the invalid certificate(s), and replaces the corresponding old public key(s).

Abstract: A system and method is illustrated for a reader to receive account data associated with an account managed by a financial institution, the account to be accessed to pay an amount associated with an ultra-low latency transaction. The system and method may also include a receiver to receive an instruction authorizing completion of the ultra-low latency transaction, the instruction generated based upon a comparison of the account data to an entry in a list that includes a plurality of account data. Additionally, the system and method may include a mechanism to allow completion of the ultra-low latency transaction.

Abstract: Embodiments of the present invention include a system and method for making it safe to execute downloaded code. The method includes accessing an application, the application making a system call to a library of a computer system for a resource, establishing a requesting thread. The method further includes the library sending a request message to a local security filter; the local security filter validating the requesting thread and returning a digital signature, that uniquely identifies the requesting thread, to the application. The application making a system call to a kernel of the computer system wherein the kernel uses the digital signature from the security filter to validate the requesting thread before allowing access to the requested resource.

Abstract: A method of launching an application in a computer system, the method comprising launching the application in a restricted user account, intercepting at least one request for an operation on a file, the at least one request comes from launching the application, determining whether the at least one file operation request is acceptable, and responsive to the at least one file operation request determined to be acceptable, forwarding the file operation request for the operation on the file on behalf of the application launched in the restricted user account.

Abstract: A processor-based method for automated negotiation with continuous game moves. A game tree is constructed with a root node that represents a current state of the negotiation. The game tree is evaluated, and a next offer selected. A range-term is defined based on the continuous game moves and the range-term is treated as a single continuous variable in the game tree. Expansion of a branch of the game tree is halted at a range-term node for which only the range-term was changed in a previous move leading to that range-term node. An optimum payoff value for each range-term node is then determined and output to a computer peripheral.

Abstract: A method for visualizing high density graphical data sets for display is effectuated by determining the graphical density corresponding to an area of the display, where the graphical density is of a non-uniform nature. A non-linear visual space transformation corresponding to the graphical density is processed. Resolution in the area of the display is increased in response to the non-linear visual space transformation and the area is displayed with increased resolution.

Abstract: A user is provided a non-degraded presentation experience from data while access to the non-degraded presentation experience is limited. In an embodiment, one or more attributes are gathered from one or more sources. The data is accessed. Further, the data is adapted using the one or more attributes so that availability of the non-degraded presentation to the user is dependent on the one or more attributes. Examples of attributes include user attributes, environmental attributes, and presentation attributes.

Abstract: A computer application is run within a restricted user account including permissions to access contact information for at least one computer system. If a computer virus infects the application, the application uses the contact information to send a message to only authorized computers including the at least one alert computer.

Abstract: A method for accessing a file for editing includes limiting access permissions of an application to one or more directories including a first directory and receiving a request to edit the file stored in a second directory using the application. The second directory is not included in the one or more directories available to the application. The file is copied from the second directory to the first directory.

Abstract: A method of scheduling optional instructions in a compiler targets a processor. The scheduling includes indicating a limit on the additional processor computations that are available for executing an optional code, generating one or more required instructions corresponding to a source code and one or more optional instructions corresponding to the optional code used with the source code and scheduling all of the one or more required instructions with as many of the one or more optional instructions as possible without exceeding the indicated limit on the additional processor computations for executing the optional code.

Abstract: A computer operable to execute instructions having embedded synchronization points includes a first program counter and a second program counter. The computer also includes a synchronization unit electrically coupled to the first and second program counters. When a synchronization point is reached, the synchronization unit is operable to stall the first or second program counter.

Abstract: In one aspect, a value of a variable shared by multiple threads for executing the program code is stored in a thread-local variable. A data race condition is detected based on a comparison of values of the shared variable and the thread-local variable. Detection of the data race condition is reported. In another aspect, a machine-readable instruction to store in a thread-local variable a value of a variable shared by multiple threads for executing the program code is generated. A machine-readable instruction to detect a data race condition based on a comparison of values of the shared variable and the thread-local variable is generated. The machine-readable instructions are stored in a machine-readable medium.

Abstract: In one aspect, a data race condition is detected based on an address of a variable shared by at least first and second threads for executing the program code, the shared variable address being stored in a hardware table. Detection of the data race condition in the program code is reported. In another aspect, at least first and second threads for executing the program code are synchronized based on an address of a variable shared by the threads and stored in a hardware table.

Abstract: In one aspect, machine-executable code is generated. The machine-executable code includes machine-readable instructions for detecting a memory address bounds violation by the program code based on a determination that a boundary memory address stored in a hardware table has been accessed during execution of the program code. The boundary memory address delimits a boundary for a set of memory addresses allocated for execution of the program code. The machine-executable code is stored in a machine-readable medium. In another aspect, a boundary memory address delimiting a boundary for a set of memory addresses allocated for execution of the program code is stored in a hardware table. The program code is executed. A memory address bounds violation by the program code is detected based on a determination that the boundary memory address stored in the hardware table has been accessed during execution of the program code.

Abstract: Availability of a critical section is determined according to a state associated with an address table entry and a speculative instruction.

Abstract: Methods associated with a service are identified. Select ones of the methods are matched to generic methods of a conversation. A new service is established from the conversation that includes the select ones of the methods.

Abstract: A computer architecture includes a predetermined number of architected registers. The architected registers include a plurality of implemented registers and a plurality of unimplemented registers.

Abstract: A system and method for typing resources in a distributed system is provided which enables flexible searching mechanisms for finding distributed resources. The distributed system includes at least three types of resources: service, vocabulary and contract resources. The service resource includes the implementation logic for the service. A contract resource contains interface data used for accessing resources. The vocabulary resource contains an attribute schema defining attributes used to describe resources. Each resource—including service, vocabulary and contract resources—is typed by associating one or more vocabulary resources and one or more contract resources with the resource. The vocabulary resources explain the meaning of attribute lists describing the resource and enable the resource to be discovered. The contract resources provide data for accessing the resource.

Abstract: A method and system for cryptographically secure hashed end marker of streaming data. In one embodiment, a method for transmitting streaming data comprises establishing a shared secret between a receiving participant and a sending participant; using the shared secret to initialize a cryptographically secure hashed end of file marker for the streaming data that is updated as the streaming data is transmitted or received; transmitting the streaming data from the sending participant to the receiving participant; and comparing the streaming data with the cryptographically secure hashed end of file marker to determine when an end of the streaming data occurs.

Abstract: This disclosure provides a method and apparatus for processing descriptive statements. More particularly, this disclosure provides a way of quickly and reliably signing and authenticating RDF statements without requiring a data sort. By using a commutative hashing function that combines multiple independent hashes, ideally one per serialized statement, signing and verifying can each be completed without a data sort; inclusion of an “extra” identifier, e.g., the total number of RDF statements, may enhance the security of the signed statements by helping minimize exposure to potential attackers. The disclosure also describes how to later add additional statements to an existing signature and hash using an incremental process.