Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network analysis”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,045 records · Page 58

Passenger Aggregation Network with Very Efficient Listing (PANVEL) Ridesharing Model for Urban Air Mobility

This paper introduces a ridesharing model useful for examining the role of ridesharing in advancing Urban Air Mobility (UAM) operations. Although the success of UAM will likely require a host of new technologies in aircraft design, airspace management, autonomy, and more, operational innovations like ridesharing may also be key, especially to lower operating costs and attract a broader market. The ridesharing algorithm introduced, termed the Passenger Aggregation Network with Very Efficient Listing (PANVEL) model, estimates trip numbers and passenger occupancy aboard particular aircraft within a UAM network in a metropolitan area. This algorithm is applied within a transportation computational framework to determine the impact of ridesharing on mode choice, passenger travel patterns, and transportation costs. The algorithm aggregates passengers traveling between identical origin-destination pairs, factoring in individual-specific metrics, such as value of time and alternative mode options, to generate high load factors on UAM aircraft. The computational framework simulates passenger mode-choice selections using an effective-cost approach to determine the number of ridesharing UAM-preferred trips, and results with ridesharing are representative of a rough upper bound on UAM ridership potential for a given metro area. A case study in the Cleveland metro area is presented to demonstrate the algorithm and assess ridesharing potential.

advanced air mobility↗

Passenger Aggregation Network with Very Efficient Listing (PANVEL) Ridesharing Model for Urban Air Mobility

This presentation introduces a ridesharing model useful for examining the role of ridesharing in advancing Urban Air Mobility (UAM) operations. Although the success of UAM will likely require a host of new technologies in aircraft design, airspace management, autonomy, and more, operational innovations like ridesharing may also be key, especially to lower operating costs and attract a broader market. The ridesharing algorithm introduced, termed the Passenger Aggregation Network with Very Efficient Listing (PANVEL) model, estimates trip numbers and passenger occupancy aboard particular aircraft within a UAM network in a metropolitan area. This algorithm is applied within a transportation computational framework to determine the impact of ridesharing on mode choice, passenger travel patterns, and transportation costs. The algorithm aggregates passengers traveling between identical origin-destination pairs, factoring in individual-specific metrics, such as value of time and alternative mode options, to generate high load factors on UAM aircraft. The computational framework simulates passenger mode-choice selections using an effective-cost approach to determine the number of ridesharing UAM-preferred trips, and results with ridesharing are representative of a rough upper bound on UAM ridership potential for a given metro area. A case study in the Cleveland metro area is presented to demonstrate the algorithm and assess ridesharing potential.

advanced air mobility↗

Functional Data Analysis in Wearable Body Sensor Networks

Improving response time of indirect room-size calorimeters is still an outstanding problem in metabolic research. Accurate estimates of instantaneous rates of gaseous exchange require numerical differentiation of measured gaseousgas concentrations. We propose a new method to estimate the instantaneous gaseousgas exchange rates in indirect calorimetry. In contrast to the previously developed techniques, the method addresses the problem of differentiation of gaseous concentrations as an ill-posed problem. By applying the method of regularization, the problem of differentiation is converted into a well-posed problem resulting in smooth and consistent gaseous exchange rates. The validity of the method is tested on a large dataset of calorimeter experiments which included 313 human experiments along with 231 alcohol combustion experiments. It is demonstrated that the method is able to reliably differentiate between the “unphysiological” process of alcohol combustion and physiological variations produced by human metabolism. The method also allowed unraveling the previously unreported relative kinetics of O2 consumption and Respiratory Quotient (RQ) in humans. It was found that the kinetics of oxidative fuel selection lags behind the energy expenditure in humans exhibiting some sort of oxidative inertia. The time lag varies from 2-3 min up to 30 min, depending on particular individual. No such lag was found in alcohol combustion experiments. In addition to the relative kinetics of substrate oxidation, two statistical indexes reflecting variability of minute-by-minute RQ were estimated. The indexes were the RQ’s standard deviation and RQ’s first-order derivative. Both indexes showed statistically significant difference between human experiments and alcohol combustion experiments. We conclude that the proposed method can consistently extract physiologically-relevant information from noisy calorimetry data and the aforesaid information can provide additional insights into the mechanism of metabolic fuel selection in humans.

54 ENVIRONMENTAL SCIENCES↗

Functional Data Analysis in Wearable Body Sensor Networks

Improving response time of indirect room-size calorimeters is still an outstanding problem in metabolic research. Accurate estimates of instantaneous rates of gaseous exchange require numerical differentiation of measured gaseousgas concentrations. We propose a new method to estimate the instantaneous gaseousgas exchange rates in indirect calorimetry. In contrast to the previously developed techniques, the method addresses the problem of differentiation of gaseous concentrations as an ill-posed problem. By applying the method of regularization, the problem of differentiation is converted into a well-posed problem resulting in smooth and consistent gaseous exchange rates. The validity of the method is tested on a large dataset of calorimeter experiments which included 313 human experiments along with 231 alcohol combustion experiments. It is demonstrated that the method is able to reliably differentiate between the “unphysiological” process of alcohol combustion and physiological variations produced by human metabolism. The method also allowed unraveling the previously unreported relative kinetics of O2 consumption and Respiratory Quotient (RQ) in humans. It was found that the kinetics of oxidative fuel selection lags behind the energy expenditure in humans exhibiting some sort of oxidative inertia. The time lag varies from 2-3 min up to 30 min, depending on particular individual. No such lag was found in alcohol combustion experiments. In addition to the relative kinetics of substrate oxidation, two statistical indexes reflecting variability of minute-by-minute RQ were estimated. The indexes were the RQ’s standard deviation and RQ’s first-order derivative. Both indexes showed statistically significant difference between human experiments and alcohol combustion experiments. We conclude that the proposed method can consistently extract physiologically-relevant information from noisy calorimetry data and the aforesaid information can provide additional insights into the mechanism of metabolic fuel selection in humans.

60 - APPLIED LIFE SCIENCES↗

Local structure graph models with higher-order dependence

Local structure graph models (LSGMs) describe random graphs and networks as a Markov random field (MRF)—each graph edge has a specified conditional distribution dependent on explicit neighbourhoods of other graph edges. Centered parameterizations of LSGMs allow for direct control and interpretation of parameters for large- and small-scale structures (e.g., marginal means vs. dependence). Here, we extend this parameterization to account for triples of dependent edges and illustrate the importance of centered parameterizations for incorporating covariates and interpreting parameters. Using a MRF framework, common exponential random graph models are also shown to induce conditional distributions without centered parameterizations and thereby have undesirable features. This work attempts to advance graph models through conditional model specifications with modern parameterizations, covariates and higher-order dependencies.

97 MATHEMATICS AND COMPUTING↗

Contact heterogeneities in feral swine: implications for disease management and future research

Abstract Contact rates vary widely among individuals in socially structured wildlife populations. Understanding the interplay of factors responsible for this variation is essential for planning effective disease management. Feral swine ( Sus scrofa ) are a socially structured species which pose an increasing threat to livestock and human health, and little is known about contact structure. We analyzed 11 GPS data sets from across the United States to understand the interplay of ecological and demographic factors on variation in co‐location rates, a proxy for contact rates. Between‐sounder contact rates strongly depended on the distance among home ranges (less contact among sounders separated by >2 km; negligible between sounders separated by >6 km), but other factors causing high clustering between groups of sounders also seemed apparent. Our results provide spatial parameters for targeted management actions, identify data gaps that could lead to improved management and provide insight on experimental design for quantitating contact rates and structure.

60 APPLIED LIFE SCIENCES↗

An approach to structural analysis using Moore-Shannon network reliability

We develop a formalism for approaching many questions dealing with network structure. The formalism is based on Shannon-Moore network reliability and on the Birnbaum definition of importance that uses it. The methods we suggest based on this formalism apply to a wide variety of dynamics on very general inter- action networks. They are designed to answer specific questions about how network structure affects particular aspects of the dynamics. We first introduce the concepts that make up the formalism, explain basic methods of using these concepts, and demonstrate applications to problems such as edge ranking.

97 MATHEMATICS AND COMPUTING↗

Calibrating Bayesian Network Representations of Social-Behavioral Models

While human behavior has long been studied, recent and ongoing advances in computational modeling present opportunities for recasting research outcomes in human behavior. In this paper we describe how Bayesian networks can represent outcomes of human behavior research. We demonstrate a Bayesian network that represents political radicalization research – and show a corresponding visual representation of aspects of this research outcome. Since Bayesian networks can be quantitatively compared with external observations, the representation can also be used for empirical assessments of the research which the network summarizes. For a political radicalization model based on published research, we show this empirical comparison with data taken from the Minorities at Risk Organizational Behaviors database.

99 GENERAL AND MISCELLANEOUS↗

'Known Secure Sensor Measurements' for Critical Infrastructure Systems: Detecting Falsification of System State

This paper describes a first investigation on a low cost and low false alarm, reliable mechanism for detecting manipulation of critical physical processes and falsification of system state. We call this novel mechanism Known Secure Sensor Measurements (KSSM). The method moves beyond analysis of network traffic and host based state information, in fact it uses physical measurements of the process being controlled to detect falsification of state. KSSM is intended to be incorporated into the design of new, resilient, cost effective critical infrastructure control systems. It can also be included in incremental upgrades of already in- stalled systems for enhanced resilience. KSSM is based on known secure physical measurements for assessing the likelihood of an attack and will demonstrate a practical approach to creating, transmitting, and using the known secure measurements for detection.

97 MATHEMATICS AND COMPUTING↗

Modeling and Analysis of Modal Switching in Networked Transport Systems

We consider networked transport systems defined on directed graphs: the dynamics on the edges correspond to solutions of transport equations with space dimension one. In addition to the graph setting, a major consideration is the introduction and propagation of discontinuities in the solutions when the system may discontinuously switch modes, naturally or as a hybrid control. This kind of switching has been extensively studied for ordinary differential equations, but not much so far for systems governed by partial differential equations. In particular, we give well-posedness results for switching as a control, both in finite horizon open loop operation and as feedback based on sensor measurements in the system.

97 MATHEMATICS AND COMPUTING↗

Stability and Existence Results for Quasimonotone Quasivariational Inequalities in Finite Dimensional Spaces

We study pseudomonotone and quasimonotone quasivariational inequalities in a finite dimensional space. In particular we focus our attention on the closedness of some solution maps associated to a parametric quasivariational inequality. From this study we derive two results on the existence of solutions of the quasivariational inequality. On the one hand, assuming the pseudomonotonicity of the operator, we get the nonemptiness of the set of the classical solutions. On the other hand, we show that the quasimonoticity of the operator implies the nonemptiness of the set of nonzero solutions. An application to traffic network is also considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Framework for Imperfectly Observed Networks

Model a network as an edge-weighted graph, where the (unknown) weight w{sub e} of edge e indicates the frequency of observed interactions, and over time t we observe a Poisson (tw{sub e}) number of interactions across edges e. How should we estimate some given statistic of the underlying network? This leads to wide-ranging and challenging problems, on which this article makes only partial progress.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Near Critical Preferential Attachment Networks have Small Giant Components

Preferential attachment networks with power law exponent τ>3 are known to exhibit a phase transition. There is a value ρ{sub c}>0 such that, for small edge densities ρ≤ρ{sub c} every component of the graph comprises an asymptotically vanishing proportion of vertices, while for large edge densities ρ>ρ{sub c} there is a unique giant component comprising an asymptotically positive proportion of vertices. In this paper we study the decay in the size of the giant component as the critical edge density is approached from above. We show that the size decays very rapidly, like exp (−c/√(ρ−ρ{sub c})) for an explicit constant c>0 depending on the model implementation. This result is in contrast to the behaviour of the class of rank-one models of scale-free networks, including the configuration model, where the decay is polynomial. Our proofs rely on the local neighbourhood approximations of Dereich and Mörters (Ann Probab 41(1):329–384, 2013) and recent progress in the theory of branching random walks (Gantert et al. in Ann Inst Henri Poincaré Probab Stat 47(1):111–129, 2011).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Soft Communities in Similarity Space

The S{sup 1} model has been central in the development of the field of network geometry. It places nodes in a similarity space and connects them with a likelihood depending on an effective distance which combines similarity and popularity dimensions, with popularity directly related to the degrees of the nodes. The S{sup 1} model has been mainly studied in its homogeneous regime, in which angular coordinates are independently and uniformly scattered on the circle. We now investigate if the model can generate networks with targeted topological features and soft communities, that is, inhomogeneous angular distributions. To that end, hidden degrees must depend on angular coordinates, and we propose a method to estimate them. We conclude that the model can be topologically invariant with respect to the soft-community structure. Our results expand the scope of the model beyond the independent hidden variables limit and can have an important impact in the embedding of real-world networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Landscape composition and configuration have scale-dependent effects on agricultural pest suppression

Increasing landscape heterogeneity (composition and configuration) can enhance natural enemy populations and support pest suppression in agricultural landscapes. Using a network-based data mining approach, we examined independent gradients of landscape composition and configuration at six spatial scales that were associated with pest suppression services measured at 32 sites in Michigan and Wisconsin, USA. We compared the relative effects of landscape composition and configuration across scales with those of local crop type (corn or grassland). We found that multiple gradients of configurational heterogeneity were independent of composition and strongly associated with pest suppression, with different configuration metrics being predictive of pest suppression depending on the spatial scales and regions considered. Landscapes that were more configurationally heterogeneous at smaller spatial scales consistently supported higher pest suppression. In Michigan, pest suppression increased in landscapes with high edge contrast between annual crops and surrounding habitats and high edge density of grassland within 250-500 m radii. In Wisconsin, pest suppression increased with large core area of grassland and high field density within a 250 m radius. The main compositional effect we found was a positive relationship between grassland cover and pest suppression occurring at larger spatial scales (1000-1500 m) and occurring in Wisconsin but not in Michigan. Our findings demonstrate that effects of landscape composition and configuration on pest suppression differ across spatial scales and vary regionally. The network-based data mining techniques used here could be useful for disentangling intercorrelated landscape metrics in a variety of other contexts in landscape ecology.

54 ENVIRONMENTAL SCIENCES↗