-
公开(公告)号:GB2520226A
公开(公告)日:2015-05-20
申请号:GB201309468
申请日:2013-05-28
Applicant: IBM
Inventor: SGRO ANTONIO MARIO , PROIETTI STEFANO , FERRARA FILOMENA , CAPASSO ANDREA A
Abstract: A solution for sending messages on a data-processing system is proposed. A corresponding method comprises upon a message to be sent from a sender 110s to at least one receiver 110t1, 110t2 being submitted , parsing the message to identify an original expression OEa, OEb, OEc, therein matching an indication of one of a set of pre-defined concepts, determining, for the receiver, a preferred expression CEc of the matched concept, among the corresponding original expression and a set of candidate expressions predefined to express the matched concept, according to a rating thereof representing an expected understanding by the receiver, processing the message for the receiver by replacing the original expression according to the corresponding preferred expression for the receiver, and sending the processed message to the corresponding receiver. The arrangement may allow the same message to be sent to multiple recipients wherein the content of the message is differentiated according to the expected level of understanding of the recipients for individual expressions used in the message. This ensures that the message that a particular recipient receives is clear and understandable for that particular recipient user and avoids potential further exchange of messages to clarify an original intended meaning of an otherwise unclear expression or misunderstanding the meaning of the original message. The expressions may be identified as specialist, jargon, short or context-specific expressions for which particular recipients may require further detail or an alternative way, e.g. simplified, of expressing the same concept. A feedback mechanism is also in place to update the expected levels of understanding for the recipients as the system evolves.
-
公开(公告)号:GB2512847A
公开(公告)日:2014-10-15
申请号:GB201306360
申请日:2013-04-09
Applicant: IBM
Inventor: CORTE GIANLUCA DELLA , SGRO' ANTONIO , DONATELLI ALEX , PROIETTI STEFANO
Abstract: Disclosed is a computer-implemented method of predicting the required number of servers for a future computing workload. The method comprises determining the number of servers in three classes of servers and predicting the future number of servers in the different classes based on a Susceptible-Infected-Recovered-Algorithm. The three classes are, class S are servers that are adapted to deploy the application, class I are servers that deploy the application and class R are servers that are disconnected from the network. The algorithm is based on the deployment rate, un-deployment rate and a removal rate. The deployment rate is the number of servers leaving class S moving to class I, the un-deployment rate is the number of servers leaving class I moving to class S, and the removal rate is the number of servers leaving class I and moving to class R, all in unit time. Such that the total number of servers required in the topology of the computer network in the data centre at a future time t is calculated.
-