Abstract: Some embodiments are directed to secure communication with a server from a device. The device is configured to decrypt an encrypted message in a secure mode with a private key, and to display secret shared with the user together with the decrypted message on a display of the device to indicate to the user that the message is being displayed by software running in the secure mode.

Abstract: A computer-implemented method includes creating a first file control block in a primary runtime environment with a first addressing mode and a second file control block in a secondary runtime environment with a second addressing mode, where both the first file control block and the second file control block describe a status of a first file of a caller program in the primary runtime environment. The parameters of the first file of the caller program in the primary runtime environment are passed to a target callee program in the secondary runtime environment. An anchor is added in the first file control block as a link to the second file control block. The first file control block are the second file control block synchronized with updates to the first file in the primary runtime environment and the passed parameters of the first file in the secondary runtime environment.

Abstract: Technologies are shown for system level function based access control for smart contract execution on a blockchain. Access control rules control function calls at a system level by utilizing function boundary detection instrumentation in a kernel that executes smart contracts. The detection instrumentation generates a call stack that represents a chain of function calls in the kernel for execution of a smart contract. The access control rules are applied to the function call stack to allow or prohibit specific functions or function call chains. Access control rules can also define allowed or prohibited parameter data in the function call chain. If the function call chain or parameters do not meet the requirements defined in the access control rules, then the function call can be blocked from executing or completing execution. The access control rules can produce sophisticated access control policies based on complex function call chains.

Abstract: A service data management method and apparatus for service building blocks (SBB), a device and a storage medium are provided, and a service data setting interface is extended. When service data needs to be set, the service data is received through the service data setting interface, and service data to be set is added into a service data set of a service corresponding to service identification information according to the service identification information and the service data to be set in the service data setting instruction. When it is detected that an SBB needs to be configured with the service data, service data corresponding to the SBB in the service data set corresponding to the SBB is directly configured for the SBB, i.e., the set service data takes effect immediately and is able to be called by the corresponding the SBB in real time.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating signed addresses. One of the methods includes receiving, by a component from a device, a plurality of first requests, each first request for a physical address and including a virtual address, determining, by the component, a first physical address using the virtual address, generating a first signature for the first physical address, and providing, to the device, a response that includes the first signature, receiving, from the device, a plurality of second requests, each second request for access to a second physical address and including a second signature, determining, by the component for each of the plurality of second requests, whether the second physical address is valid using the second signature, and for each second request for which the second physical address is determined to be valid, servicing the corresponding second request.

Abstract: A method for tracing function execution includes instantiating, by at least one hardware processor of a computing node, a user code runtime configured with access to an operating system (OS) kernel of the computing node. The user code runtime is configured with a first set of filtering policies associated with a first set of allowed system calls. The OS kernel is configured with a second set of filtering policies associated with a second set of allowed system calls. A system call initiated by the user code runtime is detected to violate one or both of the first set of allowed system calls and the second set of allowed system calls. A trace of the system call is initiated based on the detecting.

Abstract: Example implementations described herein involve systems and methods for operation of a robot configured to work on a first process and a second process, which can involve receiving sensor data indicative of a status of one or more of the first process and the second process; for the status indicative of the first process waiting on the robot, controlling the robot to work on the first process; and for the status indicative of the first process not waiting on the robot, controlling the robot to conduct one or more of work on the second process or return to standby.

Abstract: Systems, methods, and computer programming products for loading and upgrading software using DLL files injected into a running target program process by a DLL manager of an injection program. Background services of the injection program allocate virtual memory for the code and data within the memory addresses dedicated to the target program process and injects the code and data by writing the code and data of the DLL manager to the virtual memory. A remote thread created within the target program process, controlled by the injection program, executes the DLL manager code, allowing the DLL manager to load and unload DLL files within the target program process. During runtime of the target program process the software can be upgraded, without rebooting the OS executing the target program process, by instructing the DLL manager to unload the DLL file(s), and load and/or re-load updated DLL file(s) within the target program process.

Abstract: Computer-implemented systems and methods are disclosed for providing a graphical user interface for tagging external content. In accordance with some embodiments, a method is provided for tagging content external to a database system. The method comprises accessing the external content of an electronic device. The method may comprise enhancing the web browser by providing a tagging interface for tagging at least a portion of the external content. The method may further comprise receiving created tag associated with a tagged portion of the external document content, and exporting the external content and the received tag to the database system. The tagging interface can also provide an option to export the created tag to an internal database system.

Abstract: For the purpose of reproducing a call stack accurately without restricting the range of application, a stack scanner extracts, from a stack area of a thread whose call stack is to be acquired in a memory space of an application process, possible return addresses that are addresses in a feasible region in the memory space each representing a command right after a function call command. A program analyzer analyzes a control flow representing a flow of control configured by a branch in a function that is called by the function call command right before the command represented by each of the possible return addresses and, when there is a route reaching a command currently being executed in the control flow, determines that the possible return address is a return address and, when there is not the route, determines that the possible return address is not a return address.

Abstract: A method, apparatus and system required to realize an optimization opportunity are disclosed. If an expression involves unsequenced evaluations involving side-effects and optionally references, then the expression is translated into optimized code that may involve optimized register usage, or optimized use of the underlying vectorization hardware. An alias-analysis logic is able to identify must-not-alias relationships through such expression tree structures. These must-not-alias relationships are helpful not just in optimizing the performance of that particular expression (from which these must-not-alias relationships were derived) but also in the performance of any other surrounding program statements that access the state elements participating in these must-not-alias relationships.

Abstract: In some examples, a method includes downloading, from an application provider, a patch to be applied to a first application element and a stripped version of the application that does not include one or more application elements to be reused during installation of the application, decompressing the first application element to generate a decompressed version of the first application element, and decompressing the patch to generate a decompressed version of the patch. The method may also include applying the decompressed version of the patch to the decompressed version of the first application element to generate a patched application element, compressing the patched application element to generate a compressed patched application element, and installing the application using the compressed patched application element, the stripped version of the application, and the one or more application elements other than the first application element.

Abstract: Embodiments relate to using a local entry point with an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to identify potential target functions and indicate the potential target functions in the program code. A linker can read the indication the compiler made in the program code. The linker optimizes an indirect call site if the potential target functions are defined in the same module.

Abstract: A method provides real world contexts to computer applications for outputting data describing one or more real world contexts. Components are identified in a computer application which implement instances of real world contexts and application components are updated so that a real world context instance is active during the execution by the application of a function for the real world context instance. Each real world context instance may have an instance identifier and is referenced by type of real world context.

Abstract: A virtual-machine-based system that identifies an application or process in a virtual machine in order to locate resources associated with the identified application. Access to the located resources is then controlled based on a context of the identified application. Those applications without the necessary context will have a different view of the resource.

Abstract: A method for registering a plurality of callbacks. The method may include receiving at least one callback function in a virtual machine, which includes a plurality of callback registration information. The method may include registering each at least one received callback function in a virtual machine tool interface within the virtual machine to a list of callback functions for an event based on the plurality of callback registration information. The method may include monitoring the virtual machine for an occurrence of the event. The method may include determining the event has occurred. The method may also include generating a local frame for each at least one registered callback function within the list of callback functions for the determined event. The method may include executing each at least one registered callback function based on each generated local frame associated with each at least one registered callback function.

Abstract: Embodiments relate to optimizing an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler is provided to identify potential target functions and indicate the potential target functions in the program code. Additionally, the compiler determines and indicates in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module. A linker can read the indication the compiler made in the program code and optimize the indirect call function.

Abstract: Embodiments relate to optimizing an indirect call function. More specifically, an indirect call function configuration comprises a first application module having a target function of the indirect function call, a second application module with a symbolic reference to the target function of the indirect function call, and a third application module to originate an indirect function call. A compiler identifies potential target functions and indicates the potential target functions in the program code. Additionally, the compiler determines and indicates in the program code that the function pointer value resulting from a non-call reference of a function symbol is solely used to perform indirect calls in the same module. A linker can read the indication the compiler made in the program code and optimize the indirect call function.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: Programming in a multiprocessor environment includes accepting a program specification that defines a plurality of processing modules and one or more channels for sending data between ports of the modules, mapping each of the processing modules to run on a set of one or more processing engines of a network of interconnected processing engines, and for at least some of the channels, assigning one or more elements of one or more processing engines in the network to the channel for sending data between respective processing modules.

Abstract: Embodiments disclose a method, computer program product, and system for optimizing computer functions. The embodiment may create a control flow graph from a computer function. The control flow graph may contain an entry block, an exit block, and basic blocks located between the entry block and the exit block. The embodiment may classify each of the basic blocks as an original heavy basic block or an original light basic block. The embodiment may classify the original heavy block, the exit block and each of the basic blocks that are located between each original heavy block and the exit block as a determined heavy block. The embodiment may create light computer functions and heavy computer functions from the computer function. Each heavy computer function contains the basic blocks classified as determined heavy. The light computer functions contains the remaining basic blocks, the exit block and calls to the heavy computer functions.

Abstract: The present disclosure provides methods and systems for instrumenting a “semantic stack trace” (SST), where semantic information and dependency relationships between a plurality of code elements (“elements”) are captured during runtime execution of various front-end declarative languages, and are subsequently extracted for display in a SST-enabled interactive user interface with traversing capability. Embodiments of the present invention enable a framework for traversing and debugging complex code, providing an unprecedented lens into understanding code behavior in mixed imperative and declarative construction languages.

Abstract: Generating a modified protected file is disclosed, including: renaming a primary content object of a protected file; and creating a modified protected file based at least in part by inserting into the protected file a replacement object for the renamed primary content object. Using the modified protected file is disclosed, including: determining that a file includes a renamed primary content object; and redirecting a data access operation to the renamed primary content object.

Abstract: A system including a processor and a memory storing instructions that, when executed, cause the system to: generate a dynamic object having rich content, interactive code and multiple platform operability logic that allows the interactive code to operate on a plurality of platforms; send the dynamic object to one of the plurality of platforms; process the dynamic object on the one of the plurality of platforms; and provide one or more interfaces for user engagement to perform an interaction specified by the dynamic object.

Abstract: The invention discloses an information control method and an electronic device. The information control method is applied to a first electronic device, and the first electronic device is connected with a second electronic device. The method includes: detecting feature information of the first electronic device according to a connection relation between the first electronic device and the second electronic device; and controlling the first electronic device according to the feature information.

Abstract: A strategy-maintenance system comprises a memory, an interface, and a processor. The system is operable to store a plurality of templates. A template comprises a statement that facilitates writing one or more strategies. The system may further communicate to a first computer the plurality of templates for presentation on a first graphical user interface. The system also receives a first selection of at least one of the plurality of templates for a strategy. The strategy is operable to calculate a key value based on at least one of the plurality of templates. The system finally executes the strategy to calculate the key value and communicates the strategy for execution on a remote machine.

Abstract: The present invention is an installation script generation engine. An application component distribution system can include a repository of semantic models for interdependent ones of application components. A mapping of individual listings in the semantic models to target platform specific installation instructions further can be included. Finally, a script generation engine can be configured to produce a target specific set of instructions for a specified application component based upon a mapping of at least one of the semantic models in the repository. Notably, each of the semantic models can include a listing of component relationships, target platform requirements and platform neutral installation instructions. Moreover, the component relationships can include at least one component relationship selected from the group consisting of a containment relationship, a usage relationship, a contradiction relationship, and an equivalence relationship.

Abstract: A system and method for marshaling database data from a native interface layer, to a Java layer, using a linear array. In accordance with an embodiment, a request is received from a software application to query or access data stored at the database. At a database driver native interface layer, the system obtains cell data from the database, determines cell coordinates and a cell metadata, and linearizes the cell data if required. The linearized data is then flushed to a linear byte array in the database driver presentation layer, and the cell coordinates and cell metadata are provided for use by a compact data handler and the application in accessing the data.

Abstract: A computer-implemented method includes managing function calls between a plurality of nodes and a super node of a rack system having a distributed operating system (OS). The OS includes a plurality of functions divided into first class and a second class, and each of the plurality of nodes excludes functions in the second class. Managing the function calls includes detecting a call to a first function on a first node of the plurality of nodes. It is determined that the first function belongs to the second class of functions and is not available on the first node. The call to the first function is routed to the super node, responsive to determining that the first function belongs to the second class, where the super node includes code for the functions in the second class.

Abstract: A maintenance method of intelligent ODN management system comprises the following steps: carrying out mutual exclusion protection on a same operation task, wherein each executable operation task is protected by operation authorization, and any one maintenance and management terminal needs to acquire the operation authorization of the operation task before executing the operation task and release the corresponding operation authorization after the execution is finished; and carrying out mutual exclusion protection on different maintenance and management terminals, wherein after a local maintenance center obtains control right on the intelligent ODN management system, a remote maintenance center and a local maintenance terminal need to apply for authorization from the local maintenance center before operating the intelligent ODN management system, and can deliver an operation instruction after successfully applying for the authorization.

Abstract: According to one general aspect, a method may include monitoring the execution or at least a portion of a software application. The method may also include collecting subroutine call information regarding a plurality of subroutine calls included by the portion of the software application, wherein one or more of the subroutine calls is selected for detailed data recording. The method may further include pruning, as the software application is being executed, a subroutine call tree to include only the subroutine calls selected for detailed data recording and one or more parent subroutine calls of each subroutine calls selected for detailed data recording.

Abstract: A method of converting an original application into a cloud-hosted application includes splitting the original application into a plurality of application components along security relevant boundaries, mapping the application components to hosting infrastructure boundaries, and using a mechanism to enforce a privacy policy of a user. The mapping may include assigning each application component to a distinct virtual machine, which acts as a container for its assigned component.

Abstract: The apparatuses, methods and systems for application update includes determining a module dependency graph for a current version of the application, when an indication to generate an updated version of the application is received. A code database is queried to obtain all version numbers for dependent modules identified in the module dependency graph. Recent versions of all dependent modules are selected for an updated version of the application to generate an initial set of dependent modules for the application. Specification attributes for the recent version of the dependent modules are obtained and verified to determine if they are compatible with the updated version of the application. When it is determined that a specific dependent module is not compatible, a different version number for the specific dependent module is selected and the initial set is modified by replacing the recent version with the different version number to generate a modified set.

Abstract: Automated unpacking of a portable executable file includes setting a debugging breakpoint at an original entry point address of a packed portable executable file. A debugging process is executed for the packed portable executable file to obtain a debugged portable executable file in memory. One or more of import address table data and relocation table data are collected during execution of the debugging process for the packed portable executable file. The debugged portable executable file in memory is copied to a storage medium, and the debugging process is terminated.

Abstract: A method for loading software onto a processor unit of a subcomponent of an assembly that contains a plurality of components having different subcomponents. The assembly includes a central processor. In order to be able to carry out at least a portion of such a method automatically, subcomponent-specific structure information is selected from a stored subcomponent-specific structure information list about the component by way of stored base information about the respective component, on the basis of a component-specific structure information list about the assembly stored in the central processor, and by way of additional stored base information about the subcomponent. The selected subcomponent-specific structure information is then used to generate, via the subcomponent, a loading list which causes the software to be loaded onto the processor unit that belongs to the subcomponent.

Abstract: According to one general aspect, a method may include monitoring the execution or at least a portion of a software application. The method may also include collecting subroutine call information regarding a plurality of subroutine calls included by the portion of the software application, wherein one or more of the subroutine calls is selected for detailed data recording. The method may further include pruning, as the software application is being executed, a subroutine call tree to include only the subroutine calls selected for detailed data recording and one or more parent subroutine calls of each subroutine calls selected for detailed data recording.

Abstract: A compilation method includes converting memory access instructions that read or write less than a minimum data access unit (MDAU) to memory access instructions that read or write a multiple of the minimum data access unit, converting the memory access instructions into a format including a base address plus an offset, grouping subsets of the converted memory access instructions into partitions, and vectorizing the converted memory access instructions in the subsets that match instruction patterns.