Abstract: The present invention relates to a device (10) for use in improving a user interaction with a user interface application. It is described to provide (210) data for a user, the data comprising interaction data of the user with a plurality of interaction fields of a first version of a user interface application. The interaction data is clustered (220) into a plurality of groups. The interaction data is analysed (230) to determine the contribution a specific user interaction field of the plurality of interaction fields makes to a specific group of the plurality of groups. The specific user interaction field is modified (240) on the basis of the determined contribution the specific user interaction field makes. A second version of the user interface application is displayed (250) comprising the modified specific user interaction field.

Abstract: A code lineage tool includes a scanner, a parser, and an integrator. The scanner identifies a plurality of elements in software code. The parser determines that a value of a first element is affected by a second element and a third element. The parser adds the first element to a parse tree and adds the second and third elements to the parse tree as sub-nodes of the first element. The parser determines that a value of the second element is affected by a fourth element and adds the fourth element to the parse tree as a sub-node of the second element. The integrator determines that a change to the fourth element will change the value of the first element and the value of the second element and generates a lineage for the first element.

Abstract: A code lineage tool includes a scanner, a parser, and an integrator. The scanner identifies elements in ETL code. The parser determines that a first element is affected by a second element and adds the first element to a parse tree and the second element to the parse tree as a sub-node of the first element. The parser determines that the second element is affected by a third element and adds the third element to the parse tree as a sub-node of the second element. The parser determines that a fourth element does not affect the first element and prevents the fourth element from being added to the parse tree or removes the fourth element from the parse tree. The integrator determines that a change to the third element will change the value of the first element and generates a lineage for the first element.

Abstract: Methods of compiling source code are provided. A method includes identifying a first array of structures (AOS), having a plurality of array elements, each array element being a structure with a plurality of fields, and performing structure peeling on the first AOS to convert a data layout of the first AOS to an array of structure of arrays (AOSOA) including a plurality of memory blocks of uniform block size. At least one of the plurality of memory blocks is allocated for each field of the plurality of fields. The method further includes allocating a number of complete memory blocks to accommodate all of the plurality of array elements of the AOS.

Abstract: In one aspect, there is provided a method. The method may include loading, into a first address space of a primary server of a database, a metadata library of an application function library. The application function library may include an application function for performing operations on data held at the database. The metadata library may include a description of the application function. The primary server may determine, based on the metadata library, that executing a database query requires running the application function. The database query may be routed, based on the determination, to a secondary server of the database. The database query may be routed to trigger a loading the application function library into a second address space of the secondary server. Related methods and articles of manufacture are also provided.

Abstract: The present application provides a mobile terminal application update method and device. An offline compressed package that includes one or more files having one or more file types is received by a computing device from a server over a network. The offline compressed package is decompressed by the computing device into a decompressed package that includes the one or more files. A file type of each file included in the decompressed package is identified by the computing device. Each file included in the decompressed package is sent to a particular container associated with the identified file type of the file. The particular container is included in a plurality of containers each associated with a particular file type. The particular container is configured to execute the file to perform an update action on the computing device.

Abstract: The technology disclosed relates to sub-clustering within service clusters in real-time. In particular, it relates to accessing a network topology that records node data and connection data including processes running on numerous hosts grouped into local services on the hosts, the local services running on multiple hosts grouped into service clusters and sub-clusters of service clusters, and network connections used by the service clusters to connect the hosts grouped into service connections, wherein the node data includes software versions of the processes and process data with configuration files and clustering the multiple hosts with the service clusters into the sub-clusters based at least in part on the software versions.

Abstract: Aspects of the subject disclosure may include, for example, a first network device receiving from a second network device a software, the first network device adjusting operations at the first network device according to the software, the first network device providing a digital signature to the software to generate an adjusted software where the digital signature indicates that the first network device has received the software, and the first network device transmitting, to a third network device, the adjusted software. Other embodiments are disclosed.

Abstract: Systems and methods for failsafe firmware upgrades in accordance with embodiments of the invention are disclosed. One embodiment includes a vehicle telematics device, including: a processor; and a firmware memory comprising a firmware image coupled to the processor, wherein the firmware image further comprise a first segment and a second segment; wherein a primary bootloader application located in the firmware image: verifies the integrity of the first segment; verifies the integrity of the second segment; selects a firmware image contained in the firmware memory using a failsafe process; and—boots the vehicle telematics device using the selected firmware image.

Abstract: One or more embodiments provide techniques for processing a request entering a node cluster managed by a control plane executing on a computing service. A first node of the node cluster receives a request for a service. The first node determines to which service object in the first node to route the request. The first node identifies an existing version of the service executing thereon. The first node determines whether there exists an updated version of the service executing thereon. Upon determining that the updated version of the service does exist, the first node sets the existing version of the service as the current version of the services. The node routes the request to a first service object associated with the current version of the service using a handler of the first service object.

Abstract: An apparatus and associated method are provided for application deployment assessment. In use, a plurality of deployment parameters associated with one or more applications, and a workload profile are received. Further, an application deployment specification is generated, based on the workload profile and the deployment parameters. Still yet, a type of one or more orchestrators on one or more systems is identified. The application deployment specification is processed, based on the identified type of the one or more orchestrators on the one or more systems. Further, the one or more processors execute the instructions to deploy, via an application program interface (API), the one or more applications to the one or more orchestrators on at least one of the one or more systems, and at least one workload generator to at least one of the one or more systems, utilizing the processed application deployment specification. Operational data is collected from one or more monitoring agents on the one or more systems.

Abstract: A semiconductor device including a first processor having a first register, the first processor configured to perform region of interest (ROI) calculations using the first register; and a second processor having a second register, the second processor configured to perform arithmetic calculations using the second register. The first register is shared with the second processor, and the second register is shared with the first processor.

Abstract: Adder trees may be constructed for efficient packing of arithmetic operators into an integrated circuit. The operands of the trees may be truncated to pack an integer number of nodes per logic array block. As a result, arithmetic operations may pack more efficiently onto the integrated circuit while providing increased precision and performance.

Abstract: An apparatus causes a management unit included in an arithmetic processing unit to manage, where an executable task is included in a queue, execution of the task. The apparatus causes a standby unit included in the arithmetic processing unit to execute, when the executable task is not included in the queue, a decision process for deciding, by polling, whether information from another apparatus different from the apparatus is received by a communication controller until the executable task is included in the queue.

Abstract: A method of training a computer program to recognize software application controls includes: providing a controller and a memory coupled to the controller, wherein the controller is configured to: receive a plurality of images of one or more GUIs of one or more software applications, analyze the one or more GUI images via an image recognition algorithm to identify a position and associate a function for each of one or more user input controls found in the images, generate a set of execution instructions including the identified position of the input controls and their associated functions, test the accuracy of the execution instruction by executing the identified input controls in the one or more software applications and analyze one or more images captured to show the results of the execution.

Abstract: Embodiments of the present invention provide a system for balancing a global completion table (GCT) in a microprocessor via frontend steering or stalls. A non-limiting example of the system includes an instruction dispatch unit (IDU) that includes an instruction queue and the system includes an instruction sequencing unit (ISU) that includes a GCT having a first area and a second area. The IDU is configured to determine whether a full group of instructions exist in the instruction queue and to determine whether additional instructions will be received by the instruction queue in a subsequent cycle. The IDU is configured to stall the instruction queue for at least one cycle until a full group of instructions is accumulated at the instruction queue upon determining that additional instructions will be received by the instruction queue in subsequent cycle.

Abstract: Converting program instructions for two-stage processors including receiving, by a preprocessing unit, a group of program instructions; determining, by the preprocessing unit, that at least two of the group of program instructions can be converted into a single combined instruction; converting, by the preprocessing unit, the at least two program instructions into the single combined instruction comprising an extension opcode, wherein the extension opcode indicates, to an execution unit, a format of the single combined instruction; and sending, by the preprocessing unit, the single combined instruction to the execution unit.

Abstract: A computer processing system is provided. The computer processing system includes a processor configured to crack a Move-To-FPSCR instruction into two internal instructions. A first one of the two internal instructions executes out-of-order to update a control field and a second one of the two internal instructions executes in-order to compute a trap decision.

Abstract: Converting program instructions for two-stage processors including receiving, by a preprocessing unit, a group of program instructions; determining, by the preprocessing unit, that at least two of the group of program instructions can be converted into a single combined instruction; converting, by the preprocessing unit, the at least two program instructions into the single combined instruction comprising an extension opcode, wherein the extension opcode indicates, to an execution unit, a format of the single combined instruction; and sending, by the preprocessing unit, the single combined instruction to the execution unit.

Abstract: A point cloud rendering method and apparatus for real-time point cloud data collection from a variety of sensor types is provided that delivers enhanced performance including reducing processing requirements, limiting local memory consumption and optimizing overall data visualization.

Abstract: Embodiments of the present disclosure relate to processing a microprocessor instruction by receiving a microprocessor instruction for processing by a microprocessor, and processing the microprocessor instruction in a multi-cycle operation by acquiring a unit of data having a plurality of ordered bits, where the acquiring is performed by the microprocessor during a first clock cycle, and shifting the unit of data by a number of bits, where the shifting is performed by the microprocessor during a second clock cycle subsequent to the first clock cycle.

Abstract: Embodiments of the present disclosure relate to processing a microprocessor instruction by receiving a microprocessor instruction for processing by a microprocessor, and processing the microprocessor instruction in a multi-cycle operation by acquiring a unit of data having a plurality of ordered bits, where the acquiring is performed by the microprocessor during a first clock cycle, and shifting the unit of data by a number of bits, where the shifting is performed by the microprocessor during a second clock cycle subsequent to the first clock cycle.

Abstract: Embodiments of the present disclosure relate to processing a microprocessor instruction by receiving a microprocessor instruction for processing by a microprocessor, and processing the microprocessor instruction in a multi-cycle operation by acquiring a unit of data having a plurality of ordered bits, where the acquiring is performed by the microprocessor during a first clock cycle, and shifting the unit of data by a number of bits, where the shifting is performed by the microprocessor during a second clock cycle subsequent to the first clock cycle.

Abstract: A computer processing system is provided. The computer processing system includes a processor configured to crack a record form FP instruction into two internal instructions. A first one of the two internal instructions executes out-of-order to compute a target FP register and a second one of the two internal instructions executes in-order to compute a condition register (CR) to improve a processing speed of the record form FP instruction.

Abstract: A computer processing system is provided. The computer processing system includes a processor configured to crack a record form FP instruction into two internal instructions. A first one of the two internal instructions executes out-of-order to compute a target FP register and a second one of the two internal instructions executes in-order to compute a condition register (CR) to improve a processing speed of the record form FP instruction.

Abstract: An apparatus comprising: a set of registers; and mapping circuitry to perform a mapping operation to map each of a set of register specifiers to a respective register from among the set of registers in dependence on a mapping function. The mapping function is dependent on a key value. In addition, the mapping for at least two register specifiers from among the set of register specifiers is dependent on the same key value.

Abstract: Cognitive management of application request processing in a multi-threading application server environment is provided by, in part, obtaining multiple threads based on receiving multiple application execution requests, and determining whether to consolidate processing of at least two threads of the multiple threads based on one or more specified characteristics related to processing of the at least two threads. Based on determining to consolidate processing, the cognitive management approach includes pausing the at least two threads and generating a consolidated thread to determine a common result for the at least two paused threads. Thereafter, execution of the at least two threads is resumed using the common result provided by processing of the consolidated thread. In one embodiment, the at least two threads may be at least two request-level threads, while in another the threads may be at least two method-level threads.

Abstract: A computer-implemented method, for booting a computer system, that provides a list with entries of startup processes. Each startup process defines a resource of the computer system. For each startup process a requirement is defined. The method further comprises fetching one of the entries of the list with entries of startup processes; determining whether the requirement is satisfied for the one of the entries of the list with entries of startup processes; fetching, in case the requirement is not fulfilled, a next one of the entries of the list with entries of startup processes; starting, in case the required resource is fulfilled, the startup process; and repeating the fetching a next one of the entries, the determining and the starting until all startup processes of the list of startup processes have been started.

Abstract: A computer-implemented method, for booting a computer system, that provides a list with entries of startup processes. Each startup process defines a resource of the computer system. For each startup process a requirement is defined. The method further comprises fetching one of the entries of the list with entries of startup processes; determining whether the requirement is satisfied for the one of the entries of the list with entries of startup processes; fetching, in case the requirement is not fulfilled, a next one of the entries of the list with entries of startup processes; starting, in case the required resource is fulfilled, the startup process; and repeating the fetching a next one of the entries, the determining and the starting until all startup processes of the list of startup processes have been started.

Abstract: Embodiments of the disclosure provide a method and apparatus for controlling a startup bootstrap program of an intelligent TV set, and relate to the field of an embedded system so as to shorten a period of time for startup boot while initializing a screen normally. In the disclosure, after a system is powered on, a first task of initializing a screen in a startup bootstrap program is executed, and the length of preset time required for executing the first task is obtained, wherein the startup bootstrap program is a bootstrap program for initializing pieces of software/hardware of the system; executing a second initialization task unrelated to initializing the screen in the startup bootstrap program is executed while the first task is being executed, thus addressing the problem in the related art.

Abstract: A method, apparatus and computer program product are provided for serializing and de-serializing objects such that data may be transmitted between disparate systems otherwise having incompatible object definitions. The disparate systems may include different versions of the same system or completely different systems. Object graphs may be recursively broken down into primitive components, and the data may be reformatted as maps of primitive data chained together. The data may be transmitted to a disparate recipient system and reassembled into objects recognizable by the disparate recipient system. Various systems can then communicate with each other regardless of underlying data formats.

Abstract: A customer self-help system employs artificial intelligence to generate personalized self-help content that is responsive to a user query submitted to the customer self-help system, according to one embodiment. The customer self-help system includes a pre-processor that characterizes and categorizes the self-help content into self-help content components, by using one or more content processing algorithms (e.g., a natural language processing algorithm), according to one embodiment. The customer self-help system includes an intent extractor engine that determines characteristics of the user query based on the user query and user profile data, according to one embodiment. The customer self-help system aggregates portions of the self-help content components into a personalized self-help content by matching characteristics of the user query with characteristics of the self-help content, according to one embodiment.

Abstract: In various example embodiments, a system and method for transforming instructions for collaborative updates are described herein. A group of instructions for an update of an element depicted in a client device version of a user interface are generated. The group of instructions is executed and the group or a subset of instructions are transmitted to a server. The server accepts or rejects the instructions. The server may execute the instructions to update a server version of the element. The server sends accepted instructions to the other or all client devices.

Abstract: Disclosed herein is a virtual laboratory assistant platform enabled to provide researchers, science educators, industry professionals, and scientists in the clinical, industrial, or laboratory setting access to information and data, a digital footprint of laboratory activities, and insights into laboratory activities based on the digital footprint.

Abstract: Embodiments of apparatuses and methods for processing virtualization events in a layered virtualization architecture are disclosed. In one embodiment, an apparatus includes a hardware processor including event circuit to recognize a virtualization event, and evaluation circuit to determine whether to transfer control of the apparatus from a child guest to a parent guest in response to the virtualization event, wherein the child guest and the parent guest each include a bit per virtualization event to indicate whether the parent guest is to gain control when the virtualization event occurs.

Abstract: In an aspect of the disclosure, a method, a computer-readable medium, and an apparatus for managing a plurality of VDI systems are provided. The apparatus broadcasts or multicasts, at a first VDI system of the plurality of VDI systems, a message including a first key uniquely associated with the first VDI system and a first network locator for locating the first VDI system in a network. The apparatus further receives, from a second VDI system of the plurality of VDI systems, a web service request including the first key, a second key uniquely associated with the second VDI system, a second network locator for locating the first VDI system in the network, and operation information of the second VDI system.

Abstract: A hybrid account logon is disclosed for logging into remote desktops. In one embodiment, the hybrid logon combines local and domain accounts by building a local primary access token which provides credentials for local and domain-based accounts. In one embodiment, a credentials provider creates a serialized structure including both local account information and domain credentials and sends the serialized structure to a logon user interface (UI) process. The logon UI process calls a user authentication service that itself calls a hybrid authentication package which performs a domain logon, discards any identity associated with the domain logon session, and builds a local identity for the local account. The user authentication service then generates a primary access token including the local identity and the domain logon session data, thereby supporting interactive logon based on the local user identity which is also linked to network credentials for use in accessing network resources.

Abstract: A technique for placing virtual computing instances in hosts in a data center to improve capacity and scalability in the network connecting the hosts in the data center. The network is viewed in regard to the physical placement of the servers and resource slots the servers have for supporting virtual computing instances and in regard to the communication traffic between virtual computing instances supported by the servers. A management system collects the resource slots into slot clusters based on their physical location and the virtual computing instances into virtual computing instance clusters based on communication traffic between pairs of virtual computing instances. The management system then maps the virtual computing instance clusters to the slot clusters to determine their physical placement in the network.

Abstract: A technique for recovering from a hang in a virtualized accelerated processing device (“APD”) is provided. In the virtualization scheme, different virtual machines are assigned different “time-slices” in which to use the APD. When a time-slice expires, the APD stops operations for a current VM and starts operations for another VM. To stop operations on the APD, a virtualization scheduler sends a request to idle the APD. The APD responds by completing work and idling. If one or more portions of the APD do not complete this idling process before a timeout expires, then a hang occurs. In response to the hang, the virtualization scheduler informs the hypervisor that a hang has occurred. The hypervisor performs a function level reset on the APD and informs the VM that the hang has occurred. The VM responds by stopping command issue to the APD and re-initializing the APD for the function.

Abstract: Techniques for providing a hyper-converged computing device with an integrated central virtualization switch is disclosed. In one embodiment, the hyper-converged computing device includes a server comprising at least one central processing unit (CPU), memory, and storage, a central virtualization switch integrated with the server, a virtualization application to manage virtual machines hosted by the hyper-converged computing device, and a hyper-converged application to manage the hyper-converged computing device. The hyper-converged application is to appropriately route data associated with an exclusive communication between the virtual machines and peripheral devices through the central virtualization switch that is integrated with the server.

Abstract: Some embodiments provide method for implementing a logical router of a logical network. The method receives a configuration for a first logical router. The configuration includes a static route for the first logical router. The method defines several routing components with separate routing tables for the logical router. The method adds a first route, having a first static route type, for the static route to the routing tables of at least a first subset of the routing components. Based on the connection of a second logical router to the first logical router, adding a second route, having a second static route type, to the routing tables of at least a second subset of the routing components.

Abstract: Embodiments of the invention are generally related to configuring a system for use with a media application, including providing task-based configuration for users of the media application. In accordance with an embodiment, the system enables a user to interact with a configuration component of a media application accessible at a media device. The system displays a plurality of tasks and an indication of a media application functionality, such as, for example, access to a personalized playlist or set of media content, offered as an incentive or reward for completion of the tasks, at a user interface of the media device. The tasks relate to one or more features of the media application, and can be used to improve the configuration of the media application for a particular user.

Abstract: Tasks in a cloud computing environment can be managed using multiple orchestration tools. For example, a request to perform a particular task in a cloud computing environment can be received. A database that includes relationships between multiple orchestration tools and characteristics of the multiple orchestration tools can be accessed. A first orchestration tool can be selected from the database based on a first characteristic related to the first orchestration tool in the database. The first orchestration tool can be capable of performing a first part of the particular task. A second orchestration tool can be selected from the database based on a second characteristic related to the second orchestration tool in the database. The second orchestration tool can be capable of performing a second part of the particular task. The particular task can be performed in the cloud computing environment using the first orchestration tool and the second orchestration tool.

Abstract: A job assignment apparatus includes a processor configured to perform assignment of a first job to a first arithmetic device and a second arithmetic device in such a way that data is transmitted in a first direction, the first job being processed in a process algorithm in which a plurality of arithmetic devices sequentially transmit data, the first arithmetic device being connected to the second arithmetic device via a first switch and a second switch, the first direction being a direction from the first switch to the second switch, and perform assignment of a second job to a third arithmetic device and a fourth arithmetic device in such a way that data is transmitted in a second direction, the third arithmetic device being connected to the fourth arithmetic device via the first switch and the second switch, the second direction being a different direction from the first direction.

Abstract: Systems, apparatuses, and methods for predicting page migration granularities for phases of an application executing on a non-uniform memory access (NUMA) system architecture are disclosed herein. A system with a plurality of processing units and memory devices executes a software application. The system identifies a plurality of phases of the application based on one or more characteristics (e.g., memory access pattern) of the application. The system predicts which page migration granularity will maximize performance for each phase of the application. The system performs a page migration at a first page migration granularity during a first phase of the application based on a first prediction. The system performs a page migration at a second page migration granularity during a second phase of the application based on a second prediction, wherein the second page migration granularity is different from the first page migration granularity.

Abstract: A network service infrastructure management system includes a computing system that communicates with a network service computing device to receive a request to generate a network service comprising one or more network node functions. Based on the request the computing system communicates with an operating system of the network service computing device to instantiate one or more tasks corresponding to the one or more network node functions in which each task is instantiated at a level of workload capability specified for its respective network node function. Once instantiated, the computing system may then launch each network node function on its respective task.

Abstract: A parallel processing control device includes a processor that acquires path status information indicating a communication status of each path connecting between compute nodes. The processor acquires free memory information indicating a status of memory usage in each compute node. The processor determines, when a new job is input, a save target job from among jobs processed by at least a part of the compute nodes. The processor determines, by evaluating data transfer from the respective compute nodes to respective acceptable nodes based on the free memory information and the path status information, destination nodes and a size of data to be transferred between respective pairs of one source node and one destination node. The acceptable nodes are compute nodes having a free memory. The destination nodes are compute nodes to which a part of data of the save target job is to be transferred from the respective source nodes.

Abstract: Given a sequential resource allocation system (RAS) topology structure, a state space, called an impulse state space, corresponding to the impulse response of a linear time-invariant system (LTS), is computed by small enough configuration of the considered RAS. Given an initial resource configuration of a RAS which corresponds to an input of an LTS, a complete state enumeration can be obtained by defining the convolution of this configuration with the pre-computed impulse state space. One example embodiment reduces central processing unit (CPU) time to process instructions that compute a target state space of a RAS includes constructing an initial RAS and an initial state space, and extending the initial state space iteratively under a target resource configuration.

Abstract: Embodiments facilitate the efficient handling of service requests by a Platform-as-a-Service (PaaS) infrastructure. The platform may comprise a central controller communicating with a plurality of execution agents on one or more hosts. The central controller may parse client requests manipulating application state (e.g., scale, start, stop app, clear) into a sequence of fine-grained instance requests (e.g., start, stop, stop all, clear) that are distributed to the application program interfaces (API) of execution agents on the platform. The central controller may assign a priority to the fine-grained requests. The priority may take into consideration one or more factors including but not limited to: request creator (user, system); operation type (start, stop, stop all, clear); instance number; sequence number of the fine grained request within the original received request; hierarchy level (organization, space); and application.

Abstract: In a computer-implemented method for managing resource allocation of a managed system, responsive to a request by a consumer node, an owner node of a plurality of owner nodes that controls resource allocations from the pool of resources is determined, where the resource is associated with a data object. A resource is allocated from a pool of resources comprising a plurality of resources by the owner node. An allocation marker corresponding to the resource is created. The resource and the allocation marker are made available for retrieval by the consumer node.