Alexander Ihler

Alexander Ihler

Auto-generated profile, based on publicly available information

Alexander Ihler

Donald Bren Hall School of Information and Computer Sciences, University of California Irvine, Irvine, CA, USA

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in IEEE Access
Verified
Journal Article
Open access
YMYixuan Ma
Yixuan Ma
ZZZhenjiang Zhang
Zhenjiang Zhang
AIAlexander Ihler
Alexander Ihler
Short-term traffic prediction consists a crucial component in intelligent transportation systems. With the explosion of automated traffic monitoring sensors and the flourishing of deep learning techniques, a growing body of deep neural network models have been employed to tackle this problem. In particular, convolutional neural networks (CNN) and long short-term memory (LSTM) recurrent networks have demonstrated their advantages in modeling and predicting the spatiotemporal evolution of traffic flows. In this paper, we propose a novel Convolutional LSTM neural network architecture for multi-lane short-term traffic prediction. Compared to existing methods, we highlight the importance of (1) applying multiple features to characterize traffic conditions; (2) explicitly considering the routing between neighbouring lanes and downstream/upstream traffics; and (3) predicting multiple time-step traffic in a rolling-prediction manner. Experiments on 10 months 5-minute interval observations of the US I-101 Northern freeway at California Bay Area verify the proposed model. The results show that our model has considerable advantages in predicting multi-lane short-term traffic flow.

1 March 2022 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Open access
PDF file
DADaniel Jay Alford-Lago
Daniel Jay Alford-Lago
CCC. W. Curtis
C. W. Curtis
AIA. T. Ihler
A. T. Ihler
OIO. Issan
O. Issan
Koopman operator theory shows how nonlinear dynamical systems can be represented as an infinite-dimensional, linear operator acting on a Hilbert space of observables of the system. However, determining the relevant modes and eigenvalues of this infinite-dimensional operator can be difficult. The extended dynamic mode decomposition (EDMD) is one such method for generating approximations to Koopman spectra and modes, but the EDMD method faces its own set of challenges due to the need of user defined observables. To address this issue, we explore the use of autoencoder networks to simultaneously find optimal families of observables, which also generate both accurate embeddings of the flow into a space of observables and submersions of the observables back into flow coordinates. This network results in a global transformation of the flow and affords future state prediction via the EDMD and the decoder network. We call this method the deep learning dynamic mode decomposition (DLDMD). The method is tested on canonical nonlinear data sets and is shown to produce results that outperform a standard DMD approach and enable data-driven prediction where the standard DMD fails.

27 December 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
Shivam GargShivam Garg
Shivam Garg
AIAlexander Ihler
Alexander Ihler
EBElizabeth Serena Bentley
Elizabeth Serena Bentley
SKSunil Kumar
Sunil Kumar
Autonomous and decentralized UAV networks are used in many applications, including disaster management, environment monitoring and surveillance. The performance of the routing protocols in these networks drops significantly due to frequent route breaks and traffic congestion at high node speeds. This is partly because the routing metrics used in many of the existing protocols are sensitive to the intra-flow interference after the source node starts transmission on the selected route. Moreover, these schemes do not estimate potential packet drops or take preventive measures, such as route switching and queue management. To address these issues, we present a cross-layer, mobility and congestion-aware optimized link state routing (MCA-OLSR) protocol for an autonomous and decentralized UAV network, which incorporates the following mechanisms: ( i ) Multi-metric route selection which includes hop count, route lifetime, estimated time-to-destination and number of interfering links; ( ii ) Preemptive route switching which prevents packet transmission over the broken and congested routes; and ( iii ) Queue management to prioritize transmission of packets based on their survivability score. We also present key observations on routing protocol design and a theoretical analysis to show the impact of data rate, route length and interfering links on the packet service rate and congestion. The proposed routing scheme achieves a significantly higher packet delivery ratio and lower route computation overhead for delay-sensitive data flows at different data rates, node densities and high speeds, as compared to the standard and multi-metric OLSR protocols.

9 February 2010 in Bioinformatics
Verified
Journal Article
Open access
PDF file
QLQiang Liu
Qiang Liu
KLKevin K. Lin
Kevin K. Lin
BABogi Andersen
Bogi Andersen
PSPadhraic Smyth
Padhraic Smyth
AIAlexander Ihler
Alexander Ihler
Motivation: Time-course gene expression datasets provide important insights into dynamic aspects of biological processes, such as circadian rhythms, cell cycle and organ development. In a typical microarray time-course experiment, measurements are obtained at each time point from multiple replicate samples. Accurately recovering the gene expression patterns from experimental observations is made challenging by both measurement noise and variation among replicates' rates of development. Prior work on this topic has focused on inference of expression patterns assuming that the replicate times are synchronized. We develop a statistical approach that simultaneously infers both (i) the underlying (hidden) expression profile for each gene, as well as (ii) the biological time for each individual replicate. Our approach is based on Gaussian process regression (GPR) combined with a probabilistic model that accounts for uncertainty about the biological development time of each replicate. Results: We apply GPR with uncertain measurement times to a microarray dataset of mRNA expression for the hair-growth cycle in mouse back skin, predicting both profile shapes and biological times for each replicate. The predicted time shifts show high consistency with independently obtained morphological estimates of relative development. We also show that the method systematically reduces prediction error on out-of-sample data, significantly reducing the mean squared error in a cross-validation study. Availability: Matlab code for GPR with uncertain time shifts is available at http://sli.ics.uci.edu/Code/GPRTimeshift/ Contact: ihler@ics.uci.edu

29 July 2024 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
SDShreyas Devaraju
Shreyas Devaraju
AIAlexander Ihler
Alexander Ihler
SKSunil Kumar
Sunil Kumar
Wireless networks consisting of low SWaP (size, weight, and power), fixed-wing UAVs (unmanned aerial vehicles) are used in many applications, such as search, monitoring and information gathering of inaccessible areas, in which UAVs sense within an area and forward the information, in a multihop manner, to an aerial base station (BS). Robustly performing these tasks requires the UAV network to be decentralized, autonomous, and scalable. An important tradeoff is between area coverage and connectivity: fast area coverage is needed to quickly identify objects of interest, while connectivity must be maintained for coordination and to transmit sensed information to the BS in real time. These factors must be balanced by the mobility model, which for each UAV has access only to locally available information. While [1], [2] attempt to balance these factors using flocking behavior, this only encourages the UAVs to spread, rather than using knowledge of what areas have already been covered. In this paper, we develop a neighborhood- and BS-connectivity aware distributed pheromone mobility model, called BS-CAP, to autonomously coordinate the UAV movements in a decentralized network. By using a pheromone map, we directly incorporate recent coverage information for the area. We then extend our approach to a deep Q-learning policy variant, called BSCAPDQN, to further tune and improve the balance between coverage and connectivity. These mobility models are fully distributed and rely only on information from neighboring UAVs. Our simulations demonstrate that both models achieve efficient area coverage and improved connectivity (both locally and to the BS), providing significant improvements over existing approaches.

22 December 2018 in Journal of Artificial Intelligence Research
Verified
Journal Article
Open access
PDF file
RMRadu Marinescu
Radu Marinescu
JLJunkyu Lee
Junkyu Lee
RDRina Dechter
Rina Dechter
AIAlexander Ihler
Alexander Ihler
Mixed inference such as the marginal MAP query (some variables marginalized by summation and others by maximization) is key to many prediction and decision models. It is known to be extremely hard; the problem is NP PP-complete while the decision problem for MAP is only NP-complete and the summation problem is #P-complete. Consequently, approximation anytime schemes are essential. In this paper, we show that the framework of heuristic AND/OR search, which exploits conditional independence in the graphical model, coupled with variational-based mini-bucket heuristics can be extended to this task and yield powerful state-of-the-art schemes. Specifically, we explore the complementary properties of best-first search for reducing the number of conditional sums and providing time-improving upper bounds, with depth-first search for rapidly generating and improving solutions and lower bounds. We show empirically that a class of solvers that interleaves depth-first with best-first schemes emerges as the most competitive anytime scheme.