Abstract: A computer-implemented method according to one embodiment includes identifying virtualization unit metadata for each of a plurality of nodes, the virtualization unit metadata including one or more guidelines for an application that is implemented by a virtualization unit, where the one or more guidelines include one or more benefits of a virtualization unit, one or more limitations of the virtualization unit, and one or more operating costs of the virtualization unit; determining, from the plurality of nodes, an optimal node for implementing a computation algorithm based on one or more required computation operations and the virtualization unit metadata for each of the plurality of nodes; and returning an identification of the optimal node.

Abstract: Embodiments herein provide a method for handling communication with a wireless network by a user equipment (UE). The method includes determining that a data inactivity timer has expired during a PS/CS call recovery procedure with a network. The method identifies whether data inactivity that caused the data inactivity timer to expire is due to a radio link failure with the network. A radio link is recovered through the recovery procedure for resuming the PS/CS call with the network, in response to identifying that the data inactivity was due to the radio link failure.

Abstract: A computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, identifying object classification data for objects stored within the plurality of nodes, identifying capability data for each of the plurality of nodes, determining an optimal node for implementing the computation algorithm from the plurality of nodes, based on the object classification data and the capability data, and returning an identification of the optimal node.

Abstract: Providing call continuity for an ongoing call of a User Equipment (UE) of a wireless communication by defining UE behavior specifying actions to be taken by the UE upon detection of occurrence of an event among a plurality of events that may occur during the ongoing call.

Abstract: Methods and systems for file locking are described herein. An on-premise file share may store files that are accessible to both a local on-premise client and a remote off-premise client. The off-premise file share may request to check-out one of the files. In response, one of multiple nodes may obtain for the file a file handle with exclusive write access. File locking information may be stored at the file share that indicates the node that holds the file handle and that indicates the file is in a locked state whereby other remote off-premise clients or local on-premise clients are prevented from editing the file.

Abstract: Delivery blocks are generated to facilitate matching and assigning available delivery resources with expected delivery requirements for a given facility. These delivery blocks are generated by evaluating delivery forecast information for items to be delivered as a function of characterizing information for the delivery resources and delivery parameters corresponding to the given facility. Delivery blocks may include more than one delivery to a given delivery destination and instead may include a plurality of deliveries to various delivery destinations. Should a given delivery block that includes two or more delivery destinations require reassignment, that delivery block can be divided into child blocks that each provide for only a single delivery destination.

Abstract: Methods, systems, and computer program products are provided for performing a secure delete operation in a wide area network (WAN) including a cache site and a home site. A method includes identifying a file for deletion at the cache site, determining whether the file has a copy stored at the home site, detecting a location of the copy at the home site prior to a disconnection event of the cache site from the home site, deleting the file from the cache site during the disconnection event, and in response to the secure deletion of the file not being complete during the disconnection event, indicating on a table a remote inode number assigned to the copy associated with the file at the home site, a name under which the copy is saved, and a list of data chunk tuples specifying selected data of the copy to undergo secure deletion.

Abstract: A computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, determining one or more computation operations required by the computation algorithm, identifying virtualization unit metadata for each of the plurality of nodes, determining, from the plurality of nodes, an optimal node for implementing the computation algorithm based on the one or more computation operations and the virtualization unit metadata for each of the plurality of nodes, and returning an identification of the optimal node.

Abstract: Embodiments herein provide a method for handling communication with a wireless network by a user equipment (UE). The method includes determining that a data inactivity timer has expired during a PS/CS call recovery procedure with a network. The method identifies whether data inactivity that caused the data inactivity timer to expire is due to a radio link failure with the network. A radio link is recovered through the recovery procedure tor resuming the PS/CS call with the network, in response to identifying that the data inactivity was due to the radio link failure.

Abstract: A mechanism is provided in a data processing system comprising at least one processor and at least one memory, the at least one memory comprising instructions which are executed by the at least one processor and configure the processor to implement a file system consistency check utility on an erasure coded object storage architecture. Responsive to the file system consistency check utility determining a directory entry does not exist for a given file inode, the mechanism determines whether the given file is part of an erasure code schema of an object storage architecture. Responsive to the file system consistency check utility determining the given file/fragment is part of the erasure code schema, the mechanism determines a container (parent directory) for the given erasure code fragment, wherein the given fragment is a given error code fragment of an object, based on other erasure code fragments corresponding to the object and their placement schematics in the erasure code schema.

Abstract: The present invention provides a computer implemented method, system, and computer program product of assigning pools of internet protocols to file access protocols for network-attached storage (NAS) failover. In an exemplary embodiment, the present invention includes generating, by a computer system, a pool of internet protocol addresses for each of a plurality of computer file access protocols running on a plurality of protocol node computer systems, where the protocol nodes are configured to access a plurality of computer files stored on a NAS system via computer file access protocol services corresponding to the file access protocols, resulting in IP pools comprising IP addresses, and for each IP pool, among the IP pools, corresponding to a file access protocol among the file access protocols, assigning, by the computer system, the IP addresses in the IP pool to protocol nodes, among the protocol nodes, for which the file access protocol is operational.

Abstract: A method and system for determining implementing a bidding based product delivery determination process is provided. The method includes presenting a product for purchase via a bidding process. Packages including the product are pre-loaded on delivery vehicles for delivery within geographical zones including maximum travel distances. Monetary bids for the product are received from users with respect to the delivery vehicles and a user submitting a highest monetary bid is identified. In response, a first delivery vehicle is directed to a location of the user. A profit sharing process with respect to the users and an entity providing the product is enabled.

Abstract: A computer-implemented method according to one embodiment includes identifying virtualization unit metadata for each of a plurality of nodes, the virtualization unit metadata including one or more guidelines for an application that is implemented by a virtualization unit, where the one or more guidelines include one or more benefits of a virtualization unit, one or more limitations of the virtualization unit, and one or more operating costs of the virtualization unit; determining, from the plurality of nodes, an optimal node for implementing a computation algorithm based on one or more required computation operations and the virtualization unit metadata for each of the plurality of nodes; and returning an identification of the optimal node.

Abstract: Disclosed herein are structures and techniques for exposing circuitry in die testing. For example, in some embodiments, an integrated circuit (IC) die may include: first conductive contacts at a first face of the die; second conductive contacts at a second face of the die; die stack emulation circuitry; other circuitry; and a switch coupled to the second conductive contacts, the die stack emulation circuitry, and the other circuitry, wherein the switch is to couple the second conductive contacts to the other circuitry when the switch is in a first state, and the switch is to couple the die stack emulation circuitry to the other circuitry when the switch is in a second state different from the first state.

Abstract: A computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, identifying object classification data for objects stored within the plurality of nodes, identifying capability data for each of the plurality of nodes, determining an optimal node for implementing the computation algorithm from the plurality of nodes, based on the object classification data and the capability data, and returning an identification of the optimal node.

Abstract: A computer-implemented method according to one embodiment includes receiving a computation algorithm to be implemented by one of a plurality of nodes, identifying object classification data for objects stored within the plurality of nodes, identifying capability data for each of the plurality of nodes, determining an optimal node for implementing the computation algorithm from the plurality of nodes, based on the object classification data and the capability data, and returning an identification of the optimal node.

Abstract: An efficient cloning mechanism is provided for a distributed storage environment, where, for example, a private cloud computing environment and a public cloud computing environment are included in a hybrid cloud computing environment (on-premise object storage to off-premise computation resources), to improve computation workloads. The disclosed algorithm forms an efficient cloning mechanism in a hybrid storage environment where the read/write speed of data from the disk is not limited by its angular velocity.

Abstract: A method performed in a portable computing device for intelligently performing audio playback, upon connecting with an audio output system. The portable computing device detects that a connection is made with an audio output system. The portable computing device determines a first audio playback application that last played audio and when the first audio playback application last played audio. If the first audio playback application played audio within a specified amount of time in the past, then the portable computing device signals that audio playback be performed from the first audio playback application (through the connection made with the audio output system.

Abstract: An efficient cloning mechanism is provided for a distributed storage environment, where, for example, a private cloud computing environment and a public cloud computing environment are included in a hybrid cloud computing environment (on-premise object storage to off-premise computation resources), to improve computation workloads. The disclosed algorithm forms an efficient cloning mechanism in a hybrid storage environment where the read/write speed of data from the disk is not limited by its angular velocity.

Abstract: A mechanism is provided for optimizing object storage workflow. A category of a computational algorithm received from a user of a client device is identified, the category identifying a set of features that are optimal for executing the computational algorithm and comprising hardware, operating system type, operating system version, and virtualization technology. Features associated with a plurality of nodes in a plurality of infrastructures in an object storage architecture are searched for at least one node that has the set of features identified by the category of the computational algorithm. Responsive to identifying a node that has the set of features identified by the category of the computational algorithm, a determination is made as to whether resources associated with the node are immediately available. Responsive to the resources associated with the node being immediately available, the computational algorithm is issued to the node for execution.