Abstract: The present disclosure provides systems and methods for domain decomposition in parallel numerical computer modelling that remove the need for large-scale synchronization, decouple the regions within a simulation, and reduces wait times, increasing linear scalability and thus suitability for large-scale cloud deployment. Presently disclosed systems and methods include asynchronous message passing which decouples the computational units within the system and introduces an elasticity that allows wait time to be largely eliminated. Applications include domains in which computations are not easily parallelized and/or large-scale numerical simulations used with a large cluster or cloud computing facility.

Abstract: An embodiment of a semiconductor package apparatus may include technology to determine a size for a trace buffer based on instrumented code to be executed on a graphics processor, initialize the trace buffer in a shared memory based on the determined size, provide the instrumented code to the graphics processor to be executed, collect data in the trace buffer from the executed instrumented code, analyze the data collected in the trace buffer on a processor, and generate a trace of the instrumented code on the processor based on the analyzed data. Other embodiments are disclosed and claimed.

Abstract: A printing system includes a terminal apparatus with a printer driver that is installed in the terminal apparatus and generates data for an image formation apparatus based on print setting, and a server apparatus. The terminal apparatus and the server apparatus are connected to each other. The server apparatus includes a first setting device that sets specific setting data relating to the print setting, and an application device that applies the specific setting data to the terminal apparatus. The terminal apparatus includes a storage that stores setting data representing setting of the terminal apparatus, a reflector that reflects the specific setting data in the setting data, and a controller that refers to the setting data to perform control to modify the print setting.

Abstract: A computerized mechanism to formulate a data flow representation from a syntax tree. The syntax tree may be, for instance, an abstract syntax tree (AST) that is formulated by compiling query script, such as big data query script. Each node in the syntax tree is composed of one or more tokens (script portions) that are taken from the query script, which relationships between the tokens being syntactically represented by links between those tokens. Accordingly, the data flow representation may also be a data flow representation of the original query script itself. In order to formulate the data flow representation from the syntax tree, the data types of the various inputs and outputs of the syntax tree nodes are identified and bound to a corresponding data flow. This may be performed whilst honoring dependencies between the nodes. The data flow may be visualized to an author or reviewer of the script.

Abstract: Reads of data stored at the solid-state storage device are monitored. A set of data stored at the solid-state storage device is marked based on the monitoring of the reads of the data. A read request is received for a subset of data of the set of data stored at the storage device. In response to receiving the read request for the subset of data, the subset of data is relocated to a cache memory of the solid-state storage device.

Abstract: An information processing device includes a confirmation unit and an application unit. If a changeable flag is attached to a process flow, the confirmation unit confirms whether or not a change exists in a master of the process flow. If the confirmation unit confirms that a change exists in the master, the application unit applies the change to the process flow that is to be executed.

Abstract: A method includes determining, by a tracker controller of a hardware security module, that a first processor has submitted a first request to access a computing resource. The method also includes determining, by the tracker controller, whether the first request and a second request both request access to the same computing resource. The second request is submitted by a second processor. The method also includes preventing access to the computing resource based on a determination that the first request and the second request do not request access to the same computing resource. The method also includes permitting access to the computing resource based on a determination that the first request and the second request both request access to the same computing resource.

Abstract: Systems, apparatuses and methods may provide for technology that identifies a thread and selects a core from a plurality of processor cores in response to the selected core being available while satisfying a least used condition with respect to the plurality of processor cores. The technology may also schedule the thread to be executed on the selected core.

Abstract: Cloud robotics infrastructures generally support heterogeneous services that are offered by heterogeneous resources whose reliability or availability also varies widely with varying lifetime. For such systems, defining a static redundancy configuration for all services is difficult and often biased. Also, it is not feasible to define a redundancy configuration separately for each unique service. Therefore, in the present disclosure a trade-off between the two is ensured by providing At-most M-Modular Flexible Redundancy Model wherein an exact degree of redundancy is defined and is given to each service in a heterogeneous service environment and monitoring each task and subtask status to ensure that each subtask gets accomplished thereby enabling the tuning of the tradeoff between redundancy and cost and determining efficiency of the system by estimating number of resources utilized to complete specific subtask and comparing the resources utilization with the exact degree of redundancy defined.

Abstract: Activation policies for workflows are described. Some implementations support the configuring of a workflow such that an activity in the workflow can start processing items on which a prior activity's processing is completed, but before the prior activity has completed processing all the items. In addition, this activity can be configured to group the items received so far into a subset and process it according to the action of the activity and then send it to a next activity; and the activity can be configured to repeat this process multiple times using the items that have been received since the previous subset. In some implementations, an input set of items for a workflow is generated from a set of one or more sources, and the workflow is generated by splitting the input set into subsets via a recurring catch and release mechanism that is responsive to activation policies of the activities of the workflow.

Abstract: Techniques are disclosed relating to a computer system accessing a client credential set to authenticate with a destination computer system. A computer system may, subsequent to receiving an indication to make available an application for a particular user, retrieve configuration data specifying a reference to a key value. The computer system may maintain a data object that includes a client credential set for the particular user. In response to an occurrence of an event associated with the application, the computer system may access the client credential set of the particular user from the data object using the key value and an indication of the particular user. The computer system may then send a request including the client credential set to a destination computer system for authentication with the destination computer system and receive a response indicating whether the computer system has been authenticated.

Abstract: A second query execution part is added to a database management system comprising a first query execution part configured to execute a query based on a query execution plan of a query to a database and to return a query execution result to the query issuance source and a buffer management part configured to read a data of a read request from the database to store the data into the buffer and to provide the data to an issuance source of the read request if data of a read request has not been stored in a buffer in the case where the read request of data is received and configured to read data of a read request from the buffer and to provide the data to a issuance source of the read request if data of a read request has been stored in the buffer.

Abstract: An information processing apparatus comprises a first conversion part storing a partial matrix for columns having a predetermined number or more of non-zero elements among columns in a matrix in a first format, and a second conversion part storing a partial matrix for the other columns in the matrix in a second format.

Abstract: A method, apparatus and computer program product predict run-time to completion of workflows executing in a shared multi-tenant distributed compute clusters. The method, apparatus and computer program product receive a MapReduce workflow. The MapReduce workflow includes one or more MapReduce jobs for execution.

Abstract: An apparatus for controlling running of multiple security software applications, including: a secure element and at least one central processing unit coupled to the secure element, where the secure element includes a processor and a first random access memory; the processor is configured to: run secure operating system software and at least one security software application based on the secure operating system software; when it is required to run a second security software application, suspend running of a first security software application in the at least one security software application, control migrating first temporary data generated during running of the first security software application from the first random access memory to a storage device disposed outside the secure element, and based on the secure operating system software, run the second security software application.

Abstract: A graphics processing apparatus comprises fragment generating circuitry to generate graphics fragments corresponding to graphics primitives, thread processing circuitry to perform threads of processing corresponding to the fragments, and forward kill circuitry to trigger a forward kill operation to prevent further processing of a target thread of processing corresponding to an earlier graphics fragment when the forward kill operation is enabled for the target thread and the earlier graphics fragment is determined to be obscured by one or more later graphics fragments. The thread processing circuitry supports enabling of the forward kill operation for a thread including at least one forward kill blocking instruction having a property indicative that the forward kill operation should be disabled for the given thread, when the thread processing circuitry has not yet reached a portion of the thread including the at least one forward kill blocking instruction.

Abstract: An information processing system includes a plurality of programs, each executing a predetermined process. The information processing system includes a memory and circuitry. The memory stores, for each of applications, each executing a series of processes using electronic data, an application associating flow information with application setting information. The flow information defines program identification information and an execution order. The application setting information defines parameter setting information, group setting information, and flow identification information. The memory further stores use screen information in association with application identification information.

Abstract: There is provided a data processing apparatus that includes processing circuitry for executing a plurality of instructions. Storage circuitry stores a plurality of entries, each entry relating to an instruction in the plurality of instructions and including a dependency field. The dependency field stores a data dependency of that instruction on a previous instruction in the plurality of instructions. Scheduling circuitry schedules the execution of the plurality of instructions in an order that depends on each data dependency. When the previous instruction is a single-cycle instruction, the dependency field includes a reference to one of the entries that relates to the previous instruction, otherwise, the data dependency field includes an indication of an output destination of the previous instruction.

Abstract: A method, computer program product, and computing system for identifying one or more disaster recovery requirements for a network appliance, wherein the network appliance includes both storage functionality and compute functionality. The one or more disaster recovery requirements are provided to a potential disaster recovery target for the network appliance. The potential disaster recovery target is analyzed to determine if the potential disaster recovery target meets the one or more disaster recovery requirements of the network appliance. If the potential disaster recovery target meets the one or more disaster recovery requirements, the potential disaster recovery target is configured as a disaster recovery site for the network appliance.

Abstract: A method includes, in a program that includes a defined number of job slots for data updating processing jobs, scheduling a first job in one of the slots, and executing the first job, wherein the first job includes scanning a list of additional jobs and scheduling those additional jobs for execution, further wherein a total number of the additional jobs in the program exceeds the defined number of job slots.

Abstract: According to at least one aspect, a system for analyzing computer usage data of a user to identify an underlying task being performed by the user is provided. The system includes a hardware processor and a non-transitory computer-readable storage medium storing processor-executable instructions that, when executed by the hardware processor, cause the hardware processor to perform: receiving a plurality of events each indicative of an action performed by a user and contextual information associated with the action performed by the user, clustering the plurality of events to generate a plurality of clustered events, identifying a plurality of sub-tasks in the plurality of clustered events that each comprise a sequence of clustered events, identifying a task in the plurality of clustered events being performed by the user that comprises at least one sub-task, and generating a score for the task indicative of a difficulty of automating the task.

Abstract: Job execution can be scheduled and monitored. Execution of a job results in generation of one or more data slices, which can be consumed as input by one or more related jobs. Data slices can be presented in an interactive view. Selection of a data slice in the view can trigger automatic identification of related data slices based on dependencies between data slices. Each data slice can also include and be presented with a status indicating the availability of corresponding data, such as pending, ready, or failed. Furthermore, selection of a data slice that failed to generate successfully can trigger identification of related data slices that failed or are predicted to fail to generate successfully.

Abstract: A combination of memory units and dataflow processing units is disclosed for computation. A first memory unit is interposed between a first dataflow processing unit and a second dataflow processing unit. Operations for a dataflow graph are allocated across the first dataflow processing unit and the second dataflow processing unit. The first memory unit passes data between the first dataflow processing unit and the second dataflow processing unit to execute the dataflow graph. The first memory unit is a high bandwidth, shared memory device including a hybrid memory cube. The first dataflow processing unit and second dataflow processing unit include a plurality of circular buffers containing instructions for controlling data transfer between the first dataflow processing unit and second dataflow processing unit. Additional dataflow processing units and additional memory units are included for additional functionality and efficiency.

Abstract: The technology described herein allows applications to access user-interest information generated by a plurality of applications. User-interest data can be generated by applications when a user interacts with an application. The technology described herein allows an application to submit user interests to a system that makes the user interests available to other applications. The technology allows each application to subscribe to user interests that are consumable by the application. In this way, each application can control what user-interest information is received.

Abstract: To assist in patent searching a description includes a consumer purchasing behavior profiling system having aspects including consumer profiles formed and updated based on a variety of data. Advertisers access to send targeted advertising messages to the consumers. Aspects include advertising information together with incentive level and mix being correlated with the consumer profile to produce a measure of the applicability of the ad to that consumer and the probability of converting that consumer. Other aspects include determining the mix of ad information, incentive level and type, and product offering that will be required to convert an ad viewer to a buyer. Aspects focus on using wireless devices with consumers. Other aspects reside in methods of using electronic coupons distribution and redemption to collect additional data points necessary to understand the consumer's purchasing decision process and factors that influence the purchasing decision.

Abstract: A system that predicts promotional cross item (“PCI”) effects for retail items for a store receives historical sales data for the store and stores the historical sales data in a panel data format. The system then aggregates the stored sales data as a first level of aggregation that is aggregated to the store, a product and a time period. The system further aggregates the first level of aggregation aggregated data as a second level of aggregation that is based on a promotional cross effect attribute (“PCEA”) and is aggregated to the store, the time period and a PCEA level. The system derives PCI effect predictor variables from the second level of aggregation and, for each PCEA within a retail item family, forms a regression model. The system then generates estimated model parameters for one or more PCI effects for each PCEA from the regression models.

Abstract: A thread scheduling mechanism is provided that flexibly enforces performance isolation of multiple threads to alleviate the effect of anti-cooperative execution behavior with respect to a shared resource, for example, hoarding a cache or pipeline, using the hardware capabilities of simultaneous multi-threaded (SMT) or multi-core processors. Given a plurality of threads running on at least two processors in at least one functional processor group, the occurrence of a rescheduling condition indicating anti-cooperative execution behavior is sensed, and, if present, at least one of the threads is rescheduled such that the first and second threads no longer execute in the same functional processor group at the same time.

Abstract: An image processing system includes an interface to transmit and receive data via a network, a processor connected to the interface, a memory storing an image processing program modules executable by the processor, wherein the image processing program causes the processor to perform operations. The operations include providing a point cloud of an image including objects into a segmentation network, segmenting point-wisely the point cloud into multiple classes of the objects and detecting boundaries of the objects using the segmentation network, wherein the segmentation network outputs a probability of associating primitive classes of the objects based on the segmented multiple classes and the segmented boundaries, verifying and refining the segmented multiple classes and the segmented boundaries using a predetermined fitting method, and correcting misclassification of the multiple classes of the objects by fitting the primitives to the multiple classes.

Abstract: Source code of a graph analysis program expressed in a platform-independent language which supports linear algebra primitives is obtained. An executable version of the program is generated, which includes an invocation of a function of a parallel programming library optimized for a particular hardware platform. A result of executing the program is stored.

Abstract: A electronic device and a control method of the electronic device are provided. A control method includes providing a first environment in which at least one application can operate and a second environment having an operation environment at least partially different from the first environment; determining whether a first application among the at least one application is to be executed in the second environment, when an execution command of the first application is acquired; and executing the first application in the second environment, when it is determined that the first application is to be executed in the second environment.

Abstract: The system provides a method and apparatus for the dynamic distribution, deployment, and configuration of optimizable code modules for use with software workflows running on a single compute device or across a network connected grid of compute devices. The system comprises one or more collections of software and data modules stored in a content catalog, conforming to a defined interface, and having metadata conforming to a schema that enables the modules to be statically or dynamically optimized by the controlling workflow and a workflow manager. The system provides a service that enables code modules to be located, deployed, configured, and updated by the controlling workflow, the workflow manager, or a remote manager.

Abstract: Transaction data is generated during monitoring of a plurality of transactions in a system and a respective flow is determined, from the transaction data, for each of the plurality of transactions. Each of the determined flows involves participation of a respective subset of software components of the system. A plurality of sets of overlapping flows in the plurality of flows are determined and a particular one of the plurality of sets of overlapping flows is determined to correspond to a use scenario of the system. A measure of the degree to which a set of artifacts modeling the system corresponds to the use scenarios of the system is determined.

Abstract: A system and method are disclosed in an automated expense report system for identifying a delegated user and granting to the user delegate rights. At least one granted right includes one or more permissions to carry out certain operations in the expense report system such as permission to create an expense report, permission to access receipt data, permission to approve an expense report, or permission to view an expense report. At least one permission is associated with one or more workflows by which the operations are carried out. In one embodiment, data that identifies delegates is sent to an image capture device coupled to the expense report system and a delegated user carries out operations in the expense report system from the image capture device. In one embodiment, the expense report system keeps a database of the users and those delegating persons for whom a user is permitted to act.

Abstract: The described technology is directed towards sharing asynchronous (async) tasks between task chains, including in a way that prevents cancellation of lower-level chain entity from cancelling a shared async task. A shared async task is wrapped in multiplexer code that maintains lower-level entity identities as a set of listeners of the shared async task, and when a listener cancels, only removes that listener from the set of listeners so that the shared async task does not cancel as long as one listener remains in the set. Also described is optimization to share an async task, and wrapping tasks in cancel-checking code that prevents the task from running its work if the task is intended to be cancelled but is queued to run before the cancel request is queued to run.

Abstract: Methods, systems, and computer storage mediums including a computer program product for managing data in a computing network are provided. One method includes registering a plurality of buffers with a work queue in a server and assigning ownership to each of the plurality of buffers to a different working thread in a plurality of working threads. The method further includes continuously polling, by a polling thread, the work queue to determine when work requests are received by the work queue, upon receipt of each work request, and performing each work request on each respective associated buffer by a working thread among the plurality of working threads that owns each respective associated buffer. One system includes a processor for performing the above method and one computer storage medium includes computer code for performing the above method.

Abstract: Management of hierarchical process groups is provided. Aspects include creating a group identifier having an associated set of resource limits for shared resources of a processing system. A process is associated with the group identifier. A hierarchical process group is created including the process as a parent process and at least one child process spawned from the parent process, where the at least one child process inherits the group identifier. A container is created to store resource usage of the hierarchical process group and the set of resource limits of the group identifier. The set of resources associated with the hierarchical process group is used to collectively monitor resource usage of a plurality of processes in the hierarchical process group.

Abstract: An automation control system is provided that includes one or more components. The components include an embedded execution engine that is configured to execute one or more commands based upon data communicated to the one or more components from another component of the automation control system. The data is representative of a change to an object in the control system.

Abstract: Customizing an electronic meeting broadcast is described in which the meeting canvas is customized to the capabilities of the device of the participating user. The meeting server manages the electronic meeting including each of the participants' connections into the electronic collaboration space. As a part of the connection mechanism, the meeting server or a proxy/gateway connected to the meeting server has information on the capabilities of individual devices accessing the electronic meeting. Based on these capabilities and/or selections made by the meeting participant, the meeting server or proxy/gateway connected to the meeting server selectively identifies zero or more meeting objects from a collection of meeting objects supporting the meeting canvas of an electronic meeting and transmits only those meeting objects to the participant's device.

Abstract: Computer implemented methods for concurrent processing of operations on a tree-based data structure include: receiving input at a storage system managing a storage device in which the tree-based data structure is stored, the input identifying a set of heterogeneous operations to be applied to the tree-based data structure; determining one or more nodes of the tree-based data structure to which one or more of the set of heterogeneous operations are to be applied; and performing one or more of the set of heterogeneous operations concurrently and in bulk. Systems and methods for accomplishing the same are also disclosed.

Abstract: A method, non-transitory computer readable medium, and web content management server device that sends each of a plurality of jobs requiring execution in order to service a received web service request to one of a plurality of slave web services configured to execute the plurality of jobs in parallel. A response from each of the plurality of slave web services is received. A web service response is generated based on the received responses. The generated web service response is provided in response to the received web service request.

Abstract: An aspect includes concurrently executing two or more transactions over a database. A plurality of transactions is executed in parallel while recording each transaction's sensitivities and output deltas. A sensitivity of a transaction identifies an aspect of a database state whose modification has a potential of altering an output of the transaction, and an output delta of the transaction indicates a change to the database state that is a result of the transaction being executed. The output deltas are fed from a first transaction through a filter for a second transaction. The filter is based on the second transaction's sensitivities. The filtered deltas are processed in the second transaction to incrementally compute revised deltas and sensitivities for the second transaction. For each transaction that successfully commits, the transaction's deltas are applied to update the database.

Abstract: One embodiment provides a method for runtime piggybacking of concurrent data-parallel jobs in task-parallel machine learning (ML) programs including intercepting, by a processor, executable jobs including executable map reduce (MR) jobs and looped jobs in a job stream. The processor queues the executable jobs, and applies runtime piggybacking of multiple jobs by processing workers of different types. Runtime piggybacking for a ParFOR (parallel for) ML program is optimized including configuring the runtime piggybacking based on processing worker type, degree of parallelism and minimum time thresholds.

Abstract: Techniques for encoding data storage systems using grid encoded data storage systems are described herein. Data to be stored in a data storage system is obtained and the data is stored in a grid of shards using grid encoding techniques that store the data in a combination of data shards and derived shards. Each of the shards has at least a first index corresponding to one dimension of the grid and a second index corresponding to a second dimension of the grid. Loss of a plurality of data shards can be repaired because each shard is reproducible from one or more shards with a first index that is associated with the first index of the shard and is also reproducible from one or more shards with a second index that is associated with the second index of the shard.

Abstract: A remoting client and a remoting server are described. In one embodiment, the remoting client has a client remote access application, a client invoker, a marshaller, and an unmarhaller. The client remote access application provides a version indicator of the client remote access application and receives a version indicator of a server remote access application. The client invoker generates an invocation request including the version indicator of the client remote access application. The client remote access application determines a compatible version between the client remote access application and the server remote access application based on the version indicator of the client remote access application and the version indicator of the server remote access application.

Abstract: Provided are a computer program product, system, and method for using cache lists for processors to determine tracks in a storage to demote from a cache. Tracks in the storage stored in the cache are indicated in lists. There is one list for each of a plurality of processors. Each of the processors processes the list for that processor to process the tracks in the cache indicated on the list. There is a timestamp for each of the tracks indicated in the lists indicating a time at which the track was added to the cache. Tracks indicated in each of the lists having timestamps that fall within a range of timestamps are demoted.

Abstract: Techniques for incrementally updating grid encoding data storage systems are described herein. A grid of shards with a plurality of virtual shards is created where each virtual shard is a representation of a shard in the grid of shards that is not backed by a data storage device and where each shard of the grid of shards has an index value. Data is then stored in the grid of shards by updating a shard to store the data and by also updating a second shard based on a set of shards with the same index value as the shard updated to store the data.

Abstract: A method for diagnosing computer readable instructions related to transfers of control is disclosed. A state transition of a unit of execution within a logical operation is logged during runtime of the computer readable instructions. Diagnostic information of the logical operation is associated with the state transition. The state transition and associated diagnostic information is provided for retrieval at a selected point in the computer readable instructions.

Abstract: Testing computer software applications is performed by identifying first and second executable portions of the computer software application, where the portions are configured to access a data resource, and where at least one of the portions is configured to write to the data resource, instrumenting the computer software application by inserting one or more instrumentation instructions into one or both of the portions, where the instrumentation instruction is configured to cause execution of the portion being instrumented to be extended by a randomly-determined amount of time, and testing the computer software application in multiple iterations, where the computer software application is executed in multiple parallel execution threads, where the portions are independently executed at least partially in parallel in different threads, and where the computer software application is differently instrumented in each of the iterations.

Abstract: Described systems and methods enable enforcing application control remotely and automatically, on a relatively large number of client systems (e.g., a corporate network, a virtual desktop infrastructure system, etc.). An application control engine executes outside a virtual machine exposed on a client system, the application control engine configured to enforce application control within the virtual machine according to a set of control policies. When a policy indicates that a specific process is not allowable on the respective client system, the app control engine may prevent execution of the respective process. To assist in data gathering and/or other activities associated with application control, some embodiments temporarily drop a control agent into the controlled virtual machine.

Abstract: Methods, apparatus and articles of manufacture are disclosed to retire hosts in virtual server rack deployments for virtual computing environments. An example method includes determining, via a processor, a workload associated with a physical host in a virtualized rack in response to a request to retire the physical host, the workload implemented by a virtual computing environment including the virtualized rack. The example method also includes determining, via the processor, a projected impact of retiring the physical host on the workload. The example method also includes presenting information representative of the projected impact.