Abstract: The technology described herein is directed towards executing continuous query tasks for monitoring a data storage system to obtain real-time metrics and store query results, in which the continuous query tasks are resource-demanding yet need to execute on limited system resources. A continuous query tasks scheduler levels the load produced by scheduling continuous query tasks with starting time offsets based on the period of continuous query tasks and load descriptions for the tasks. Further, a continuous query task that produces too high of a workload is divided into continuous query subtasks, which are scheduled at subtask starting time offsets.

Abstract: An information handling system may determine that a first process of a list of processes is a top-ranked process and may adjust one or more settings of the information handling system associated with the first process. The information handling system may monitor performance parameters of the information handling system following the adjustment of the settings. Based on monitoring the performance parameters, the information handling system may determine that a performance score of the information handling system is below a threshold performance score and may reduce a ranking of the first process based on the determination. The ranking of the first process may be reduced such that a second process becomes a new top-ranked process. The information handling system may then adjust one or more settings associated with the second process.

Abstract: Techniques for ensuring that, in the context of network traffic load-balanced across a plurality of service devices connected to a network device, all of the bi-directional traffic between a given pair of hosts residing in different domains is sent to the same service device, where a “domain” is a group of one or more hosts/subnets that is reachable by a service device via an interface of that device. In one set of embodiments, these techniques can include (1) creating a load balancer group on the network device for each domain defined on the service devices, such that the load balancer group for a given domain D includes all of the service device interfaces mapped to D, (2) enabling symmetric hashing with respect to each load balancer group, and (3) synchronizing the hash tables of the load balancer groups such that a given hash bucket (across all hash tables) maps to an interface of a single service device.

Abstract: Techniques disclosed herein relate to migrating virtual computing instances such as virtual machines (VMs). In one embodiment, VMs are migrated across different virtual infrastructure platforms by, among other things, translating between resource models used by virtual infrastructure managers (VIMs) that manage the different virtual infrastructure platforms. VM migrations may also be validated prior to being performed, including based on resource policies that define what is and/or is not allowed to migrate, thereby providing compliance and controls for borderless data centers. In addition, an agent-based technique may be used to migrate VMs and physical servers to virtual infrastructure, without requiring access to an underlying hypervisor layer.

Abstract: A system for generating a user interface described herein can include a processor to detect a plurality of display characteristics from a user interface manager, wherein the plurality of display characteristics correspond to a type of a device. The processor can also detect a list of applications being executed by the system and generate a user interface container by applying the plurality of display characteristics to each of the applications from the list of applications.

Abstract: An arithmetic processing device includes: a decoder configured to write an immediate value to a register in a case where an instruction to be executed is an instruction not involving data reading from the register; and a processor configured to read data from the register and write a computing result based on the read data to the register in a case where an instruction to be executed by the decoder is an instruction involving data reading from the register.

Abstract: Embodiments of the present invention set forth techniques for allocating execution resources to groups of threads within a graphics processing unit. A compute work distributor included in the graphics processing unit receives an indication from a process that a first group of threads is to be launched. The compute work distributor determines that a first subcontext associated with the process has at least one processor credit. In some embodiments, CTAs may be launched even when there are no processor credits, if one of the TPCs that was already acquired has sufficient space. The compute work distributor identifies a first processor included in a plurality of processors that has a processing load that is less than or equal to the processor loads associated with all other processors included in the plurality of processors. The compute work distributor launches the first group of threads to execute on the first processor.

Abstract: An extraction unit (21) treats two or more consecutive frames of a plurality of frames constituting video data as a time-window frame, and extracts a plurality of time-window frames from the video data so as to cause at least one frame to be overlappingly included in adjacent time-window frames. A tracking unit (22) treats each time-window frame as a target time-window frame, and tracks target objects in the target time-window frame to generate a tracking result. An integration unit (23) integrates tracking results generated in individual time-window frames, based on a frame overlappingly included in more than one time-window frame, to generate an integration result.

Abstract: Methods and systems are provided for schedule deconfliction to enhance cooperation among heterogeneous teams of autonomous agents in situations where communication is severely limited. A dynamic scheduling framework, referred to herein as the Generous Agent Algorithm (GAA), organically deconflicts redundant service tasks as agents from distinct teams come into conflict and discover one another. Individual agents within a localized area can communicate their schedules to one another. Using the GAA, the agents propose modified schedules, vacating their most costly task from their schedules, while simultaneously augmenting their schedules with another agent's vacated task. The action taken by an agent does not increase an agent's makespan beyond the time set by that agent's team. Thus, the methods and systems, ensure that schedule alterations are done without degrading a team's global makespan.

Abstract: The technology disclosed presents a novel spatial attention model that uses current hidden state information of a decoder long short-term memory (LSTM) to guide attention and to extract spatial image features for use in image captioning. The technology disclosed also presents a novel adaptive attention model for image captioning that mixes visual information from a convolutional neural network (CNN) and linguistic information from an LSTM. At each timestep, the adaptive attention model automatically decides how heavily to rely on the image, as opposed to the linguistic model, to emit the next caption word. The technology disclosed further adds a new auxiliary sentinel gate to an LSTM architecture and produces a sentinel LSTM (Sn-LSTM). The sentinel gate produces a visual sentinel at each timestep, which is an additional representation, derived from the LSTM's memory, of long and short term visual and linguistic information.

Abstract: A method, computer program product, and computing system for executing a first sub-thread of an operating system thread on a central processing unit (CPU) of the computing device. The CPU may be released for a defined period of time. One of an application and a second sub-thread of the operating system thread may be executed based upon, at least in part, an execution priority of the operating system thread and an execution priority of the application.

Abstract: A method of activating scheduling instructions within a parallel processing unit includes checking if an ALU targeted by a decoded instruction is full by checking a value of an ALU work fullness counter stored in the instruction controller and associated with the targeted ALU. If the targeted ALU is not full, the decoded instruction is sent to the targeted ALU for execution and the ALU work fullness counter associated with the targeted ALU is updated. If, however, the targeted ALU is full, a scheduler is triggered to de-activate the scheduled task by changing the scheduled task from the active state to a non-active state. When an ALU changes from being full to not being full, the scheduler is triggered to re-activate an oldest scheduled task waiting for the ALU by removing the oldest scheduled task from the non-active state.

Abstract: An information processing method includes storing, in a memory, a sound signal transmitted from the outside by using a first transmission method in which a bandwidth is guaranteed and timing is restricted, and processing, using a processor, the sound signal stored in the memory upon a predetermined data size of the sound signal being stored in the memory.

Abstract: Methods and apparatus for efficient data transfer within a user space network stack. Unlike prior art monolithic networking stacks, the exemplary networking stack architecture described hereinafter includes various components that span multiple domains (both in-kernel, and non-kernel). For example, unlike traditional “socket” based communication, disclosed embodiments can transfer data directly between the kernel and user space domains. Direct transfer reduces the per-byte and per-packet costs relative to socket based communication. A user space networking stack is disclosed that enables extensible, cross-platform-capable, user space control of the networking protocol stack functionality. The user space networking stack facilitates tighter integration between the protocol layers (including TLS) and the application or daemon. Exemplary systems can support multiple networking protocol stack instances (including an in-kernel traditional network stack).

Abstract: According to examples, an apparatus may include a processor and a non-transitory computer readable medium having instructions that when executed by the processor, may cause the processor to partition a matrix of elements into a plurality of sub-matrices of elements. Each sub-matrix of the plurality of sub-matrices may include elements from a set of columns of the matrix of elements that includes a nonzero element. The processor may also assign elements of the plurality of sub-matrices to a plurality of crossbar devices to maximize a number of nonzero elements of the matrix of elements assigned to the crossbar devices.

Abstract: A method and system for allocating memory to a memory operation executed by a processor in a computer arrangement having a plurality of processors. The method includes receiving a memory operation from a processor that receives a memory operation from a processor that references an address in a shared memory, mapping the received memory operation to at least one of a plurality of virtual memory pools to produce a mapping result, and providing the mapping result to the processor.

Abstract: A radio communication system includes one or more user terminals and one or more base stations that execute time division radio communication using a time division duplex (TDD) system. A radio frame is a radio communication resource used in the time division radio communication, and includes a downlink subframe that is a transmission period of a downlink signal, a special subframe including a guard period that is used neither for transmission of a downlink signal nor for transmission of an uplink signal, and an extended subframe that is used as either a transmission period of a downlink signal or a transmission period of an uplink signal, in accordance with a scheduling by the base station.

Abstract: The present disclosure relates to a transaction licensing system (TLS) for managing transactions and entitlements in a cloud-based system, wherein a transaction is a communication with an external server. The TLS includes at least one transaction licensing database (TLDB) that is configure to store entitlement and transaction data. The entitlements may include a general entitlement pool, as well as specialized entitlement pools with entitlements for executing particular transactions. The TLS is configured to determine identifying information for a transaction and then use this information to determine whether the general or specialized entitlement pools associated with the transaction has entitlements available in the TLDB to execute the transaction. When a suitable entitlement is determined to be available, the transaction is executed and the general or specialized entitlement pool is appropriately decremented. When no suitable entitlements are available, the TLS returns an exception.

Abstract: A system and method for scheduling of hyper-threaded CPUs using memory monitoring includes a memory with an operating system memory and a physical processor in communication with the memory. The physical processor includes a first hyper-thread and a second hyper-thread. A monitor instruction to monitor for updates to a designated memory location is executed in the first hyper-thread. The system further includes an operating system to execute on the physical processor and a system call configured to record in the operating system memory that the first hyper-thread is in a memory wait state. The system call is further configured to execute a memory wait instruction in the first hyper-thread. A task is executed in the second hyper-thread while the first hyper-thread is in the memory wait state.

Abstract: A device for computing data models, in particular comprising the possibility to detect errors occurring during the computation, has at least two processing units, at least one of the at least two processing units being designed to compute a main data model as a function of at least one state of a system, at least one other of the at least two processing units being designed to compute, as a function of this at least one state of the system, an approximation data model associated with the main data model, the main data model comprising at least one property of the system as a first data model, the approximation data model comprising at least the same property of the system approximately as a second data model, a comparator unit being designed to compare a first result of a first computation of the main data model with a second result of a second computation of the approximation data model associated with the main data model, in order to determine information about a deviation between the first result and the s

Abstract: A data request workflow system comprises a vehicle operational data. A file processing system receives the vehicle operational data. At least one set of predefined file editing rules automatically applies the at least one set of predefined file editing rules to automatically edit vehicle operational data such that the vehicle operational data cannot be linked to a specific vehicle operator.

Abstract: The present disclosure discloses a method and apparatus for determining video material of news. The method for determining video material of news comprises: recognizing a person name in a news text; searching a video based on the person name, to obtain a to-be-selected video; extracting a key frame in the to-be-selected video; recognizing a person in the key frame to obtain identity information of the person; and determining the to-be-selected video as video material of news, in response to the identity information of the person conforming to the person name. The present disclosure improves the consistency between the video material of the news and the news text.

Abstract: A method and device for sound effect processing, and a non-transitory storage medium. The method includes the following actions. A task manager is traversed to determine whether a sound effect service process for a sound effect service exists. Responsive to determining that the sound effect service process exists, whether the sound effect service process is a system process of a system, is determined. When the sound effect service process is not a system process of the system, the sound effect service process is set to be a system process of the system.

Abstract: A task management method is disclosed. The method includes sending a query command by a host to an electronic storage device at a variable interval to determine a status of a task queue of the electronic storage device; obtaining a response information. The response information includes a status of the task queue, and the status of the task queue includes an information about whether a task preparation in the task queue is to be completed.

Abstract: An exception stack information acquisition method, including: when a preset exception signal is sensed in a running process of a project, calling and executing an exception signal processing function to acquire first exception stack information of a native layer; reading second exception stack information recorded by an Application (APP) layer when the exception signal is sensed; and assembling the first exception stack information and the second exception stack information to obtain assembled information, then reporting the assembled information to a server, and aborting the project after reporting is completed.

Abstract: A method and system for streaming multimedia data over a communication network. Each segment of multiple segments is associated with at least two data blocks of multiple data blocks. The segments are sequenced according to a unique stream index for one stream associated with multimedia content. The unique stream index for the one stream is assigned a main index that describes multiple streams for the multimedia content. The multiple streams include the one stream. A request for content of the multimedia content is received. The request specifies a data chunk, of the multiple data chunks, that denotes the requested content. The main index is analyzed with respect to the specified data chunk to determine the stream and segments and/or data blocks therein that encompass the requested content. The determined stream and segments and/or data blocks therein are transmitted over the communication network in response to the request.

Abstract: Technologies for network packet processing include a computing device that receives incoming network packets. The computing device adds the incoming network packets to an input lockless shared ring, and then classifies the network packets. After classification, the computing device adds the network packets to multiple lockless shared traffic class rings, with each ring associated with a traffic class and output port. The computing device may allocate bandwidth between network packets active during a scheduling quantum in the traffic class rings associated with an output port, schedule the network packets in the traffic class rings for transmission, and then transmit the network packets in response to scheduling. The computing device may perform traffic class separation in parallel with bandwidth allocation and traffic scheduling. In some embodiments, the computing device may perform bandwidth allocation and/or traffic scheduling on each traffic class ring in parallel.

Abstract: An electronic device with a display and a touch-sensitive surface displays a first user interface of a first application. The device detects a first input by a first contact on the touch-sensitive surface that meets navigation-gesture criteria requiring that the first input includes a movement of the first contact across the touch-sensitive surface that crosses a boundary of a predefined edge region of the touch-sensitive surface in order for the navigation-gesture criteria to be met. In response, the device: in accordance with a determination that the first application is not protected, ceases to display the first user interface of the first application and displays a respective other user interface on the display; and in accordance with a determination that the first application is protected, maintains display of the first user interface of the first application without displaying the respective other user interface.

Abstract: A processor core and methods for managing the processor core. The processor core comprises of a plurality of lanes, each lane comprising a copy of a register file logically shared across the plurality lanes and a plurality of functional units, at least two of the functional units sharing a common cache and a common control unit, where the common control unit concurrently dispatches multiple consecutive instances of an instruction corresponding to multiple successive instances of an inner loop to the plurality of functional units of at least a proper subset of the plurality of lanes; and one or more registers of each copy of the register file, each register being configurable to write a data result from at least one of the functional units to a register in a lane-local mode, a lane-forward mode, and a normal mode.

Abstract: A system (100) may include a computer-readable storage medium (220) configured to store a first set of instructions for determining one or more candidate driver terminals (140) to accept a service request; and a processor (210) in communication with the computer-readable storage medium (220), wherein when executing the first set of instructions, the processor (210) is directed to: establish a communication with a passenger terminal (130); obtain a service request including a position of the passenger terminal (130) from the passenger terminal (410); determine a wireless fidelity (WiFi) station based on the position of the passenger terminal (420); determine one or more driver terminals (140) that access the WiFi station (430); determine an access instance of each of the one or more driver terminals (440); and determine one or more candidate driver terminals (140) among the one or more driver terminals (140) based on the one or more access instances of the one or more driver terminals (450).

Abstract: Data processing circuitry comprises a set of two or more computational units to perform respective computational operations; an instruction decoder to decode successive data processing instructions and, for a given data processing instruction, to control one or more of the computational units to perform those computational operations required to execute the given data processing instruction; and control circuitry responsive to the given data processing instruction, to control one or more others of the computational units to perform further computational operations, other than the computational operations required to execute the given data processing instruction, during execution of the given data processing instruction.

Abstract: Example object storage systems and methods provide priority metadata processing. Metadata operations are received in response to change events for at least one data object. The metadata operations may include system operations configured to manage changes to data objects and user-method operations configured to execute user-defined methods using the data objects. System operations are executed with a first priority in response to system operations with the first priority being available for processing. User-method operations are executed with a second priority in response to no metadata operations with the first priority being available for processing.

Abstract: A method of controlling a data processing device, the method comprising: receiving, at the data processing device, a communication from a remote device wherein the communication comprises verification data; verifying the verification data at the data processing device; initiating an action by a watchdog associated with the data processing device based on the verification.

Abstract: Embodiments of the present disclosure disclose a broadcast message management method, including: receiving a broadcast message sent by a target application program; determining a user experience assurance priority of the target application program, and determining a target broadcast queue corresponding to the target application program; saving the broadcast message in the target broadcast queue; and when a broadcast message scheduling request is received, scheduling, according to a target broadcast message scheduling priority corresponding to the target broadcast queue, the broadcast message stored in the target broadcast queue. The embodiments of the present disclosure further disclose a broadcast message management apparatus.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating data items. One of the systems is a neural network system comprising a memory storing a plurality of template data items; one or more processors configured to select a memory address based upon a received input data item, and retrieve a template data item from the memory based upon the selected memory address; an encoder neural network configured to process the received input data item and the retrieved template data item to generate a latent variable representation; and a decoder neural network configured to process the retrieved template data item and the latent variable representation to generate an output data item.

Abstract: A method and device for sound effect processing, and a non-transitory storage medium. The method includes the following actions. A task manager is traversed to determine whether a sound effect service process for a sound effect service exists. Responsive to determining that the sound effect service process exists, whether the sound effect service process is a system process of a system, is determined. When the sound effect service process is not a system process of the system, the sound effect service process is set to be a system process of the system.

Abstract: Systems, methods, and software for data calculation frameworks for user applications are provided herein. An exemplary method includes registering dynamic functions for use by a calculation engine of the user application, coupling calls made by the calculation engine for the dynamic functions to services that host the dynamic functions, and monitoring availability status for the dynamic functions related to availability of the dynamic functions to process expressions associated with the calculation engine.

Abstract: Provided are a computer program product, system, and method for managing processor threads of a plurality of processors. In one embodiment, a parameter of performance of the computing system is measured, and the configurations of one or more processor nodes are dynamically adjusted as a function of the measured parameter of performance. In this manner, the number of processor threads being concurrently executed by the plurality of processor nodes of the computing system may be dynamically adjusted in real time as the system operates to improve the performance of the system as it operates under various operating conditions. It is appreciated that systems employing processor thread management in accordance with the present description may provide other features in addition to or instead of those described herein, depending upon the particular application.

Abstract: Performance in multi-core data storage systems is increased while allowing for portability and fast failover in the event of a failure of a driver stack by a data storage system employing several queues to reduce lock contention. Queueing is performed with two levels of several queues each within a userspace scheduling driver within a userspace container. The userspace scheduling driver may dequeue into a userspace management driver that communicates with a kernel-based hardware driver by way of a kernel helper driver. An apparatus, system, and computer program product for performing a similar method are also provided.

Abstract: There is provided a method for coordinated scheduling between real-time processes. The method is performed by a central scheduler. The method comprises acquiring information on runtimes and deadlines for real-time processes of tasks for local schedulers to be executed on shared computing resources. The method comprises scheduling the real-time processes based on the runtimes and deadlines so as to keep the deadlines during execution of the real-time processes. There is also provided a central scheduler configured to perform such a method. There is also provided a computer program comprising computer program code which, when run on a processing unit of a central scheduler causes the processing unit to execute such a method.

Abstract: The present disclosure provides a web page processing method. The method includes obtaining web page elements after web page rendering is performed on a to-be-accessed web page; detecting whether an abnormal element exists in the web page elements; generating and displaying an interaction entrance on the to-be-accessed web page if an abnormal element exists in the web page elements; and obtaining a trigger operation on the interaction entrance and filtering out the abnormal element in response to the trigger operation.

Abstract: Various embodiments provide an electronic device and a method, the electronic device comprising: a memory; a first processor; a second processor which has attributes different from those of the first processor; and a control unit, wherein the control unit is configured to identify a task loaded into the memory, select which of the first processor and the second processor is to execute the task, on the basis of attribute information corresponding to a user interaction associated with the task, and allocate the task to the selected processor. Other embodiments are also possible.

Abstract: Initializing a data structure for use in predicting table of contents (TOC) pointer values. A request to load a module is obtained. Based on the loaded module, a pointer value for a reference data structure is determined. The pointer value is stored in a reference data structure tracking structure, and used to access a variable value for a variable of the module.

Abstract: Systems, methods, and software are disclosed herein that enhance drawing technology in application user interfaces. In an implementation, a guide object is disclosed herein that allows a user to draw against the guide object, position other objects against, and otherwise interact with the guide object as-if it were a stencil. The guide object may be presented as a drawing tool in a user interface to an application that a user may invoke by user input to assist with the creation of content on a canvas. As a line is drawn proximate to the guide object, for example, or as a shape is positioned nearby the guide object, the application obtains guidance information from the guide object that allows the application to render the interaction between line or shape and the guide object as-if it were an actual stencil.

Abstract: The detecting method includes: obtaining a testing signal, perform at least one action according to the testing signal, and transmit a request instruction comprising the testing signal; determining that whether the testing signal of the request instruction represents performing a testing mode by a processor; if the processor determines that the testing signal of the request instruction represents performing the testing mode, the processor requests a testing service device to provide at least one service corresponding to the request instruction; collecting a performing order when the processor performing the at least one action and a performing result of each one of the at least one action, and combine the performing order and the performing result as a to-be classified data; and calculating a detecting result according to the to-be classified data, wherein the detecting result represents that whether a snow ball effect will occur.

Abstract: The present application generally relates to methods and apparatus for evaluating and assigning a performance metric to a driver response to a driving scenario. More specifically, the application teaches a method and apparatus for breaking a scenario into features, assigning each feature a grade and generating an overall grade in response to a weighted combination of the grades.

Abstract: Systems and techniques of de-duplicating file and/or blobs within a file system are presented. In one embodiment, an email system is disclosed wherein the email system receives email messages comprising a set of associated attachments. The system determines whether the associated attachments have been previously stored in the email system, the state of the stored attachment, and if the state of the attachment is appropriate for sharing copies of the attachment, then providing a reference to the attachment upon a request to share the attachment. In another embodiment, the system may detect whether stored attachments are corrupted and, if so, attempt to repair the attachment, and possibly, prior to sharing references to the attachment.

Abstract: A system that displays geographic data is disclosed. During operation, the system receives a query to be processed, wherein the query is associated with a set of geographic regions. Next, the system uses a late-binding schema generated from the query to retrieve a set of data points from a set of events containing previously gathered data. Then, for each data point in a set of data points, the system identifies zero or more geographic regions in the set of geographic regions that the data point falls into. Finally, the system displays the set of geographic regions, wherein each polygon that defines a geographic region is marked to indicate a number of data points that fall into the polygon.

Abstract: A non-stop multi-host transaction processing environment may be created by receiving incoming user calls to components through a vestibule bank, and by utilizing an installation manager during the replacement of software. The installation manager may be used in connection with a vestibule bank to handle user calls during the installation of a replacement software component such that user calls for a component can be processed while that component is being replaced, without an error being passed back to the end user. During the replacement of a software component, user calls from the old component may be drained and diverted to a replacement component. User calls received during the installation may be queued and then routed to the replacement component once the component has been replaced.

Abstract: A computer-implemented method and computer processing system are provided for coordinated heap contraction. The method includes starting a contraction of a heap responsive to a physical memory use of the heap approaching a limit. The contraction starts from a particular runtime system that as estimated to be slowest for the contraction from among a plurality of runtime systems that use the heap, based on previously determined estimates. The method also includes decreasing the physical memory use of the heap by compacting the heap with only one Garbage Collection (GC) thread, responsive to the contraction of the heap being unable to catch up to the physical memory use.