Abstract: A particular portion of a program which can be read from on-disk representations of the program as well as from memory images of the program is identified for use as a version discriminator. A first representation of the portion may be obtained from a first memory image of the program, corresponding to a first running instance of the program. The first representation may be compared to a second representation obtained at a development environment. Based on the results of the comparison, a particular version of the program corresponding to the first running instance may be identified. An indication of the particular version may be stored.

Abstract: The present disclosure relates to a method of scheduling messages to be exchanged between tiles in a computer where there is a fixed transmission time between sending and receiving tiles. According to the method a total size of message data to be sent or received by each tile is determined. One of the tiles is selected based at least on the size of the message data to schedule a first message. The first message to be scheduled is selected from the set of messages on that tile. In order to schedule the message the other end points of this selected message are determined, and then respective time slots are allocated at the sending and receiving tiles for that message. The size of the selected message is then deducted from each of the tiles acting as end points for the message, and then the sequence is carried out again until all messages have been scheduled. This technique optimises message exchange in an exchange phase of a BSP system.

Abstract: A middleware at a proxy node may cause a copy of a data object stored on a storage node to be updated. Copies of the data object may be stored on a plurality of storage nodes located in first and second geographic locations. A first processing activity for a storage node that corresponds with the application category of the data object may be determined. A first storage node may be selected for a first update based on being associated with the first processing activity in a first proportion. The copy of the data object stored at the first storage node may be updated before updating a copy of the data object stored at a second storage node. The second storage node may be associated with the first processing activity in a second proportion, with the second proportion being less than the first proportion.

Abstract: Methods and apparatus for implementing a promotion offer language architecture for representing offer. The promotion offer language architecture includes at least an offer type field and an offer expression field. The offer type field pertains to the type of offer. The offer expression field pertains to identification of items that the offer applies to and/or the condition required to receive the benefits of the offer type. The item is identified by a quantity and a product identification.

Abstract: Systems and methods for scheduling an instruction list for parallel processing tasks are provided. An exemplary method includes obtaining an instruction set in the instruction list to be scheduled and determining data dependencies among instructions in the instruction set by performing a data dependency analysis on the instruction set. The method also includes obtaining, based on the data dependencies, selection nodes for performing instruction selections during the scheduling of the instruction list. The method further includes determining, based on a preset rule, an order of instructions in a scheduled instruction list according to a corresponding order of the selection nodes.

Abstract: A device may receive input data identifying user stories, test case documents, event logs, and application logs associated with an application, and may perform natural language processing on the user stories and the test case documents, identified in the input data, to generate a first state diagram associated with the application. The device may process the event logs identified in the input data, with a heuristic miner model, to generate a second state diagram associated with the application, and may process the application logs identified in the input data, with a clustering model, to generate a volumetric analysis associated with the application. The device may perform post processing of the first state diagram, the second state diagram, and the volumetric analysis, to remove duplicate data and unmeaningful data and to generate modified outputs, and may perform actions based on the modified outputs.

Abstract: An apparatus and method for efficiently processing invariant operations on a parallel execution engine.

Abstract: The present invention relates to a ship data consolidated management method and a device for same. Accordingly, the present invention relates to a ship data consolidated management method and device, the method being characterized by comprising the steps of: collecting ship data from at least one piece of ship equipment; converting the ship data to a certain data format; and transmitting the converted ship data to an external device.

Abstract: Methods, computer program products, and systems for Robotic Process Automation (RPA) upgrade of an application are provided. A first mapping indicating relationships between UI elements in a first version of the application and UI elements in a second version of the application and a second mapping indicating relationships between one or more UI elements in a first version of an RPA code corresponding to the first version of the application and UI elements in the first version of the application are respectively obtained. A third mapping indicating relationships between the one or more UI elements in the second version of the application and one or more UI elements in a second version of the RPA code corresponding to the second version of the application is determined and based on which the second version of the RPA code corresponding to the second version of the application is generated.

Abstract: In implementations of the subject matter described herein, a new approach for presenting a response to a message in a conversation is proposed. Generally speaking, in response to receiving a message in a conversation, the received message will be matched with one or more documents on the sentence basis. That is, the received message is compared with the sentences from a document(s), rather than predefined query-response pairs. In this way, a whole sentence may be selected from the document as a candidate response. Then the suitability of this sentence with respect to the ongoing conversation will be determined, and the response will be generated and rendered in an adaptive way based on the suitability. As a result, the user experiences may be significantly enhanced in the chatbot scenario.

Abstract: Data conversion circuitry receives structured records including normalized data and performs a data conversion process on the structured records to generate unstructured records including unstructured syntax. The data conversion circuitry performs the data conversion process according to an unstructured syntax requirement including a syntax field mapping between the structured records and the generated unstructured records.

Abstract: Apparatus and methods are disclosed for selection of characters from an electronic user interface. In one embodiment, a letter selection interface displays letters in a row, some of which are recordable by an input interpreter and others that are unrecordable. In one embodiment, unrecordable letters visually separate letters that are both (1) recordable, and (2) assigned to different but adjacent selection buttons. In response to received touch-screen activations, an interpreter records recordable letter selections and a display displays both recordable and unrecordable letter selections. The interpreter composes a sequence of the recorded letters. An algorithm identifies alternatives to the recorded sequence by editing one or more letters of the sequence, such that each edit changes a selected letter to an adjacent unrecordable letter. The algorithm outputs words that match the originally composed sequence or one of the identified alternatives.

Abstract: An information processing apparatus includes a storage unit storing a predetermined application, a management unit managing information on a service provided by the application, a service registration unit registering, when receiving data used to register the service from another apparatus, the service by a process of the application in accordance with the data, a generation unit generating information on the service registered by the service registration unit, and an updating unit updating the information which is generated by the generation unit and which is managed by the management unit.

Abstract: A process for processor testing includes dividing a memory space into first and second portions and generating first and second sets of test instructions for the respective first and second portion. The first and second sets each include a plurality of counter increment/branch instruction pairs where each branch instruction of the first set branches to a backward instruction location and each branch instruction of the second set branches to a forward instruction location.

Abstract: An information processing apparatus, method, and non-transitory recording medium storing instructions for executing an information processing method are provided. The information processing apparatus controls installation of a first program corresponding to a first program execution environment and controls installation of a second program corresponding to a second program execution environment in response to a request from the first program.

Abstract: A reinforcement learning system comprises an environment (having multiple possible states), and agent, and a policy learner.. The agent is arranged to receive state information indicative of a current environment state and generate an action signal dependent on the state information and a policy associated with the agent, where the action signal is operable to cause an environment-state change. The agent is further arranged to generate experience data dependent on the state information and information conveyed by the action signal. The policy learner is configured to process the experience data in order to update the policy associated with the agent. The reinforcement learning system further comprises a probabilistic model arranged to generate, dependent on the current state of the environment, probabilistic data relating to future states of the environment, and the agent is further arranged to generate the action signal in dependence on the probabilistic data.

Abstract: Techniques described herein relate to facilitating end-to-end multilingual communications with automated assistants. In various implementations, speech recognition output may be generated based on voice input in a first language. A first language intent may be identified based on the speech recognition output and fulfilled in order to generate a first natural language output candidate in the first language. At least part of the speech recognition output may be translated to a second language to generate an at least partial translation, which may then be used to identify a second language intent that is fulfilled to generate a second natural language output candidate in the second language. Scores may be determined for the first and second natural language output candidates, and based on the scores, a natural language output may be selected for presentation.

Abstract: A computing device includes a persistent storage and a processor. The persistent storage includes an asset. The processor obtains a computation request for the asset, instantiates an executable entity based on a computation prototype and a manifest associated with the asset, performs the computation request using the instantiated executable entity and metadata specified by the manifest associated with the asset to obtain a computation result; and provides the obtained computation result.

Abstract: A compiler device includes: a processor configured to: when a first register is allocated to first and second spill instructions, which refer to same data in a memory, of an instruction sequence and to a first section between the first and second spill instructions, search for a second register that is a candidate allocated to the first section instead of the first register; when a second section allocated with the second register and the first section do not overlap, allocate the second register to the first section instead of the first register; when the first and second sections overlap, allocate a third register to the second section instead of the second register, and then allocate the second register to the first section instead of the first register; and thereafter, delete an instruction executed later than the other instruction of the first and second spill instructions.

Abstract: Technologies for monitoring network traffic include a computing device that monitors network traffic at a graphics processing unit (GPU) of the computing device. The computing device manages computing resources of the computing device based on results of the monitored network traffic. The computing resources may include one or more virtual machines to process network traffic that is to be monitored at the GPU the computing device. Other embodiments are described and claimed.

Abstract: A computer-based system and related method are provided for migrating data associated with a website from a first Web content management (WCM) platform to a second WCM platform. The data migrated can include templates, user and group data files, content files (media, texts and others), workflows, authorizations, among others. The system and related method can further include a transformation capability that enables modifications to website data elements during migration, including but not limited to templates, HTML, users, metadata, file assets, and content such as images, links, and text during migration. In this manner, web administrators can modify the website design during migration to a new WCM platform within an integrated process.

Abstract: In some aspects, a heterogeneous computing system includes a quantum processor unit and a classical processor unit. In some instances, variables defined by a computer program are stored in a classical memory in the heterogeneous computing system. The computer program is executed in the heterogeneous computing system by operation of the quantum processor unit and the classical processor unit. Instructions are generated for the quantum processor by a host processor unit based on values of the variables stored in the classical memory. The instructions are configured to cause the quantum processor unit to perform a data processing task defined by the computer program. The values of the variables are updated in the classical memory based on output values generated by the quantum processor unit. The classical processor unit processes the updated values of the variables.

Abstract: A system and method for defending an application configured to invoke anonymous functions. The method includes analyzing the application to determine at least one branch of the application, wherein each branch is an instruction that deviates from a default behavior of the application; identifying, based on the at least one branch of the application and at least one first anonymous function, at least one potential threat branch, each potential threat branch including a call to one of the at least one first anonymous function; and rewiring at least one first function call of the application to create a secured instance of the application, wherein each of the at least one first function call is to one of the at least one first anonymous function prior to rewiring.

Abstract: A computing system includes a discovery application that identifies a computing device associated with a managed network. The application determines a first command that causes the computing device to invoke a function that provides as output attributes of the computing device. The command includes a parameter that suppresses any textual error messages that the function places in the output. The application also determines a second command that causes the computing device to provide a numerical exit status of the function. The application causes the computing device to execute the first and second commands, and obtains the output and the numerical exit status. Based on the numerical exit status, the application determines that the function did not fully obtain the attributes of the computing device and, in response, (i) modifies the first command, and (ii) causes the computing device to execute the first command as modified and the second command.

Abstract: An apparatus comprises a host device configured to communicate over a network with a storage system. The host device comprises a plurality of nodes each comprising a plurality of processing devices and at least one communication adapter. The host device comprises a multi-path input-output (MPIO) driver that is configured to obtain an input-output (IO) operation that targets a given logical volume. The MPIO driver identifies a source node and a plurality of paths between the source node and the given logical volume. The MPIO driver determines a load factor and a distance for each identified path. The MPIO driver determines a weight associated with each identified path based at least in part on the determined load factor and distance and selects a target path based at least in part on the determined weight. The MPIO driver delivers the obtained IO operation to the given logical volume via the selected target path.

Abstract: Provided is a method and system for defining shortcuts that can be used across multiple different software tools. In one example, the method may include detecting a key press, via a keyboard, associated with a command, identifying an application-independent shortcut corresponding to the key press, translating the application-independent shortcut into an application-specific shortcut for performing the command within the application, based on a translation database, and transmitting the application-specific shortcut to the application in response to the detected key press.

Abstract: A transaction card may power on the transaction card using electric current induced from an interaction of the transaction card with an electromagnetic field. The transaction card may establish a communication with a device. The communication may indicate that the transaction card has powered. The transaction card may receive, from the device, a set of instructions to configure a set of applets on the transaction card after notifying the device that the transaction card has powered on. The set of applets to be configured may be related to completing one or more different transactions. The set of applets to be configured may be different than another set of applets already configured on the transaction card. The transaction card may configure the set of applets on the transaction card according to the set of instructions after receiving the set of instructions.

Abstract: When processing events associated with a group comprising multiple different sub-groups, a hash function can be applied to the sub-group identifier to map the events associated with the sub-group to different computational elements used to process the group's events. The hash value can be a number between 1 and n or 0 and n?1 where n is the number of computational elements available to the group. Data concerning the last time a particular value for a property was encountered in an event stream can be retained. On each computational element assigned to the group, the detection of a particular property value in an event of a sub-group can be collected, periodically aggregated and sent to each of the computational elements used by the group, thereby enabling the first detection of a new property value within a group of events to be determined.

Abstract: A method, system and computer program product for securing data transmission. After determining that a message is being created to be sent from a sender to a receiver, the cognitive states of the sender and receiver are measured. A set of feature vectors for the sender and receiver is generated based on the cognitive states of the sender and receiver. The feature vectors are inputted into a long short term memory network, which selects an appropriate level of encryption (encryption strength, encryption algorithm, and mode of transportation in sending the message) to encapsulate the message utilizing the generated set of feature vectors. The message is then encapsulated using the selected level of encryption. In this manner, by using an appropriate level of encryption, the message is less likely to be accessible by unauthorized users thereby reducing the likelihood of unauthorized access or loss of valuable data.

Abstract: A storage array is implemented as a virtual machine on a server. The virtual storage array includes a virtual engine with virtual directors and virtualized processor and memory resources. Embedded storage software converts Input/Output requests into Input/Output requests that can be serviced by the virtual machine. A virtual backend driver enables the virtual storage directors to access a set of virtual drives. A virtualized shared memory driver provides emulated input/output, XOR, direct memory access and copy services for send and receive threads.

Abstract: Embodiments of the present systems and methods may decide if a software file is malicious or benign, using properties of the file's overlay, if existing. For example, in an embodiment, a computer-implemented method for identifying malware in computer systems may comprise receiving a plurality of executable files labeled as being malicious or benign, training a machine learning model using properties extracted from overlays associated with each of the plurality of received labeled executable files, receiving an executable file that is not labeled, determining whether the received unlabeled executable file is malicious or benign using the trained machine learning model based on properties extracted from an overlay associated with the received unlabeled executable file, and transmitting information identifying the received unlabeled executable file as malicious when the received unlabeled executable file is determined to be malicious.

Abstract: Described is a mechanism that provides the ability to reuse a portion of visual programming logic within an automation building tool. The programming logic may be represented as a directed acyclic graph (DAG) such that the nodes of the graph correspond to various operations and the edges of the graph correspond to the logic flow of the program. The mechanism may provide a new capability to reuse portions of the visual programming logic while adhering to the requirements of a DAG structure. For example, a user may copy a valid substructure of visual programming logic upon a validation the programming logic may be inserted into another portion of the DAG. Accordingly, the mechanism provides an efficient and user-friendly mechanism to reuse a portion of visual programming logic within an automation building tool.

Abstract: A method and system for secure message handling of an application across deployment locations. The application is analyzed to identify processing nodes referencing one or more data aspects having deployment constraints on locations in which aspect data in the one or more data aspects may be deployed. It is ascertained whether the one or more data aspects are accessed by an identified processing node of the application. If so, a restriction is determined for the identified processing node based on deployment constraints included in the accessed one or more data aspects and the identified processing node is deployed according to the determined restriction for the identified processing node. If not, the identified processing node or a preceding processing node is marked to indicate a required tokenization of the one or more data aspects, wherein the tokenization removes the deployment constraints for the identified processing node.

Abstract: Examples described herein emulate a processing architecture using multiple translations of the same source binary. A first translation binary includes compiler optimizations not present in a second translation binary. During runtime, a dispatcher directs control flow of a CPU when branch instructions are reached. Specifically, a dispatcher directs a CPU to execute instructions in the first translation binary, and accesses the second translation binary when an instruction is to a target that is not addressable in the first translation binary. The first and second translation binaries enable a target processing architecture to emulate a source processing architecture without just-in-time compilation or other runtime interpretation.

Abstract: Described are systems, methods, and computer-readable media for program generation in a domain-specific language based on input-output examples. In accordance with various embodiments, a neural-network-based program generation model conditioned on an encoded set of input-output examples is used to generate a program tree by iteratively expanding a partial program tree, beginning with a root node and ending when all leaf nodes are terminal.

Abstract: Technologies for binary translation include a computing device that allocates a translation cache shared by all threads associated with a corresponding execution domain. The computing device assigns a thread to an execution domain, translates original binary code of the thread to generate translated binary code, and installs the translated binary code into the corresponding translation cache for execution. The computing device may allocate a global region cache, generate region metadata associated with the original binary code of a thread, and store the region metadata in the global region cache. The original binary code may be translated using the region metadata. The computing device may allocate a global prototype cache, translate the original binary code of a thread to generate prototype code, and install the prototype code in the global prototype cache. The prototype code may be a non-executable version of the translated binary code. Other embodiments are described and claimed.

Abstract: Technologies for providing software code and data with in-memory protection through runtime memory encryption are described. A service comprising an integration component (an interface set) receives software program code and data that is to be protected in one or more protected areas of execution in memory. The integration component can integrate with a software development pipeline. The service (e.g. a wrapper engine component thereof) obtains the software program code and wraps the software program code and the data into a wrapped component. The service generates a secure counterpart program for executing in one or more protected areas of execution in memory (e.g., an enclave).

Abstract: An application includes main program code, but also a call handler and an update module. When a specific method or function in the operating system is called, the call is redirected to the call handler in the application. The call handler then calls the function in the operating system. The function retrieves an object to present in a user interface to the application. But before the object is rendered, program control is returned to the call handler, which calls into the update module. The update module determines whether or not the appearance of the object should be changed, for example, in accordance with an A/B test or any other type of update. If so, visual characteristics of the object are changed. Control reverts back to the operating system from the call handler and the object, in its changed form, is presented in the user interface.

Abstract: Parallel linguistic corpora used to train cognitive translation systems are built from robot plans. A collection of robot plans in various languages is analyzed in candidate pairings to see if any two plans are directed to the same task. If so, verbal instructions in different languages from the two plans (such as plan names) are assumed to have the same meaning, and are stored in association as part of the bilingual corpus. If each plan has multiple steps, the corresponding steps from the two plans can also be stored in association as part of the corpus. Robot plans are modeled as finite state automata having a plurality of links representing sensory states and a plurality of nodes representing motor actions, and the determination of plan similarity is based on a comparison of the two FSAs.

Abstract: A method for analyzing a program may include generating an initial control flow graph (CFG) for the program, identifying merge blocks of the initial CFG, identifying predecessor-merge pairs based on identifying predecessor blocks for each merge block, simulating a duplication of each predecessor-merge pair, determining whether the duplication satisfies a precondition of each of a collection of optimizations, applying, in response to satisfying the precondition, the optimization to the duplication, and generating a simulation result for the predecessor-merge pair corresponding to the duplication. The simulation result may include the optimization and a benefit of applying the optimization to the duplication. The method may further include duplicating, in the initial CFG, a predecessor-merge pair based on the simulation result corresponding to the predecessor-merge pair.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention provide for deploying an offering to a customer in a data processing system having an offering platform program operatively connected to a distributed offering network. An offering deployment package including the offering is received from a remote offering platform program. The offering included in the offering deployment package is deployed.

Abstract: In some aspects, a heterogeneous computing system includes a quantum processor unit and a classical processor unit. In some instances, variables defined by a computer program are stored in a classical memory in the heterogeneous computing system. The computer program is executed in the heterogeneous computing system by operation of the quantum processor unit and the classical processor unit. Instructions are generated for the quantum processor by a host processor unit based on values of the variables stored in the classical memory. The instructions are configured to cause the quantum processor unit to perform a data processing task defined by the computer program. The values of the variables are updated in the classical memory based on output values generated by the quantum processor unit. The classical processor unit processes the updated values of the variables.

Abstract: Techniques to facilitate prevention of just-in-time (JIT) translations of application functions are disclosed herein. In at least one implementation, a JIT translation function of an operating system is modified in memory to redirect the JIT translation function to execute alternative code when the JIT translation function is called. When the JIT translation function is called for an application function, the alternative code is executed to determine whether the application function has been modified. When the alternative code determines that the application function has been modified, the JIT translation function is prevented from translating the application function into a native machine code version. When the alternative code determines that the application function has not been modified, the JIT translation function is allowed to translate the application function into the native machine code version.

Abstract: Techniques for easy and secure deployment of a software package from a server to a customer-controlled computing device are described. In an embodiment, a deployment engine running on a server can be used to generate a unique URL for deployment of the software package. The unique URL may include a restricted use token. The restricted use token may be generated based on a combination of a random selection of one or more dictionary words, numbers, and/or symbols. The restricted token is easily readable given the combination of dictionary words, numbers, and/or symbols that make up the restricted use token. The unique URL may then be entered into a customer-controlled computing device via a curl command. The curl command will use the unique URL to generate a secure channel to the deployment engine and automatically download the software package onto the customer-controlled computing device.

Abstract: Systems and methods are described for conducting data processing against a target data set in an on-demand code execution system. The on-demand code execution system can enable execution of user-provided executable code. The user-provided executable code is embedded in communications sent to a user. Each execution of the data processing code can process at least a portion of a data to determine content to be rendered in the communications. The resulting content is rendered and provided to the user.

Abstract: A computer-implemented method for synthesizing a digital circuit is disclosed. The method includes receiving producer instructions defining a producer processing thread; generating a producer register-transfer level (RTL) description of the producer processing thread; receiving consumer instructions defining a consumer processing thread; generating a consumer RTL description of the consumer processing thread; and automatically inferring generation of streaming hardware RTL in response to receiving the producer and consumer instructions.

Abstract: An operator tree is formed for a data processing plan, the operator tree containing a plurality of interconnected nodes and including a grouping of two or more duplicative portions, each of the two or more duplicative portions having identical nodes and structure such that when the operator tree is executed, operators executed in a first duplicative portion using a first thread perform same functions use different data than operators in a second duplicative portion using a second thread. One or more operators in the first portion and one or more operators in the second portion to be synchronized with each other are identified. A synchronization point is created for the identified operators in the first thread and one or more subsequent threads, wherein the synchronization point receives information from each of the identified operators to build an artifact to deliver to one or more operators that depend on the artifact.

Abstract: Systems and methods for processing breakpoints in a target program executing on a remotely located server computer are presented. In one embodiment, upon receiving instructions to set a breakpoint in a target program, a code block of the target program is identified in which the execution location of the breakpoint is to be set. The identified code block of the target program is re-compiled. Re-compiling the code block of the target program comprises re-compiling the code block without optimizations and including executable instructions at the execution location of the breakpoint to generate a snapshot of debugger information regarding the target program upon the breakpoint triggering. The re-compiled code block is then bound in the target program.

Abstract: Disclosed are techniques for automatic generation of software application code. These techniques identify or generate a data model in a first programming language. At least one rule is identified or generated from the data model. This at least one rule is tokenized into a plurality of subparts based at least in part upon a second programming language. A rule hierarchy at which the plurality of sub-parts is located is determined based in part or in whole upon a corresponding class hierarchy of a class with which the at least one rule is associated. A transformed data model is generated in the second programming language using at least the plurality of sub-parts and the rule hierarchy.

Abstract: An apparatus adds attribute information that is used for outputting a warning that use of a symbol is non-recommended to the symbol that is included in a source code. The apparatus determines whether or not the warning corresponding to the attribute information is output for the symbol in compilation of the source code, determines that the symbol is an unused symbol which is not used in a process which is described in the source code in a case where the warning is not output, and outputs information of the unused symbol.