Abstract: Aspects of the present invention disclose a method for avoiding overvoltages of a processor chip. The method includes one or more processors identifying one or more processing units of a computing device. The method further includes determining respective activity levels of one or more processing elements of the one or more processing units of the computing device. The method further includes determining respective voltages of the one or more processing units of the computing device. The method further includes regulating the respective voltages of the one or more processing units of the computing device based at least in part on the respective activity levels of the one or more processing elements.

Abstract: A method for parallelizing a training of a model using a matrix-factorization-based collaborative filtering algorithm may be provided. The model can be used in a recommender system for a plurality of users and a plurality of items. The method includes providing a sparse training data matrix, selecting a number of user-item co-clusters, and building a user model data matrix by matrix factorization such that a computational load for executing the determining updated elements of the factorized sparse training data matrix is evenly distributed across the heterogeneous computing resources.

Abstract: A self-learning cycle timer is disclosed. A wait time is measured between a first indication, associated with a stop, and a second indication, associated with movement following the stop, each indication received from a smart device. A geolocation is received from the smart device and a traffic signal identified at the geolocation. The traffic signal's area of influence is determined. The wait time is determined to have occurred inside the area of influence. An average cycle time and a reference time associated with the traffic signal are retrieved from a database. A cycle time associated with the traffic signal is calculated according to the wait time and the reference time. The average cycle time is updated according to the calculated cycle time.

Abstract: A method of beamforming datasets from a tomographic detection system. The system comprises scintillation detectors that are arranged in D detector pairs, D?1, wherein the detectors are adapted to count radiation hits. According to the method in one aspect, a tomographic dataset is received for each detector pair coordinates (?d, pd) of a detector pair d of the D detector pairs, so as to obtain a plurality of tomographic datasets. Each of said datasets is associated with respective detector pair coordinates (?d, pd). Then, for each point y of interest, the received datasets are coherently combined by weighting the datasets according to respective beamforming weights d(y)=?(?d, pd; y), based on said respective detector pair coordinates (?d, pd) and coordinates of said each point y of interest. This way, a signal focusing on said each point y is obtained. Related tomographic detection systems and computer program products may be also presented.

Abstract: A method comprising using at least one hardware processor for: receiving input from a user with respect to masking of a data element in one or more documents of a java script object notation (JSON) type, wherein the input comprises: an identifier of the data element, and one or more constraints for masking the data element based on the hierarchy of the one or more documents of the JSON-type; and generating a masking rule for the one or more documents of the JSON-type based on the input.

Abstract: A method, program product and a system is provided for managing a cache. The method includes analyzing at least an intermediate product of a computer program. The intermediate product is produced by the computer program in response to a set of control inputs. The method also includes determining a resource measure associated with the first intermediate product and determining a resource measure value for the first intermediate product using a first set of control inputs> The first intermediate product is stored in the cache upon determination that the resource measure value exceeds a predetermined resource threshold.

Abstract: Polychoric correlations between two discrete random variables and polyserial correlations between a discrete random variable and a continuous random variable may be determined by using a normal-to-anything (NORTA) method and a stochastic root finding algorithm.

Abstract: A technique for enhancing and improving the usability of search engine search results that are presented to a user who has requested information using such search engine, by either eliminating, or alternatively distinguishing, web-page/web-site identifiers such as universal resource locators (URLs) from a search result list presented to the user when the web-page/web-site is not currently accessible by the user.

Abstract: Acquiring access to a token controlled system resource, including: receiving, by a token broker, a command that requires access to the token controlled system resource, where the token broker is automated computing machinery for acquiring tokens and distributing the command to the token controlled system resource for execution; identifying, by the token broker, a first need state, the first need state indicating that the token broker requires access to the token controlled system resource to which the token broker does not possess a token; requesting, by the token broker, a configurable number of tokens to gain access to the token controlled system resource, without dispatching an operation handler for executing the command until at least one token is acquired; assigning, by the token broker, an acquired token to the operation handler; and dispatching, by the token broker, the operation handler and its assigned token for executing the command.

Abstract: A carbon nanotube based memory device comprises a set of three concentric carbon nanotubes having different diameters. The diameters of the three concentric carbon nanotubes are selected such that an inner carbon nanotube is semiconducting, and intershell electron transport occurs between adjacent carbon nanotubes. Source and drain contacts are made to the inner carbon nanotube, and a gate contact is made to the outer carbon nanotube. The carbon nanotube based memory device is programmed by storing electrons or holes in the middle carbon nanotube through intershell electron transport. Changes in conductance of the inner carbon nanotube due to the charge in the middle shell are detected to determine the charge state of the middle carbon nanotube. Thus, the carbon nanotube based memory device stores information in the middle carbon nanotube in the form of electrical charge.

Abstract: Discloses a computer-implemented apparatus for dynamic event planning for a plurality of attendees. Included is an event scheduler to schedule, update and delete events for the plurality of attendees, an event location finder invoked by the event scheduler to select at least one event location having an available timeslot for an event for the plurality of attendees, a transition requirement monitor invoked by the event scheduler to estimate a transition time from an origin location to the event location to determine if the available timeslot is feasible for the event, and a dynamic location tracker to track a location of the plurality of attendees and generate an event exception notice for the plurality of attendees if at least one attendee will be unable to attend the event at the event location at the available timeslot.

Abstract: A method to optimize performance of an operator on a computer system includes determining whether the system is busy, decreasing a software thread level within the operator if the system is busy, and increasing the software thread level within the operator if the system is not busy and a performance measure of the system at a current software thread level of the operator is greater than a performance measure of the system when the operator has a lower software thread level.

Abstract: An approach is provided for dynamic loading and rendering of avatar's initial login environment. The approach consists of a method and a system for dynamically rendering locations from a preference list of locations most likely to be visited by an avatar. In one embodiment the method consists of creating a preference list of locations most likely to be visited by the avatar, rendering a dynamically built continuous environment populated from such preference list of locations most likely to be visited by the avatar, and caching and thereafter rendering at least one of the locations from the preference list of locations most likely to be visited by said avatar.

Abstract: A product retail sales management server for managing the retail sales of a product across a communication network comprises: a retail sales management module for managing the retail sales of the product; a price update module 13 for dynamically setting the price of the product in accordance with rules and the retail sales state of the product and in accordance with the actual retail sales state of the product when managed by the retail sales management module; and an acceptance module 11 for, upon the receipt of an information request via the communication network, furnishing a request transmission source with the information concerning the product and the price of the product, set by the price update module at the time the information request is received.

Abstract: A method, system, and computer usable program product for selective computation using analytic functions are provided in the illustrative embodiments. An object graph and information about a change therein is received. The object graph includes several objects representing several resources in an environment as well as a set of analytic function instances in relation to the objects. A set of analytic function dependencies is determined. A first analytic function instance in the set of analytic function instances that has to be re-executed based on the change is identified. A re-computation graph is computed using the analytic function instance and presented. The change may be an addition, a deletion, a modification, or a combination thereof. The change may be a change in an object, in a relationship between two objects, in a relationship between an object in and an analytic function instance in the set of analytic function instances, or in an analytic function instance.

Abstract: Assigning a processor to a logical partition in a computer supporting multiple logical partitions that include assigning priorities to partitions, detecting a checkstop of a failing processor of a partition, retrieving the failing processor's state, replacing by a hypervisor the failing processor with a replacement processor from a partition having a priority lower than the priority of the partition of the failing processor, and assigning the retrieved state of the failing processor as the state of the replacement processor.

Abstract: The present invention provides for a computer network method and system that applies “hysteresis” to an active queue management algorithm. If a queue is at a level below a certain low threshold and a burst of packets arrives at a network node, then the probability of dropping the initial packets in the burst is recalculated, but the packets are not dropped. However, if the queue level crosses beyond a hysteresis threshold, then packets are discarded pursuant to a drop probability. Also, according to the present invention, queue level may be decreased until it becomes less than the hysteresis threshold, with packets dropped per the drop probability until the queue level decreases to at least a low threshold. In one embodiment, an adaptive algorithm is also provided to adjust the transmit probability for each flow together with hysteresis to increase the packet transmit rates to absorb bursty traffic.

Abstract: The present invention allows the contents of network-wide broadcast in a first subnetwork to be passed to a second subnetwork even if a router is set to prevent the network-wide broadcast in the first subnetwork from going out of the first subnetwork. In response to the network-wide broadcast in the first subnetwork, a first broadcast relay generates a packet in which a destination address of the network-wide broadcast packet is changed to an address of a second broadcast relay belonging to a second subnetwork, and outputs the address changed packet to the first subnetwork. The second broadcast relay generates, in response to the packet addressed thereto, a second subnetwork-only broadcast as a local broadcast, and outputs it to the second subnetwork. A server of the second subnetwork performs a predetermined process on the broadcast outputted by the second broadcast relay.

Abstract: A method for metering on-demand service (ODS) resource consumption by a user comprising a web services interface, a processing engine, and configuration data. A data gathering agent in the ODS stores the usage data in records, combines the records into packets, and transmits the packets to the web services interface. The web services interface passes the packets onto the processing engine, which stores the records in the packet into a database. The generalized format of the record is critical because it allows the metrics to be stored in the record table with the usage data. When a record contains an instruction to close a UOW, the processing engine applies the configuration data comprising composition rules and record selection rules to the database. The record selection rules select the desired records from the database. The composition rules aggregate, normalize, and compose the selected records to produce a metric.

Abstract: A method and an apparatus are provided for handling a list DMA command in a computer system. The list DMA command relates to an effective address (EA) of a system memory. At least one processor in the system has a local storage. The list DMA command is queued in a DMA queue (DMAQ). A list element is fetched from the local storage to the DMAQ. The list DMA command is read from the DMAQ. A bus request is issued for the list element. If the bus request is a last request, it is determined whether a current list element is a last list element. If the current list element is not the last list element, it is determined whether the current list element is fenced. If the current list element is not fenced, a next list element is fetched regardless of whether all outstanding requests are completed.