ONLINE FACE CLUSTERING
    42.
    发明申请

    公开(公告)号:US20200293759A1

    公开(公告)日:2020-09-17

    申请号:US16814453

    申请日:2020-03-10

    Abstract: Methods and systems for image clustering include matching a new image to a representative image of a cluster. The new image is set as a representative of the cluster with a first time limit. The new image is set as a representative of the cluster with a second time limit, responsive to a determination that the new image has matched at least one incoming image during the first time limit.

    USECASE SPECIFICATION AND RUNTIME EXECUTION
    43.
    发明申请

    公开(公告)号:US20200293371A1

    公开(公告)日:2020-09-17

    申请号:US16809154

    申请日:2020-03-04

    Abstract: A computer-implemented method includes obtaining a usecase specification and a usecase runtime specification corresponding to the usecase. The usecase includes a plurality of applications each being associated with a micro-service providing a corresponding functionality within the usecase for performing a task. The method further includes determining that at least one instance of the at least one of the plurality of applications can be reused during execution of the usecase based on the usecase specification and the usecase runtime specification, and reusing the at least one instance during execution of the usecase.

    Real-time Abnormal Change Detection in Graphs
    44.
    发明申请
    Real-time Abnormal Change Detection in Graphs 有权
    图形中的实时异常变化检测

    公开(公告)号:US20160110404A1

    公开(公告)日:2016-04-21

    申请号:US14831775

    申请日:2015-08-20

    Abstract: A method is provided for detecting abnormal changes in real-time in dynamic graphs. The method includes extracting, by a graph sampler, an active sampled graph from an underlying base graph. The method further includes merging, by a graph merger, the active sampled graph with graph updates within a predetermined recent time period to generate a merged graph. The method also includes computing, by a graph diameter computer, a diameter of the merged graph. The method additionally includes determining, by a graph diameter change determination device, whether a graph diameter change exists. The method further includes generating, by an alarm generator, a user-perceptible alarm responsive to the graph diameter change.

    Abstract translation: 提供了一种用于在动态图中实时检测异常变化的方法。 该方法包括通过图形采样器从底层基础图提取活动采样图。 该方法还包括通过图形合并将活动采样图与预定的最近时间段内的图更新进行合并,以生成合并图。 该方法还包括通过图形直径计算机计算合并图的直径。 该方法还包括通过图形直径变化确定装置确定是否存在图形直径变化。 该方法还包括响应于图形直径变化,通过报警发生器生成用户可感知的报警。

    Large-Scale, Dynamic Graph Storage and Processing System
    45.
    发明申请
    Large-Scale, Dynamic Graph Storage and Processing System 审中-公开
    大型动态图形存储和处理系统

    公开(公告)号:US20160110134A1

    公开(公告)日:2016-04-21

    申请号:US14831792

    申请日:2015-08-20

    Abstract: A graph storage and processing system is provided. The system includes a scalable, distributed, fault-tolerant, in-memory graph storage device for storing base graph data representative of graphs. The system further includes a real-time, in memory graph storage device for storing update graph data representative of graph updates for the graphs with respect to a time threshold. The system also includes an in-memory graph sampler for sampling the base graph data to generate sampled portions of the graphs and for storing the sampled portions of the graph. The system additionally includes a query manager for providing a query interface between applications and the system and for forming graph data representative of a complete graph from at least the base graph data and the update graph data, if any. The system also includes a graph computer for processing the sampled portions using batch-type computations to generate approximate results for graph-based queries.

    Abstract translation: 提供图形存储和处理系统。 该系统包括可扩展的,分布式的,容错的存储器内存图形存储装置,用于存储表示图形的基本图形数据。 该系统还包括一个实时存储器图形存储装置,用于存储代表图形关于时间阈值的图形更新的更新图形数据。 该系统还包括存储器内图形采样器,用于对基本图形数据进行采样以生成图形的采样部分并存储图形的采样部分。 该系统还包括查询管理器,用于在应用和系统之间提供查询接口,并且用于从至少基本图形数据和更新图形数据(如果有的话)形成表示完整图形的图形数据。 该系统还包括用于使用分批式计算来处理采样部分以生成基于图的查询的近似结果的图形计算机。

    SOURCE-TO-SOURCE COMPILER AND RUN-TIME LIBRARY TO TRANSPARENTLY ACCELERATE STACK OR QUEUE-BASED IRREGULAR APPLICATIONS ON MANY-CORE ARCHITECTURES
    46.
    发明申请
    SOURCE-TO-SOURCE COMPILER AND RUN-TIME LIBRARY TO TRANSPARENTLY ACCELERATE STACK OR QUEUE-BASED IRREGULAR APPLICATIONS ON MANY-CORE ARCHITECTURES 有权
    源代码源编译器和运行时库可以在多个体系结构中进行快速加速堆栈或基于队列的非正式应用

    公开(公告)号:US20150242323A1

    公开(公告)日:2015-08-27

    申请号:US14631255

    申请日:2015-02-25

    CPC classification number: G06F5/14 G06F8/30 G06F8/4434

    Abstract: Systems and methods for system for source-to-source transformation for optimizing stacks and/or queues in an application, including identifying usage of stacks and queues in the application and collecting the resource usage and thread block configurations for the application. If the usage of stacks is identified, optimized code is generated by determining appropriate storage, partitioning stacks based on determined storage, and caching tops of the stacks in a register. If the identifier identifies usage of queues, optimized code is generated by combining queue operations in all threads in a warp/thread block into one batch queue operation, converting control divergence of the application to data divergence to enable warp-level queue operations, determining whether at least one of the threads includes a queue operation, and combining queue operations into threads in a warp.

    Abstract translation: 用于源到源转换的系统和方法,用于优化应用程序中的堆栈和/或队列,包括识别应用程序中堆栈和队列的使用情况,并收集应用程序的资源使用情况和线程块配置。 如果识别堆栈的使用,则通过确定适当的存储,基于确定的存储分区堆栈以及将堆栈的顶部缓存在寄存器中来生成优化的代码。 如果标识符识别队列的使用,则通过将经线/线程块中的所有线程中的队列操作组合成一个批量队列操作来生成优化的代码,将应用程序的控制分歧转换为数据发散以启用经线级队列操作,确定是否 线程中的至少一个包括队列操作,并将队列操作合并到warp中的线程中。

    KNAPSACK-BASED SHARING-AWARE SCHEDULER FOR COPROCESSOR-BASED COMPUTE CLUSTERS
    47.
    发明申请
    KNAPSACK-BASED SHARING-AWARE SCHEDULER FOR COPROCESSOR-BASED COMPUTE CLUSTERS 审中-公开
    用于基于共存器的计算机组的基于KNAPSACK的共享调度器

    公开(公告)号:US20150113542A1

    公开(公告)日:2015-04-23

    申请号:US14506256

    申请日:2014-10-03

    CPC classification number: G06F9/5066 H04L67/1023

    Abstract: A method is provided for controlling a compute cluster having a plurality of nodes. Each of the plurality of nodes has a respective computing device with a main server and one or more coprocessor-based hardware accelerators. The method includes receiving a plurality of jobs for scheduling. The method further includes scheduling the plurality of jobs across the plurality of nodes responsive to a knapsack-based sharing-aware schedule generated by a knapsack-based sharing-aware scheduler. The knapsack-based sharing-aware schedule is generated to co-locate together on a same computing device certain ones of the plurality of jobs that are mutually compatible based on a set of requirements whose fulfillment is determined using a knapsack-based sharing-aware technique that uses memory as a knapsack capacity and minimizes makespan while adhering to coprocessor memory and thread resource constraints.

    Abstract translation: 提供了一种用于控制具有多个节点的计算集群的方法。 多个节点中的每一个具有相应的计算设备,其具有主服务器和一个或多个基于协处理器的硬件加速器。 该方法包括接收多个作业用于调度。 该方法还包括响应于由基于背包的共享感知调度器生成的基于背包的共享感知调度来跨多个节点调度多个作业。 基于背包的共享感知计划被生成以在同一计算设备上共同定位在基于使用基于背包的共享感知技术来确定其满足的一组需求的相互兼容的多个作业中的某些作业 其使用内存作为背包容量,并且在保持协处理器存储器和线程资源约束的同时最小化制造时间。

    Automatic asynchronous offload to many-core coprocessors
    48.
    发明授权
    Automatic asynchronous offload to many-core coprocessors 有权
    自动异步卸载到多核协处理器

    公开(公告)号:US08893103B2

    公开(公告)日:2014-11-18

    申请号:US13940974

    申请日:2013-07-12

    Abstract: Methods and systems for asynchronous offload to many-core coprocessors include splitting a loop in an input source code into a sampling sub-part, a many integrated core (MIC) sub-part, and a central processing unit (CPU) sub-part; executing the sampling sub-part with a processor to determine loop characteristics including memory- and processor-operations executed by the loop; identifying optimal split boundaries based on the loop characteristics such that the MIC sub-part will complete in a same amount of time when executed on a MIC processor as the CPU sub-part will take when executed on a CPU; and modifying the input source code to split the loop at the identified boundaries, such that the MIC sub-part is executed on a MIC processor and the CPU sub-part is concurrently executed on a CPU.

    Abstract translation: 用于异步卸载到多核协处理器的方法和系统包括将输入源代码中的循环分解成采样子部分,许多集成核心(MIC)子部分和中央处理单元(CPU)子部分; 使用处理器执行采样子部分以确定包括由循环执行的存储器和处理器操作的循环特性; 基于循环特性识别最佳分割边界,使得在CPU处理器上执行时,当CPU子部件在CPU上执行时,MIC子部件将在与MIC处理器上执行时相同的时间量完成; 并且修改输入源代码以在所识别的边界处分割循环,使得在MIC处理器上执行MIC子部分,并且CPU子部件在CPU上同时执行。

    Free flow fever screening
    49.
    发明授权

    公开(公告)号:US12201403B2

    公开(公告)日:2025-01-21

    申请号:US17325613

    申请日:2021-05-20

    Abstract: A method for free flow fever screening is presented. The method includes capturing a plurality of frames from thermal data streams and visual data streams related to a same scene to define thermal data frames and visual data frames, detecting and tracking a plurality of individuals moving in a free-flow setting within the visual data frames, and generating a tracking identification for each individual of the plurality of individuals present in a field-of-view of the one or more cameras across several frames of the plurality of frames. The method further includes fusing the thermal data frames and the visual data frames, measuring, by a fever-screener, a temperature of each individual of the plurality of individuals within and across the plurality of frames derived from the thermal data streams and the visual data streams, and generating a notification when a temperature of an individual exceeds a predetermined threshold temperature.

    RULE-BASED EDGE CLOUD OPTIMIZATION FOR REAL-TIME VIDEO ANALYTICS

    公开(公告)号:US20240403137A1

    公开(公告)日:2024-12-05

    申请号:US18678121

    申请日:2024-05-30

    Abstract: Systems and methods are provided for dynamically optimizing microservice placement in a distributed edge and cloud computing environment, including receiving application specifications that include telemetry data collection methods, placement rules, and modes of operation, validating the received application specifications to ensure completeness and correctness, and composing an application graph where vertices represent microservices and edges represent connections between the microservices. Availability of resources specified in the application graph is checked, and the microservices are deployed according to initial placement rules. Telemetry data from the deployed microservices and underlying infrastructure is collected and evaluated against the placement rules, and the placement of microservices is dynamically adjusted responsive to a determination that current microservice placement is suboptimal based on the evaluating of the collected telemetry data.

Patent Agency Ranking