2011
DOI: 10.21236/ada552217
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic Process Decision Methods for Complex-Cyber-Physical Systems

Abstract: The public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Department of Defense, Washington Headquarters Services, Directorate for … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 8 publications
(14 reference statements)
0
7
0
Order By: Relevance
“…Spectral examples of nonentropic graph measure are maximum eigenvalue of adjacency matrix [49], sum of eigenvalues of adjacency matrix (also known as graph energy [6]), and determinant of adjacency matrix (which is the product of eigenvalues). Kolmogorov graph complexity measures such as linear graph complexity [50] are based on size of the minimal code that reconstructs the graph.…”
Section: O M P L E X I T Ymentioning
confidence: 99%
See 1 more Smart Citation
“…Spectral examples of nonentropic graph measure are maximum eigenvalue of adjacency matrix [49], sum of eigenvalues of adjacency matrix (also known as graph energy [6]), and determinant of adjacency matrix (which is the product of eigenvalues). Kolmogorov graph complexity measures such as linear graph complexity [50] are based on size of the minimal code that reconstructs the graph.…”
Section: O M P L E X I T Ymentioning
confidence: 99%
“…In product engineering limited efforts have been focused on developing complexity measures that are helpful in estimating the amount of resources required to complete a design task, and to estimate design difficulty [4]. A recent research project (META) sponsored by DARPA (Defence Advanced Research Project Agency) focused on identifying complexity metrics for engineered systems that correlate with as well as predict project cost, schedule or reliability, which can also be used to compare designs/system concepts alternatives [5][6][7]. However, there is no consensus about how to measure complexity in the context of systems engineering, which is further exacerbated by the fact that the applicability of such complexity measures to predict project success remains fundamentally dubious [8].…”
Section: Introductionmentioning
confidence: 99%
“…The blocks that Depending on the specific subsystem, different models can be used. The MIT META research group is developing a fundamental theory to quantify inherent uncertainties and risks in complex system design and development processes [136].…”
Section: Model Generalizationsmentioning
confidence: 99%
“…Given its complexity (i.e., procedures and interactions among its subsystems) and even if the definition of complexity is not always clear (Efatmaneshnik and Ryan, 2016), to examine a railway system in its entirety poses considerable difficulties. Willcox et al (2011) agreed on defining the complexity as the ability of the system to produce unexpected states, drifting from the design phase. Consequently, this paper focuses solely upon railway maintenance, given that railway maintenance is less researched compared with railway operations.…”
Section: Introductionmentioning
confidence: 99%