Abstract: A sender telephone receives a text message to send to a receiver telephone. The sender telephone determines the transmission delay time by sending a predetermined message to receiver telephone, based on the time it receives an address complete message and a release message. The sender telephone determines a constant value that is greater than the transmission delay time and in response to the determining the constant value, ringing the receiver telephone to transmit the received inputted text message. A receiver telephone receives a predetermined message from a caller telephone to determine a transmission delay time, based on the time it receives the address complete message and a release message. The receiver telephone determines a constant value that is greater than the transmission delay time. The receiver telephone receives incoming rings from the caller telephone and converts the received rings into a text message to be displayed.

Abstract: A sender telephone receives a text message to send to a receiver telephone. The sender telephone determines the transmission delay time by sending a predetermined message to receiver telephone, based on the time it receives an address complete message and a release message. The sender telephone determines a constant value that is greater than the transmission delay time and in response to the determining the constant value, ringing the receiver telephone to transmit the received inputted text message. A receiver telephone receives a predetermined message from a caller telephone to determine a transmission delay time, based on the time it receives the address complete message and a release message. The receiver telephone determines a constant value that is greater than the transmission delay time. The receiver telephone receives incoming rings from the caller telephone and converts the received rings into a text message to be displayed.

Abstract: A computer-implemented method for prediction of required number of server computing systems for future computing workload is provided. The computer implemented method comprises connecting a portion of a plurality of server computing systems of a data center. The computer-implemented method further comprises computing at least one server computing system of each of a class I server computing system, a class S server computing system, and a class R server computing system of the plurality of the server computing systems based on a deployment rate, an undeployment rate, and a removing rate of the each of the class I server computing system, the class S server computing system, and the class R server computing system.

Abstract: A method, system, and/or computer program product stores information in a distributed data-processing environment. The method comprises: encrypting, by one or more processors, a piece of information; splitting, by one or more processors, the encrypted piece of information into at least one first encrypted block and at least one second encrypted block, at least part of said at least one first encrypted block being required for decrypting said at least one second encrypted block; distributing, by one or more processors, said at least one first encrypted block for storing in at least one first location; and distributing, by one or more processors, said at least one second encrypted block for storing in at least one second location.

Abstract: A sender telephone receives a text message to send to a receiver telephone. The sender telephone determines the transmission delay time by sending a predetermined message to receiver telephone, based on the time it receives an address complete message and a release message. The sender telephone determines a constant value that is greater than the transmission delay time and in response to the determining the constant value, ringing the receiver telephone to transmit the received inputted text message. A receiver telephone receives a predetermined message from a caller telephone to determine a transmission delay time, based on the time it receives the address complete message and a release message. The receiver telephone determines a constant value that is greater than the transmission delay time. The receiver telephone receives incoming rings from the caller telephone and converts the received rings into a text message to be displayed.

Abstract: A method, system and program product for analyzing textual information and providing a visual representative of a summary of such textual information in the form of a ranked list of icons. A text to icon engine is used that takes as input a textual document. A plurality of icons are each associated to a specific rule such that when the text to icon engine processes textual input, it will apply the rules associated with the icons and return a value that represents how much the text belongs to a specific icon.

Abstract: A method is provided to inspect an open, on-going customer ticket and guide a support team for taking the best action at the best timing. The method involves a customer product historical graph (CPHG) that is generated based on the closed tickets. The CPHG comprises a plurality of graph node chains, and each node of the graph node chains corresponds to an action that is taken when a ticket is handled, also a set of parameters associated with the action.

Abstract: A method, computer program product, and computer system for pre-setting the foreground view of a photograph. A reference image is captured by a camera. The reference image is compared to a current a current image displayed within a viewing field of the camera. One or more alignment guides are displayed within the viewing field of the camera to aid in aligning the reference image and the current image. If it is determined that the reference image and the current image are aligned, the capture of a preferred photograph is enabled.

Abstract: A method, system and program product for balanced workload distribution in a plurality of networked computing nodes. The networked computing nodes may be arranged as a connected graph defining at least one direct neighbor to each networked computing node. The method comprises determining a first workload indicator of the i-th computing node, at a first stage before a new task may be started by the i-th computing node, determining an estimated workload indicator of the i-th computing node, assuming that the new task is performed at a second stage on the i-th computing node, determining estimated workload indicators of each direct neighbor assuming that the new task is performed at the second stage, deciding whether to move the new task to another computing node, and moving the new task to one of the direct neighboring computing nodes of the i-th computing node such that workloads are balanced.

Abstract: A method for adjusting a resource within an area utilizing voting by users. The method includes a computer processor receiving a request from one or more of the users to adjust a resource. The method further includes generating a voting poll for the resource. The method further includes communicating the generated voting poll to a plurality of users, wherein the plurality of users includes the one or more users. The method further includes identifying valid responses to the communicated voting poll based on a first policy related to the resource. The method further includes determining a response to the voting poll, wherein the response is based, at least in part, on the first policy related to the resource and aggregated valid responses of the voting poll. The method further includes applying the determined response to the resource.

Abstract: A method, system and program product for analyzing textual information and providing a visual representative of a summary of such textual information in the form of a ranked list of icons. A text to icon engine is used that takes as input a textual document. A plurality of icons are each associated to a specific rule such that when the text to icon engine processes textual input, it will apply the rules associated with the icons and return a value that represents how much the text belongs to a specific icon.

Abstract: A method includes intercepting a message sent from a computing machine of a first user to at least one second user, analyzing a content of the message to identify each matching context of one or more known contexts matching the content of the message, generating at least one shared entry for each matching context according to information corresponding to the matching context extracted from the message, and submitting each shared entry for publication to at least one collaborative system corresponding to the matching context of the shared entry.

Abstract: A system and diagnosis server are provided for collaborating with electronic noses, as well as a related mobile diagnosis unit and related method. The diagnosis server includes a receiver unit for receiving a set of data from one e-nose of a plurality of e-noses. The set of data may include a sensor identifier, a sensor output value, and a relevance flag for a predefined diagnosis. In addition, a determination unit determines a probability factor for the predefined diagnosis based on the set of data, a relevance function and a distribution function.

Abstract: A system and program product for analyzing textual information and providing a visual representative of a summary of such textual information in the form of a ranked list of icons. A text to icon engine is used that takes as input a textual document. A plurality of icons are each associated to a specific rule such that when the text to icon engine processes textual input, it will apply the rules associated with the icons and return a value that represents how much the text belongs to a specific icon.

Abstract: A computer-implemented method for prediction of required number of server computing systems for future computing workload is provided. The computer implemented method comprises connecting a portion of a plurality of server computing systems of a data center. The computer-implemented method further comprises computing at least one server computing system of each of a class I server computing system, a class S server computing system, and a class R server computing system of the plurality of the server computing systems based on a deployment rate, an undeployment rate, and a removing rate of the each of the class I server computing system, the class S server computing system, and the class R server computing system.

Abstract: A computer processor receives rules associated with applications installed on a mobile device, and collects declared intents of the applications prior to execution of the applications. The computer processor generates possible combinations of declared intents of the applications and collects, by an intent proxy during execution, information associated with intercepted intents. The computer processor compares the information associated with each of the intercepted intents to the rules, wherein a match results in a first violation. The computer processor compares the intercepted intents to the possible combinations of the declared intents, wherein the intercepted intents other than the possible combinations of the declared intents results in a second violation. The computer processor displays a risk alert for the applications associated with either or both of the first violation and the second violation.

Abstract: Controlling access to a computing system. An escalation request is received for performing a protected activity on the computing system by a user not authorized to perform the protected activity. At least one activity indicator being indicative of a skill required to perform the protected activity is retrieved. At least one user indicator being indicative of the skill possessed by the user is retrieved. An indication of a capability of the user to perform the protected activity according to a comparison between the at least one activity indicator and the at least one user indicator is determined. A temporary authorization for performing the protected activity to the user according to the capability thereof is granted or denied. The temporary authorization lasts for a limited time window.

Abstract: A software application distributed as a virtual appliance is automatically installed, updated and removed in a virtual machine system running on top of a virtual machine monitor in a computer. The software application virtual appliance comprises a virtual disk, which is automatically detected and installed or removed at the customer by a virtual disk activation manager program, which executes scripts including commands through an API to the virtual machine monitor. The virtual appliance virtual disk is also created automatically by the software manufacturing using the virtual disk activation manager program. The virtual appliance virtual disk stores the binaries of the software application, a software package created by the software manufacturer using a software package tool, an installer to execute the software package, installation and un-installation scripts and a unique identifier which is a signature for the virtual machine virtual disk.

Abstract: A software application distributed as a virtual appliance is automatically installed, updated and removed in a virtual machine system running on top of a virtual machine monitor in a computer. The software application virtual appliance comprises a virtual disk, which is automatically detected and installed or removed at the customer by a virtual disk activation manager program, which executes scripts including commands through an API to the virtual machine monitor. The virtual appliance virtual disk is also created automatically by the software manufacturing using the virtual disk activation manager program. The virtual appliance virtual disk stores the binaries of the software application, a software package created by the software manufacturer using a software package tool, an installer to execute the software package, installation and un-installation scripts and a unique identifier which is a signature for the virtual machine virtual disk.

Abstract: A computer processor receives rules associated with applications installed on a mobile device, and collects declared intents of the applications prior to execution of the applications. The computer processor generates possible combinations of declared intents of the applications and collects, by an intent proxy during execution, information associated with intercepted intents. The computer processor compares the information associated with each of the intercepted intents to the rules, wherein a match results in a first violation. The computer processor compares the intercepted intents to the possible combinations of the declared intents, wherein the intercepted intents other than the possible combinations of the declared intents results in a second violation. The computer processor displays a risk alert for the applications associated with either or both of the first violation and the second violation.