Search NASA⌕ Search

Engineering topics

Paschalidis, Ioannis Ch.

Publications and source records attributed to Paschalidis, Ioannis Ch..

Multi-Attribute Subset Selection enables prediction of representative phenotypes across microbial populations

The interpretation of complex biological datasets requires the identification of representative variables that describe the data without critical information loss. This is particularly important in the analysis of large phenotypic datasets (phenomics). Here we introduce Multi-Attribute Subset Selection (MASS), an algorithm which separates a matrix of phenotypes (e.g., yield across microbial species and environmental conditions) into predictor and response sets of conditions. Using mixed integer linear programming, MASS expresses the response conditions as a linear combination of the predictor conditions, while simultaneously searching for the optimally descriptive set of predictors. We apply the algorithm to three microbial datasets and identify environmental conditions that predict phenotypes under other conditions, providing biologically interpretable axes for strain discrimination. MASS could be used to reduce the number of experiments needed to identify species or to map their metabolic capabilities. The generality of the algorithm allows addressing subset selection problems in areas beyond biology.

59 BASIC BIOLOGICAL SCIENCES↗

Optimizing lane reversals in transportation networks to reduce traffic congestion: A global optimization approach

This paper studies how to reduce the overall travel time of commuters in a transportation network by reversing the direction of some lanes in the network using a macroscopic network-wide perspective. Similar to the Network Design Problem, the lane reversal problem has been shown to be NP-hard given the dependence of the users’ route selection on the lane direction decision. Herein, we propose and compare three efficient methods to solve the routing and lane reversal problem jointly. First, we introduce an alternating method that decouples the routing and lane assignment problems. Second, we propose a Frank–Wolfe method that jointly takes gradient steps to adjust both the lane assignment and routing decisions. Third, we propose a convex approximation method that uses a threshold-based approach to convexify the joint routing and lane reversal objective. The convex approximation method is advantageous since it finds a global optimum solution for the approximated problem and it enables the possibility to include linear constraints. Using this method, we extend the main formulation to be able to limit a maximum number of reversed lanes, as well as to incorporate multiple origin–destination (OD) patterns. We test the proposed methods in a case study using the transportation network of Eastern Massachusetts where our results indicate an overall reduction in travel times of 4.7% by selecting the best 15 reversals. Moreover, using a small test network, we investigate the performance of the lane reversal strategies as a function of the OD demand symmetry. As expected, we observe that when the OD demand is very asymmetric (e.g., for a single OD pair, evacuations, large events), the reduction in travel times is larger than the symmetric case, reaching travel time reductions of 60%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Automated detection of mild cognitive impairment and dementia from voice recordings: A natural language processing approach

Automated computational assessment of neuropsychological tests would enable widespread, cost-effective screening for dementia. A novel natural language processing approach is developed and validated to identify different stages of dementia based on automated transcription of digital voice recordings of subjects’ neuropsychological tests conducted by the Framingham Heart Study (n = 1084). Transcribed sentences from the test were encoded into quantitative data and several models were trained and tested using these data and the participants’ demographic characteristics. Average area under the curve (AUC) on the held-out test data reached 92.6%, 88.0%, and 74.4% for differentiating Normal cognition from Dementia, Normal or Mild Cognitive Impairment (MCI) from Dementia, and Normal from MCI, respectively. The proposed approach offers a fully automated identification of MCI and dementia based on a recorded neuropsychological test, providing an opportunity to develop a remote screening tool that could be adapted easily to any language.

neuropsychological↗

An Artificial Intelligence-Assisted Method for Dementia Detection Using Images from the Clock Drawing Test

Background: Widespread dementia detection could increase clinical trial candidates and enable appropriate interventions. Since the Clock Drawing Test (CDT) can be potentially used for diagnosing dementia-related disorders, it can be leveraged to develop a computer-aided screening tool. Objective: To evaluate if a machine learning model that uses images from the CDT can predict mild cognitive impairment or dementia. Methods: Images of an analog clock drawn by 3,263 cognitively intact and 160 impaired subjects were collected during in-person dementia evaluations by the Framingham Heart Study. We processed the CDT images, participant’s age, and education level using a deep learning algorithm to predict dementia status. Results: When only the CDT images were used, the deep learning model predicted dementia status with an area under the receiver operating characteristic curve (AUC) of 81.3% ± 4.3%. A composite logistic regression model using age, level of education, and the predictions from the CDT-only model, yielded an average AUC and average F1 score of 91.9% ±1.1% and 94.6% ±0.4%, respectively. Conclusion: Our modeling framework establishes a proof-of-principle that deep learning can be applied on images derived from the CDT to predict dementia status. When fully validated, this approach can offer a cost-effective and easily deployable mechanism for detecting cognitive impairment.

Neurosciences & Neurology↗

Optimal Operations Management of Mobility-on-Demand Systems

The emergence of the sharing economy in urban transportation networks has enabled new fast, convenient and accessible mobility services referred to as Mobilty-on-Demand systems (e.g., Uber, Lyft, DiDi). These platforms have flourished in the last decade around the globe and face many operational challenges in order to be competitive and provide good quality of service. A crucial step in the effective operation of these systems is to reduce customers' waiting time while properly selecting the optimal fleet size and pricing policy. In this paper, we jointly tackle three operational decisions: (i) fleet size, (ii) pricing, and (iii) rebalancing, in order to maximize the platform's profit or its customers' welfare. To accomplish this, we first devise an optimization framework which gives rise to a static policy. Then, we elaborate and propose dynamic policies that are more responsive to perturbations such as unexpected increases in demand. We test this framework in a simulation environment using three case studies and leveraging traffic flow and taxi data from Eastern Massachusetts, New York City, and Chicago. Our results show that solving the problem jointly could increase profits between 1% and up to 50%, depending on the benchmark. Moreover, we observe that the proposed fleet size yield utilization of the vehicles in the fleet is around 75% compared to private vehicle utilization of 5%.

Wollenstein-Betech, Salomón↗