Abstract: A computer-implemented method, system, and/or computer program product controls access to computer resources used by a computer application. One or more processors fractionate a computer application into disparate components. Two or more of the disparate components are assigned to different communication pathways, where the different communication pathways lead to requisite resources needed to execute the disparate components. One or more processors create and install a virtual machine within at least one of the different communication pathways, such that the virtual machine controls access to a particular requisite resource by a particular disparate component. One or more processors then issue a resource retrieval instruction to retrieve the particular requisite resource via the virtual machine and at least one of the different communication pathways.

Abstract: In an approach for writing data on a tape using a file system, a processor receives a first write request of a first file. A processor obtains data of the first file. A processor writes the data of the first file on a tape. A processor receives a second write request of a second file prior to completion of writing the data of the first file on the tape. A processor adds information about the second file to a first list, wherein the first list includes files waiting to write. Subsequent to writing the data of the first file on the tape, a processor obtains data of the second file based on the first list. A processor writes the data of the second file after the first file on the tape.

Abstract: A computer-implemented method includes receiving a unit, wherein each unit includes one or more blocks. The computer-implemented method further includes selecting one or more input pins for each of said one or more blocks. The computer-implemented method further includes assigning a numerical value to each of said one or more input pins to yield at least one numerical sequence. The computer-implemented method further includes, for each numerical sequence of the at least one numerical sequence, performing a check on the numerical sequence to yield a number of fails. The computer-implemented method further includes determining a simulation condition for power modeling of the unit based on optimizing a numerical sequence with respect to the number of fails. The computer-implemented method further includes determining a number of design errors of the unit based on the simulation condition. A corresponding computer system and computer program product are also disclosed.

Abstract: Processing of character data is facilitated. A Vector String Range Compare instruction is provided that compares each element of a vector with a range of values based on a set of controls to determine if there is a match. An index associated with the matched element or a mask representing the matched element is stored in a target vector register. Further, the same instruction, the Vector String Range Compare instruction, also searches a selected vector for null elements, also referred to as zero elements.

Abstract: A mechanism is provided in a storage device for performing a write operation. The mechanism configures a write buffer memory with a plurality of write buffer portions. Each write buffer portion is dedicated to a predetermined block size category within a plurality of block size categories. For each write operation from an initiator, the mechanism determines a block size category of the write operation. The mechanism performs each write operation by writing to a write buffer portion within the plurality of write buffer portions corresponding to the block size category of the write operation.

Abstract: Clients accessing cloud computing services are allocated respective virtual machines, each client specifying defining parameters for its virtual machine(s). A just-in-time compiler executing within a client's virtual machine optimizes the executable code it generates based at least in part, on the defining parameters of the virtual machine. During execution of an application using the just-in-time compiler, the compiler is notified of changes made to the defining parameters of the virtual machine. Responsive to such notification, the just-in-time compiler thereafter optimizes compiled code it generates for execution in the virtual machine as modified.

Abstract: Methods, apparatus and computer program products implement embodiments of the present invention that enable a computer system comprising networked computers to self-heal from a boot failure of one of the computers. In some embodiments, upon detecting a first computer failing to successfully load a first boot image, a second computer configures the first computer to boot a second boot image. Upon power cycling, the first computer loads the second boot image.

Abstract: A method comprising using at least one hardware processor for: receiving an aerially-captured video and metadata associated with the video; receiving deviation data indicative of an amount of inaccuracy in the metadata; and overlaying, on the video, a geographic annotation descriptive of an object of interest having known geographic coordinates, wherein the geographic annotation is of a size and a shape representative of the amount of inaccuracy.

Abstract: A method, system, and computer program product for selectively associating one or more processing elements, or portions thereof, to one or more compute nodes. The method, system, and computer program product can include presenting a stream computing application, presenting metrics associated with at least one compute node and at least one processing element (or portion thereof), receiving input from a graphical display, associating one or more processing elements (or portions thereof) to one or more compute nodes, and updating the graphical display and the metrics to reflect the selective associations.

Abstract: A method, system, and/or computer program product estimate a cardinality of a joined table (T) obtained by joining at least a first data column (R) and a second data column (S), where R and S each comprise attribute values. A first density distribution function f(x) describes a frequency of the attribute values of R. A second density distribution function (g(x)) describes the frequency of the attribute values of S. A first information on values in R is based on a sample of values of R. A second information on values in S is based on a sample of values of S. One or more processors then estimate a cardinality of a joined table (T) based on the first and second density distribution function (f(x), g(x)) and the first and second information on values.

Abstract: A server and rack system includes at least one server rack; multiple server slots within the rack; multiple near field communication (NFC) tags; a server located within one of the server slots; an NFC reader within and powered by the server; and an entity that needs to receive locations of servers within racks of the system. Each of the multiple NFC tags is positioned on the rack so as to individually correspond, on a one-to-one basis, with each of the multiple server slots, and each of the NFC tags is programmed with an identifier of the specific rack and slot with which it corresponds, and the NFC reader is positioned such that, when power is supplied to the NFC reader by the server, the NFC reader will read the identifier that corresponds to the slot the server is located within and automatically communicate that identifier to the entity.

Abstract: An approach is provided for an information handling system that includes a processor and a memory to improve the quality of question-answer sets used as inputs to a question-answering (QA) system. In the approach, a question-answer pair is analyzed using natural language processing (NLP) components. Some of the NLP components may be taken from the QA system whose input is being analyzed The question-answer pair includes a question and an answer to the question. Based on the analysis, one or more shortcomings of the question-answer pair are identified. The shortcomings relate to an ability of the target QA system to analyze the question. A human-readable feedback is provided to a user. The feedback recommends one or more possible actions to address the identified shortcomings.

Abstract: Methods, products, apparatuses, and systems may facilitate a conference operation. The conference operation may include conference chaining, conference switching, conference modification, conference announcement, and so on. A collection of authentication data for a plurality of distinct conferences may be performed to chain the conferences. Switching among the distinct conference may be performed in response to a switch key code. The switch key code may include a general key code applicable to each of the conferences and/or a specific key code application to a specific conference.

Abstract: Implementing communications security includes creating levels of permissions for association with inbound communications. The levels of permissions are indicative of components of the communications enabled for transmission to a recipient computer. The communications security also includes creating conditions upon which currently-assigned levels of permissions are adjustable to a next level of the levels of permissions.

Abstract: According to an aspect, passage justification scoring is implemented by a processor executing computer readable instructions. The computer readable instructions include creating a multi-layered neural network from domain knowledge and training the multi-layered neural network with labeled data and unlabeled data. The computer readable instructions further include inputting at least one of an existing passage justification component and raw input data for a question and passage to the multi-layered neural network, extracting concepts determined to have passage justification with respect to a candidate answer contained in a respective passage, and creating a passage justification model from the extracted concepts and from passage justification ground truth.

Abstract: The confidentiality of JavaScript Object Notation (JSON) message data is secured using an encryption scheme. The encryption scheme implements a JSON encryption syntax, together with a set of processing rules for creating encrypting arbitrary data in JSON messages in a platform/language independent manner. A method for encrypting a data item in a JSON message begins by applying an encryption method and a key to the data item to generate a cipher value. A data object is then constructed that represents an encryption of the data item. The data item in the JSON message is then replaced with the data object, and the resulting modified JSON message is then output from a sending entity. At a receiving entity, information in the data object is used to re-generate the data item, which is then placed back in the original message.

Abstract: Systems for constructing hybrid string representations include a string parser configured to parse received string information to produce one or more string components, a database configured to store a set of known concretizations, and a processor configured to compare the one or more string components to the set of known concretizations to determine string components that may be represented concretely, to abstract all string components that could not be represented concretely, and to create a hybrid string representation that includes at least one concrete string component and at least one abstracted string component.

Abstract: A computer identifies a location that is associated with a task, included in a first list of tasks, based on a first information. The computer determines a first travel time from a second location that is associated with a mobile device to the first location based on a second information. The second information indicates an amount of travel time that is associated with a route from the second location to the first location. The computer generates a plurality of permutations of the tasks included in the first list of tasks. The computer selects a permutation from the plurality of permutations based on the first travel time. The computer generates a second list of tasks using the selected permutation. The organization of the tasks included in the second list of tasks reduces the travel time that is required to complete those tasks.

Abstract: Various embodiments detect wireless communication device mobility in a wireless communication network. In one embodiment, one or more Internet Protocol (IP) data packets associated with a wireless communication device are analyzed. The wireless communication device is coupled with the edge entity. A determination is made, based on the analyzing, that the wireless communication device is a newly coupled device at the edge entity. A central entity disposed within the wireless communication network is notified that the wireless communication device is currently coupled to the edge entity.

Abstract: A multi-boundary address protection range is provided to prevent key operations from interfering with a data move performed by a dynamic memory relocation (DMR) move operation. Any key operation address that is within the move boundary address range gets rejected back to the hypervisor. Further, logic exists across a set of parallel slices to synchronize the DMR move operation as it crosses a protected boundary address range.

Abstract: A bus interface selects bit-lanes to allocate as spares by testing the performance margins of individual bit-lanes during initialization or calibration of the bus interface. The performance margins of the individual bit-lanes are evaluated as the operating frequency of the interface is increased until a number of remaining bit-lanes that meet specified performance margins is equal to the required width of the interface. The bit-lanes that do not meet the required performance margins are allocated as spares and the interface can be operated at the highest evaluated operating frequency. When an operating bit-lane fails, one of the spare bit-lanes is allocated as a replacement bit-lane and the interface operating frequency is reduced to a frequency at which the new set of operating bit-lanes meets the performance margins. The operating frequency of the interface can be dynamically increased and decreased during operation and the performance margins evaluated to optimize performance.

Abstract: A resource reservoir is provided. The resource reservoir is a pool of resources that are allocated to and shared between a plurality of reserve virtual machines. A reserve virtual machine of the plurality of reserve virtual machines corresponds to a primary virtual machine from a plurality of primary virtual machines. Each reserve virtual machine of the plurality of reserve virtual machines fulfills a resource requirement from the resource reservoir. The sum of the resources requirements of the plurality of reserve virtual machines is greater than a sum of total resources within the resource reservoir. In response to determining a decrease in performance of the primary virtual machine, at least a portion of workload of the primary virtual machine is applied to the corresponding reserve virtual machine. The resources used by the reserve virtual are indicated as unavailable to the remaining reserve virtual machines from the resource reservoir.

Abstract: A method, system, and/or computer program product monitors a response to a notification of a change to a business process. Criteria for delivery of a notification of a change to a business process are configured. In response to the criteria being met, the notification of the change to the business process is transmitted to a receiving device. The receiving device is monitored for a response to the notification of the change to the business process. In response to detecting no response to the notification of the change to the business process from the receiving device within a predefined amount of time, a corrective instruction is issued to a monitoring device.

Abstract: A tool for contacts management and automated calling. The tool displays, by one or more computer processors, a contact page for adding a contact, wherein the contact page includes at least one conditional flow statement field. The tool program prompts, by one more computer processors, to configure the at least one conditional flow statement field. The tool saves, by one or more computer processors, the contact based on the at least one control flow statement field. The tool initiates, by one or more computer processors, an automated call to the contact based, on the at least one conditional flow statement field. The tool applies, by one or more computer processors, the at least one conditional flow statement field to the automated call to the contact.

Abstract: A stream of tuples are processed by a plurality of processing elements, each including one or more stream operators, operating on computer processors. A method determines whether a first stream operator includes a first operation that is deterministic and whether a second stream operator includes a second operation that is equivalent to the first operation. In response to determining that the first operation is deterministic and the second operation is equivalent to the first operation, the first stream operator is configured to include in a tuple output from the first stream operator a result of performing the first operation using a first input. The second stream operator, which uses a second input when performing the second operation, determines whether the second input is the same as the first input, and uses the result in lieu of performing the second operation when the first and second inputs are the same.

Abstract: A method for managing and rendering one or more information nodes relative to a current focus. The method receives one or more principal topics from an analysis of the information nodes. The method determines a topic vector from a similarity of a first information node to each of the principal topics and a map from the topic vector to a storage location of the first information node. The method determines one or more current topics from a second information node that has been recently accessed by a user and a current focus vector from a similarity of the one or more current topics to the one or more principal topics. The method renders the current focus vector and the first information node according to a rendering algorithm that is applied to the current focus vector and the first information node.

Abstract: A computer employs a set of General Purpose Registers (GPRs). Each GPR comprises a plurality of portions. Programs such as an Operating System and Applications operating in a Large GPR mode, access the full GPR, however programs such as Applications operating in Small GPR mode, only have access to a portion at a time. Instruction Opcodes, in Small GPR mode, may determine which portion is accessed.

Abstract: A method and system for extracting information from a surface coated with a coating containing quantum dots are disclosed. In embodiments, the method comprises charging the quantum dots in the surface coating, scanning the surface to retrieve information from the quantum dots, and processing the retrieved information to identify data encoded in the quantum dots. In embodiments of the invention, the processing includes filtering the retrieved information to adjust the received information based on defined effects of the coating. In embodiments of the invention, the filtering includes filtering the retrieved information to account for chromatic deviation due to the color of the coated surface. In embodiments of the invention, the quantum dots include a plurality of different types of quantum dots, and the processing the retrieved information includes processing the retrieved information to distinguish between the information retrieved from the different types of quantum dots.

Abstract: A data processing system includes physical computing resources that include a plurality of processors. The plurality of processors include a first processor having a first processor type and a second processor having a second processor type that is different than the first processor type. The data processing system also includes a resource manager to assign portions of the physical computing resources to be used when executing logical partitions. The resource manager is configured to assign a first portion of the physical computing resources to a logical partition, to determine characteristics of the logical partition, the characteristics including a memory footprint characteristic, to assign a second portion of the physical computing resources based on the characteristics of the logical partition, and to dispatch the logical partition to execute using the second portion of the physical computing resources.

Abstract: A tool for formally verifying forwarding paths in an information pipeline. The tool creates two logic design copies of the pipeline to be verified. The tool retrieves a first and a second instruction, which have previously been proven to compute a mathematically correct result when executed separately. The tool defines driver input functions for issuing instructions to the two logic design copies. In accordance with the driver input functions, the tool issues instructions to the two logic design copies. The tool abstracts data flow of the two logic design copies to isolate forwarding paths for verification. The tool adjusts for latency differences between the first and second logic design copies. The tool checks a register for results, and when results from of two logic design copies become available in the register, the tool verifies the results to conclusively prove the correctness of all states of the information pipeline.

Abstract: A method for processing a dataset in a partitioned distributed storage system having data stored in a base table and an index stored in an index table, may include receiving base and index table metadata from the partitioned distributed storage system, where the base and index table metadata includes respective table partition information. The method may further include partitioning the dataset into a set of base-delta files according to the base table metadata, and generating a set of index-delta files corresponding with the base-delta files according to the index table metadata. The method may additionally include updating the partitioned distributed storage system with the set of base-delta and the set of index-delta files, where a first update of the base table is synchronous with a second update of the index table.

Abstract: A multi-gate finFET structure and formation thereof. The multi-gate finFET structure has a first gate structure that includes an inner side and an outer side. Adjacent to the first gate structure is a second gate structure. The inner side of the first gate structure faces, at least in part, the second gate structure. A stress-inducing material fills a fin cut trench that is adjacent to the outer side of the first gate structure. An epitaxial semiconductor layer fills, at least in part, an area between the first gate structure and the second gate structure.

Abstract: An apparatus and computer program in a distributed cluster storage network comprises storage control nodes to write data to storage on request from a host; a forwarding layer at a first node to forward data to a second node; a buffer controller at each node to allocate buffers for data to be written; and a communication link between the buffer controller and the forwarding layer at each node to communicate a constrained or unconstrained status indicator of the buffer resource to the forwarding layer. A mode selector selects a constrained mode of operation requiring allocation of buffer resource at the second node and communication of the allocation before the first node can allocate buffers and forward data, or an unconstrained mode of operation granting use of a predetermined resource credit provided by the second to the first node and permitting forwarding of a write request with data.

Abstract: In an approach for authenticating a request for an electronic transaction, a computer receives a request for an electronic transaction on a user account. The computer determines whether the request for the electronic transaction is suspicious, and responsive to determining the request is suspicious, the computer retrieves profile information for the user. The computer determines based on at least the profile information, one or more contacts of the user, wherein the one or more contacts are identified by the user. The computer then determines, based on at least a response from the one or more contacts, whether the request for the electronic transaction is suspicious, wherein determining the request is not suspicious validates authentication of the electronic transaction.

Abstract: A system and computer program product of handling multiple backup processes have been provided. The system comprises receiving one or more instructions initiating a plurality of backup processes from a single source storage volume to a plurality of target storage volumes, adding each target storage volume to a cascade of target storage volumes from the source storage volume, the target storage volumes added to the cascade in an order inversely proportional to the copy rate of the respective backup process such that a first target storage volume added to the cascade of target storage volumes has a slowest copy rate, a next added target storage volume to the cascade of target storage volumes has a faster copy rate than an immediately prior added target storage volume, and a most recent target storage volume added to the cascade of target storage volumes has a fastest copy rate.

Abstract: A method, system and computer program product are provided for implementing dynamic configuration of a Single Root Input/Output Virtualization (SRIOV) virtual function in a virtualized system. A management function, a hypervisor, a hypervisor based PF device driver and a partition based virtual function (VF) device driver are used to implement usage based VF resizing. The management function periodically queries the SRIOV adapter for activity statistics for every assigned virtual function. The management function builds a usage heuristic based on these statistics and calculates VF resource usage based on these statistics. The usage information determines whether VF resources need to be scaled-up or scaled-down. A corresponding resize event is generated and send by the management function to both the hypervisor based PF device driver and partition based VF device driver. Both the PF and VF device drivers scale to the corresponding VF resource of the resize event.

Abstract: A semiconductor device for use in an optical application and a method for fabricating the device. The device includes: an optically passive aspect that is operable in a substantially optically passive mode; and an optically active material having a material that is operable in a substantially optically active mode, wherein the optically passive aspect is patterned to include a photonic structure with a predefined structure, and the optically active material is formed in the predefined structure so as to be substantially self-aligned in a lateral plane with the optically passive aspect.

Abstract: Avoiding data conflicts includes initiating a transactional lock elision transaction containing a critical section, executing the transactional lock elision transaction including the critical section, and checking a status of a lock prior to a commit point in the transactional lock elision transaction executing, wherein the checking the status occurs after processing the critical section. A determination of whether the status of the lock checked is free is made and, responsive to a determination the lock checked is free, a result of the transactional lock elision transaction is committed.

Abstract: In response to detecting a file upload request of a file to a file repository, at least one filename metadata token that includes a subset of characters of a filename of the file is inferred using text analysis techniques. At least one inferred filename metadata token is extracted from the characters of the filename of the file, and is mapped to at least one repository upload processing action. The at least one repository upload processing action is executed in association with the file upload request of the file to the file repository.

Abstract: Arrangements described herein relate to guiding a desired outcome for an electronically hosted conference. During the electronically hosted conference, participant activity related to the electronically hosted conference can be monitored for each of a plurality of participants participating in the electronically hosted conference. Based on the participant activity, a sentiment of each of the plurality of participants with regard to a subject of the electronically hosted conference can be determined. A list of the participants can be presented to a user. The list of the participants can be sequentially ordered, based on the sentiment of each of the plurality of participants, indicating an order in which to poll the participants to achieve the desired outcome for a decision requested of the participants in the electronically hosted conference.

Abstract: One or more processors generate subsets of cluster feature (CF)-trees, which represent respective sets of local data as leaf entries. One or more processors collect variables that were used to generate the CF-trees included in the subsets. One or more processors generate respective approximate clustering solutions for the subsets by applying hierarchical agglomerative clustering to the collected variables and leaf entries of the plurality of CF-trees. One or more processors select candidate sets of variables with maximal goodness that are locally optimal for respective subsets based on the approximate clustering solutions. One or more processors select a set of variables, which produce an overall clustering solution, from the candidate sets of variables.

Abstract: An application is modified during execution by a hotpatch controller of a kernel receiving one or more new versions of a selection of one or more functions of multiple functions of an application and at least one selection criteria for applying the one or more new versions to the application during execution of the application to update a selection of one or more existing versions of the one or more functions. The hotpatch controller selectively transfers control from the selection of one or more existing versions of the one or more functions to the one or more new versions for only a selection of one or more processes that call the selection of one or more existing versions of the one or more functions from among multiple processes of the application, the selection of one or more processes each comprising one or more attributes matching the at least one selection criteria.

Abstract: In a distributed computing environment that includes compute nodes, where the compute nodes execute a plurality of tasks, a lock for resources may be administered. Administering the lock may be carried out by requesting, in an atomic operation by a requesting task, the lock, including: determining, by the requesting task, whether the lock is available; if the lock is available, obtaining the lock; and if the lock is unavailable, joining, by the requesting task, a queue of tasks waiting for availability of the lock.

Abstract: For distributed analysis of time-series data in a smart entity environment, the data is received from a data source in the environment. An overall analysis of the data is distributed to a first node in the environment. In a network operating the environment the first node is at a smaller distance from the data source as compared to a second node. A first portion of the overall analysis is performed on the data at the first node to produce a first conclusion. The first conclusion is routed to the second node. The second node performs a second portion of the overall analysis. Using the first conclusion, from the first node, a first action is caused to occur on a component of the environment. The data source is associated with the component, the data is indicative of a condition in the environment, and the component participates in the condition.

Abstract: A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. One of the selected objects is retrieved in an ordered manner from the snapshot. An object identification (ID) and a state ID are sent to the target destination and used to locate and compare the selected object with a current state of the selected object in the target destination.

Abstract: An embodiment of the invention provides a method for a secure connected digital media platform where a request is received to create a secure partition for accessing a content provider in a digital media device. A security code is received from the content provider. A hypervisor is invoked at the digital media device, where at least part of the hypervisor is comprised of a hardware circuit. The hypervisor compares the received security code with a key value that is burned into a memory unit at the hardware circuit to determine if the security code is from an authorized content provider. If the content provider is determined to be authorized, a secure partition is created at the digital media device. The creation of the secure partition includes creating a memory partition that corresponds to the secure partition in a non-volatile memory at the digital media device.

Abstract: A system, and computer program product for leader device selection in a control cluster using a shared virtual local area network (VLAN) are provided in the illustrative embodiments. A broadcast Hello packet is received from a sender virtual device over the VLAN at a first virtual device. When the first virtual device satisfies a partnership criterion specified in the Hello packet, a first ranking of the first virtual device is evaluated to be higher than a ranking of a sender virtual device. A first Live packet is unicast over the VLAN to the sender virtual device and a leadership role in the control cluster is taken by the first virtual device. The sender virtual device is caused to stop a broadcasting operation at the sender virtual device. A second Hello packet is broadcasted from the first virtual device over the VLAN.

Abstract: Various embodiments manage data flow between at least one wireless communication device and at least one application executing at an edge of the wireless communication network. In one embodiment, a first flow regenerator disposed within the network generates a replicated set of data packets. The replicated set of data packets are a copy of a set of data packets being transmitted between an application disposed on a first node at an edge of the network and a wireless communication device. The first flow regenerator sends the replicated set of data packets to a second flow regenerator disposed in the network. The replicated set of data packets are sent to the second flow regenerator through at least a second node disposed between the first flow regenerator and the second flow regenerator. The second node is configured to perform one or more book-keeping operations on the replicated set of data packets.

Abstract: A new zSeries floating-point unit has a fused multiply-add dataflow capable of supporting two architectures and fused MULTIPLY and ADD and Multiply and SUBTRACT in both RRF and RXF formats for the fused functions. Both binary and hexadecimal floating-point instructions are supported for a total of 6 formats. The floating-point unit is capable of performing a multiply-add instruction for hexadecimal or binary every cycle with a latency of 5 cycles. This supports two architectures with two internal formats with their own biases. This has eliminated format conversion cycles and has optimized the width of the dataflow. The unit is optimized for both hexadecimal and binary floating-point architecture supporting a multiply-add/subtract per cycle.

Abstract: A method for leader device selection in a control cluster using a shared virtual local area network (VLAN) is provided in the illustrative embodiments. A broadcast Hello packet is received from a sender virtual device over the VLAN at a first virtual device. When the first virtual device satisfies a partnership criterion specified in the Hello packet, a first ranking of the first virtual device is evaluated to be higher than a ranking of a sender virtual device. A first Live packet is unicast over the VLAN to the sender virtual device and a leadership role in the control cluster is taken by the first virtual device. The sender virtual device is caused to stop a broadcasting operation at the sender virtual device. A second Hello packet is broadcasted from the first virtual device over the VLAN.