Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Fostering collaboration among CPS professionals in academia, government, and industry
CPS-VO
combinatorial mathematics
biblio
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Submitted by
grigby1
on Mon, 01/21/2019 - 11:38am
data structures
pubcrawl
Human behavior
Metrics
Resiliency
Scalability
computational complexity
Data models
graph theory
Adaptation models
Approximation algorithms
query processing
computer science
Heuristic algorithms
adaptive adversarial model
adaptive adversaries applied
approximate fill degrees
approximate greedy minimum degree orderings
approximation theory
combinatorial mathematics
combinatorial scientific computing
graph sketching
matrix elimination orderings
minimum degree algorithm
minimum fill degree
nearly-linear time algorithm
oblivious adversary model
polylogarithmic time
provable approximation
randomised algorithms
randomized data structure
sketching data structure
Sparse matrices
Adversary Models
biblio
Automatically Repairing Web Application Firewalls Based on Successful SQL Injection Attacks
Submitted by
grigby1
on Thu, 06/07/2018 - 2:13pm
Automated Testing
collaboration
combinatorial mathematics
combinatorial optimisation problem
Decision trees
filter rules
firewalls
Firewalls (computing)
genetic algorithms
Human behavior
internet
learning (artificial intelligence)
legitimate requests
machine learning
multiobjective genetic algorithms
Policy
policy-based governance
Policy-Governed Secure Collaboration
privacy
program testing
pubcrawl
Regular Expression Inference
Resiliency
search problems
software maintenance
SQL
SQL injection
SQL Injection attacks
testing
vulnerabilities detection
vulnerable WAFs
WAF rule set
web application firewalls
Web application firewalls repair
web security
biblio
Prioritization of MTTC-based combinatorial evaluation for hypothesized substations outages
Submitted by
grigby1
on Tue, 03/07/2017 - 12:42pm
combinatorial mathematics
Combinatorial verification
Computer crime
cyber-contingency analysis
hypothesized substation outage
IEEE 30-bus system
IEEE standards
Indexes
mean time to compromise (MTTC)
MTTC-based combinatorial evaluation prioritization
power generation reliability
power system reliability
pubcrawl170109
randomly generated mean-time-to-compromise value
Reliability
risk indices
risk management
S-select-k problem
substation protection
substation ranking
Substations
Topology
biblio
Fault subspace selection and analysis of relative changes based reconstruction modeling for multi-fault diagnosis
Submitted by
BrandonB
on Wed, 05/06/2015 - 1:32pm
abnormal process behaviors
aggregative fault subspace calculation
aggregative reconstruction-based fault diagnosis strategy
alarming signal elimination
analysis of relative changes
analysis-of-relative changes based reconstruction modeling
Analytical models
combinatorial fault nature analysis
combinatorial mathematics
Data models
fault diagnosis
fault subspace selection
fault subspace selection strategy
historical fault data
historical fault library
industrial processes
joint fault effects
Joints
Libraries
Monitoring
multi-fault diagnosis
multifault diagnosis
online fault diagnosis
partial least squares
principal component analysis
reconstruction modeling
reconstruction-based fault diagnosis
regression analysis
related statistical characteristics analysis
Tennessee Eastman benchmark process
biblio
Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract)
Submitted by
BrandonB
on Fri, 05/01/2015 - 7:40am
additive decomposition
Additives
algebraic immunity
binary strings
Boolean functions
combinatorial conjecture
combinatorial mathematics
cryptographic significant Boolean functions
Cryptography
Electronic mail
FAA
fast algebraic attacks
finite field
generalized Tu-Deng functions
information theory
optimal algebraic degree
Transforms
unbalanced functions
biblio
Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract)
Submitted by
BrandonB
on Thu, 04/30/2015 - 11:49am
additive decomposition
Additives
algebraic immunity
binary strings
Boolean functions
combinatorial conjecture
combinatorial mathematics
cryptographic significant Boolean functions
Cryptography
Electronic mail
FAA
fast algebraic attacks
finite field
generalized Tu-Deng functions
information theory
optimal algebraic degree
Transforms
unbalanced functions
