More Like this

1. From low to high-and lower-optimal regularity of the SMGTJ equation with Dirichlet and Neumann boundary control, and with point control, via explicit representation formulae

   https://doi.org/10.3934/eect.2022007  

   Triggiani, Roberto; Wan, Xiang (January 2022, Evolution Equations and Control Theory)

   We consider the linear third order (in time) PDE known as the SMGTJ-equation, defined on a bounded domain, under the action of either Dirichlet or Neumann boundary control \begin{document}$ g $$\end{document}. Optimal interior and boundary regularity results were given in [1], after [41], when \begin{document}$$ g \in L^2(0, T;L^2(\Gamma)) \equiv L^2(\Sigma) $$\end{document}, which, moreover, in the canonical case \begin{document}$$ \gamma = 0 $$\end{document}, were expressed by the well-known explicit representation formulae of the wave equation in terms of cosine/sine operators [19], [17], [24,Vol Ⅱ]. The interior or boundary regularity theory is however the same, whether \begin{document}$$ \gamma = 0 $$\end{document} or \begin{document}$$ 0 \neq \gamma \in L^{\infty}(\Omega) $$\end{document}, since \begin{document}$$ \gamma \neq 0 $$\end{document} is responsible only for lower order terms. Here we exploit such cosine operator based-explicit representation formulae to provide optimal interior and boundary regularity results with \begin{document}$$ g $$\end{document} "smoother" than \begin{document}$$ L^2(\Sigma) $$\end{document}, qualitatively by one unit, two units, etc. in the Dirichlet boundary case. To this end, we invoke the corresponding results for wave equations, as in [17]. Similarly for the Neumann boundary case, by invoking the corresponding results for the wave equation as in [22], [23], [37] for control smoother than \begin{document}$$ L^2(0, T;L^2(\Gamma)) $$\end{document}, and [44] for control less regular in space than \begin{document}$$ L^2(\Gamma) $$\end{document}$. In addition, we provide optimal interior and boundary regularity results when the SMGTJ equation is subject to interior point control, by invoking the corresponding wave equations results [42], [24,Section 9.8.2]. 

   more » « less
2. Learning to Recommend Signal Plans under Incidents with Real-Time Traffic Prediction

   https://doi.org/10.1177/0361198120917668  

   Yao, Weiran; Qian, Sean (June 2020, Transportation Research Record: Journal of the Transportation Research Board)

   null (Ed.)

   The main question to address in this paper is to recommend optimal signal timing plans in real time under incidents by incorporating domain knowledge developed with the traffic signal timing plans tuned for possible incidents, and learning from historical data of both traffic and implemented signals timing. The effectiveness of traffic incident management is often limited by the late response time and excessive workload of traffic operators. This paper proposes a novel decision-making framework that learns from both data and domain knowledge to real-time recommend contingency signal plans that accommodate non-recurrent traffic, with the outputs from real-time traffic prediction at least 30 min in advance. Specifically, considering the rare occurrences of engagement of contingency signal plans for incidents, it is proposed to decompose the end-to-end recommendation task into two hierarchical models—real-time traffic prediction and plan association. The connections between the two models are learnt through metric learning, which reinforces partial-order preferences observed from historical signal engagement records. The effectiveness of this approach is demonstrated by testing this framework on the traffic network in Cranberry Township, Pennsylvania, U.S., in 2019. Results show that the recommendation system has a precision score of 96.75% and recall of 87.5% on the testing plan, and makes recommendations an average of 22.5 min lead time ahead of Waze alerts. The results suggest that this framework is capable of giving traffic operators a significant time window to access the conditions and respond appropriately. 

   more » « less
3. NWADE: A Neighborhood Watch Mechanism for Attack Detection and Evacuation in Autonomous Intersection Management

   https://doi.org/10.1109/ICDCS54860.2022.00117  

   Kang, Jian; Yu, Alian; Jiang, Wei; Lin, Dan (July 2022, 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS))

   With the advances in autonomous vehicles and intelligent intersection management systems, traffic lights may be replaced by optimal travel plans calculated for each passing vehicle in the future. While these technological advancements are envisioned to greatly improve travel efficiency, they are still facing various challenging security hurdles since even a single deviation of a vehicle from its assigned travel plan could cause a serious accident if the surrounding vehicles do not take necessary actions in a timely manner. In this paper, we propose a novel security mechanism namely NWADE which can be integrated into existing autonomous intersection management systems to help detect malicious vehicle behavior and generate evacuation plans. In the NWADE mechanism, we introduce the neighborhood watch concept whereby each vehicle around the intersection will serve as a watcher to report or verify the abnormal behavior of any nearby vehicle and the intersection manager. We propose a blockchainbased verification framework to guarantee the integrity and trustworthiness of the individual travel plans optimized for the entire intersection. We have conducted extensive experimental studies on various traffic scenarios, and the experimental results demonstrate the practicality, effectiveness, and efficiency of our mechanism. 

   more » « less
4. Glassey-Strauss representation of Vlasov-Maxwell systems in a Half Space

   https://doi.org/10.3934/krm.2021034  

   Cao, Yunbai; Kim, Chanwoo (January 2022, Kinetic and Related Models)

   Following closely the classical works [5]-[7] by Glassey, Strauss, and Schaeffer, we present a version of the Glassey-Strauss representation for the Vlasov-Maxwell systems in a 3D half space when the boundary is the perfect conductor. 

   more » « less
5. Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection

   https://doi.org/10.1145/3639454  

   Huang, Shang-En; Pettie, Seth; Zhu, Leqi (April 2024, Journal of the ACM)

   Since the mid-1980s it has been known that Byzantine Agreement can be solved with probability 1 asynchronously, even against an omniscient, computationally unbounded adversary that can adaptivelycorruptup tof < n/3parties. Moreover, the problem is insoluble withf ≥ n/3corruptions. However, Bracha’s [13] 1984 protocol (see also Ben-Or [8]) achievedf < n/3resilience at the cost ofexponentialexpected latency2^{Θ (n)}, a bound that hasneverbeen improved in this model withf = ⌊ (n-1)/3 ⌋corruptions. In this article, we prove that Byzantine Agreement in the asynchronous, full information model can be solved with probability 1 against an adaptive adversary that can corruptf < n/3parties, while incurring onlypolynomial latency with high probability. Our protocol follows an earlier polynomial latency protocol of King and Saia [33,34], which hadsuboptimalresilience, namelyf ≈ n/10⁹ [33,34]. Resiliencef = (n-1)/3is uniquely difficult, as this is the point at which the influence of the Byzantine and honest players are of roughly equal strength. The core technical problem we solve is to design a collective coin-flipping protocol thateventuallylets us flip a coin with an unambiguous outcome. In the beginning, the influence of the Byzantine players is too powerful to overcome, and they can essentially fix the coin’s behavior at will. We guarantee that after just a polynomial number of executions of the coin-flipping protocol, either (a) the Byzantine players fail to fix the behavior of the coin (thereby ending the game) or (b) we can “blacklist” players such that the blacklisting rate for Byzantine players is at least as large as the blacklisting rate for good players. The blacklisting criterion is based on a simple statistical test offraud detection. 

   more » « less