US 2026/0056791 A1Published application

Secure digital detective system with self destruction capability

AssigneeWestGate Data Science LLC

InventorsCheryl Westgate, Fred Heath, Christopher Boren, Kevin Bersche, Kenneth Massey, Ph.D.

Life of this patent

Estimating the term…

Loading patent…

Abstract

The present disclosure provides techniques for identification of potential illicit activities (e.g., crimes) and/or abnormalities in large datasets. The techniques fuse data from various sources to purge normal records, analyze records using digital detective models, identify and utilize network-sequencing-chains to collect and process records, and generate reports (e.g., civic profile(s)) from the output of the digital detective models. The techniques comprise receiving data from data sources (e.g., government entities), pre-processing the data to determine records indicating illicit or abnormal behavior, determining crime types, inputting profiles into machine learning models trained to flag potential crimes, and generating encrypted data objects based on the output for review by authorized personnel. Robust security measures such as mission lock enforcement, quorum-governed privilege systems, and self-destruct capabilities may provide a digital security architecture to protect sensitive data and ensure system security.

Claims20

Dependent claims

A system for customized scheduling of enforcement tasks, the system comprising:

one or more processors;
and
one or more non-transitory computer-readable media storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
determining a resource capacity of the system, the resource capacity comprising at least one of an available computational throughput or a task-force personnel bandwidth;
selecting, from a master list of enforcement tasks, a candidate subset of tasks with a cumulative resource requirement that fails to exceed the resource capacity;
assigning each task in the candidate subset of tasks a priority score to generate a set of priority scores, the priority score associated with each candidate subset of tasks based at least in part on a weighted combination of at least one of:
a jurisdictional urgency associated with each task,
a severity level associated with each task, or
a current intake capacity of the system;
determining a target configuration associated with a population under enforcement, the target configuration comprising scheduling constraints and quality-of-service objectives tailored to the population;
generate, based at least in part on the resource capacity, the set of priority scores, and the target configuration, a batched execution schedule configured to:
group tasks in the candidate subset of tasks by a location, a type, or a resource profile associated with each task;
and
ordering each batch in the batched execution schedule by descending priority scores associated with each batch;
and
executing, based at least in part on the resource capacity, the candidate subset of tasks based at least in part on the batched execution schedule, wherein executing the candidate subset of tasks comprises dynamically monitoring execution progress and suspending or rescheduling lower-priority tasks if the resource capacity decreases more than a threshold.

13 more elements

A method comprising:

determining a resource capacity of a computing system;
selecting, from a list of tasks, a subset of tasks with an associated resource requirement that fails to exceed the resource capacity;
determining, for each task in the subset of tasks, a priority score;
identifying, based at least in part on a scheduling constraint and a service-level objective associated with demographic and geographic characteristics of a population associated with the list of tasks, a configuration associated with the population;
generating, by grouping the subset of tasks into one or more batches and ordering each batch in by descending priority score, an execution plan;
and
executing the one or more batches according to the execution plan, while monitoring execution metrics.

4 more elements

One or more non-transitory computer-readable media storing instructions that, when executed, cause one or more processors to perform operations comprising:

determining a resource capacity of a computing system;
selecting, from a list of tasks, a subset of tasks with an associated resource requirement that fails to exceed the resource capacity;
determining, for each task in the subset of tasks, a priority score;
identifying, based at least in part on a scheduling constraint and a service-level objective associated with demographic and geographic characteristics of a population associated with the list of tasks, a configuration associated with the population;
generating, by grouping the subset of tasks into one or more batches and ordering each batch in by descending priority score, an execution plan;
and
executing the one or more batches according to the execution plan while monitoring execution metrics.

4 more elements

Dependencies are inferred from the claim text.

Facts

Application: 19/279,571Filed 24 Jul 2025
Priority: 26 Aug 2024
Published: 26 Feb 2026
Term ends: Not estimatedThe source records don’t support an estimate.

Classification28 codes

G06Q 50/265
Government or public services: personal security, identity or safety
G06F 9/4881
By program, e.g. task dispatcher, supervisor, operating system: scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
G06F 9/5027
To service a request: the resource being a machine, e.g. CPUs, Servers, Terminals
G06F 9/5038
The resource being a machine, e.g. CPUs, Servers, Terminals: considering the execution order of a plurality of tasks, e.g. taking priority or time…