Search

Flexible ramping products (FRPs) emerge as a promising instrument for addressing steep and uncertain ramping needs through market mechanisms. Initial implementations of FRPs in North American electricity markets, however, revealed several shortcomings in existing FRP designs. In many instances, FRP prices failed to signal the true value of ramping capacity, most notably evident in zero FRP prices observed in a myriad of periods during which the system was in acute need for rampable capacity. These periods were marked by scheduled but undeliverable FRPs, often calling for operator out-of-market actions. On top of that, the methods used for procuring FRPs have been primarily rule-based, lacking explicit economic underpinnings. In this paper, we put forth an alternative framework for FRP procurement, which seeks to set FRP requirements and schedule FRP awards such that the expected system operation cost is minimized. Using real world data from U.S. ISOs, we showcase the relative merits of the framework in (i) reducing the total system operation cost, (ii) improving price formation, (iii) enhancing the the deliverability of FRP awards, and (iv) reducing the need for out-of-market actions.

In this work, we propose a new method to track extended targets of different shapes such as ellipses, rectangles and rhombi. We provide an analytical framework to express these shapes as superelliptical contours and propose a Bayesian filtering scheme that can handle measurements from the contour of the object. The method utilizes the Rao-Blackwellized particle filtering algorithm with novel sensor-object geometry constraints. The success of the algorithm is demonstrated using both simulations and real-data experiments, and the algorithm has been demonstrated to be of high performance in various challenging scenarios., Comment: 10 pages, 6 figures, accepted by the 27th International Conference on Information Fusion (FUSION 2024)

This paper investigates the potential of Digital Twins (DTs) to enhance network performance in densely populated urban areas, specifically focusing on vehicular networks. The study comprises two phases. In Phase I, we utilize traffic data and AI clustering to identify critical locations, particularly in crowded urban areas with high accident rates. In Phase II, we evaluate the advantages of twinning vehicular networks through three deployment scenarios: edge-based twin, cloud-based twin, and hybrid-based twin. Our analysis demonstrates that twinning significantly reduces network delays, with virtual twins outperforming physical networks. Virtual twins maintain low delays even with increased vehicle density, such as 15.05 seconds for 300 vehicles. Moreover, they exhibit faster computational speeds, with cloud-based twins being 1.7 times faster than edge twins in certain scenarios. These findings provide insights for efficient vehicular communication and underscore the potential of virtual twins in enhancing vehicular networks in crowded areas while emphasizing the importance of considering real-world factors when making deployment decisions., Comment: 6 pages, 8 figures, 2tables, conference paper

Detecting machine malfunctions at an early stage is crucial for reducing interruptions in operational processes within industrial settings. Recently, the deep learning approach has started to be preferred for the detection of failures in machines. Deep learning provides an effective solution in fault detection processes thanks to automatic feature extraction. In this study, a deep learning-based system was designed to analyze the sound signals produced by industrial machines. Acoustic sound signals were converted into Mel spectrograms. For the purpose of classifying spectrogram images, the DenseNet-169 model, a deep learning architecture recognized for its effectiveness in image classification tasks, was used. The model was trained using the transfer learning method on the MIMII dataset including sounds from four types of industrial machines. The results showed that the proposed method reached an accuracy rate varying between 97.17% and 99.87% at different Sound Noise Rate levels.

The dramatic increase in the connectivity demand results in an excessive amount of Internet of Things (IoT) sensors. To meet the management needs of these large-scale networks, such as accurate monitoring and learning capabilities, Digital Twin (DT) is the key enabler. However, current attempts regarding DT implementations remain insufficient due to the perpetual connectivity requirements of IoT networks. Furthermore, the sensor data streaming in IoT networks cause higher processing time than traditional methods. In addition to these, the current intelligent mechanisms cannot perform well due to the spatiotemporal changes in the implemented IoT network scenario. To handle these challenges, we propose a DT-native AI-driven service architecture in support of the concept of IoT networks. Within the proposed DT-native architecture, we implement a TCP-based data flow pipeline and a Reinforcement Learning (RL)-based learner model. We apply the proposed architecture to one of the broad concepts of IoT networks, the Internet of Vehicles (IoV). We measure the efficiency of our proposed architecture and note ~30% processing time-saving thanks to the TCP-based data flow pipeline. Moreover, we test the performance of the learner model by applying several learning rate combinations for actor and critic networks and highlight the most successive model.

As global Internet of Things (IoT) devices connectivity surges, a significant portion gravitates towards the Edge of Things (EoT) network. This shift prompts businesses to deploy infrastructure closer to end-users, enhancing accessibility. However, the growing EoT network expands the attack surface, necessitating robust and proactive security measures. Traditional solutions fall short against dynamic EoT threats, highlighting the need for proactive and intelligent systems. We introduce a digital twin-empowered smart attack detection system for 6G EoT networks. Leveraging digital twin and edge computing, it monitors and simulates physical assets in real time, enhancing security. An online learning module in the proposed system optimizes the network performance. Our system excels in proactive threat detection, ensuring 6G EoT network security. The performance evaluations demonstrate its effectiveness, robustness, and adaptability using real datasets.

Deep edge intelligence aims to deploy deep learning models that demand computationally expensive training in the edge network with limited computational power. Moreover, many deep edge intelligence applications require handling distributed data that cannot be transferred to a central server due to privacy concerns. Decentralized learning methods, such as federated learning, offer solutions where models are learned collectively by exchanging learned weights. However, they often require complex models that edge devices may not handle and multiple rounds of network communication to achieve state-of-the-art performances. This study proposes a convolutional ensemble learning approach, coined EdgeConvEns, that facilitates training heterogeneous weak models on edge and learning to ensemble them where data on edge are heterogeneously distributed. Edge models are implemented and trained independently on Field-Programmable Gate Array (FPGA) devices with various computational capacities. Learned data representations are transferred to a central server where the ensemble model is trained with the learned features received from the edge devices to boost the overall prediction performance. Extensive experiments demonstrate that the EdgeConvEns can outperform the state-of-the-art performance with fewer communications and less data in various training scenarios.

In deep learning inference, model parameters are pruned and quantized to reduce the model size. Compression methods and common subexpression (CSE) elimination algorithms are applied on sparse constant matrices to deploy the models on low-cost embedded devices. However, the state-of-the-art CSE elimination methods do not scale well for handling large matrices. They reach hours for extracting CSEs in a $200 \times 200$ matrix while their matrix multiplication algorithms execute longer than the conventional matrix multiplication methods. Besides, there exist no compression methods for matrices utilizing CSEs. As a remedy to this problem, a random search-based algorithm is proposed in this paper to extract CSEs in the column pairs of a constant matrix. It produces an adder tree for a $1000 \times 1000$ matrix in a minute. To compress the adder tree, this paper presents a compression format by extending the Compressed Sparse Row (CSR) to include CSEs. While compression rates of more than $50\%$ can be achieved compared to the original CSR format, simulations for a single-core embedded system show that the matrix multiplication execution time can be reduced by $20\%$.

Optical coherence tomography (OCT) is a label-free, non-invasive 3D imaging tool widely used in both biological research and clinical diagnosis. Current OCT modalities can only visualize specimen tomography without chemical information. Here, we report a bondselective full-field OCT (BS-FF-OCT), in which a pulsed mid-infrared laser is used to modulate the OCT signal through the photothermal effect, achieving label-free bond-selective 3D sectioned imaging of highly scattering samples. We first demonstrate BS-FF-OCT imaging of 1 {\mu}m PMMA beads embedded in agarose gel. Next, we then show 3D hyperspectral imaging of polypropylene fiber mattress from a standard surgical mask. We then demonstrate BS-FFOCT imaging on biological samples, including cancer cell spheroids and C. elegans. Using an alternative pulse timing configuration, we finally demonstrate the capability of BS-FF-OCT on a bulky and highly scattering 150 {\mu}m thick mouse brain slice.

Clinical identification and fundamental study of viruses rely on the detection of viral proteins or viral nucleic acids. Yet, amplification-based and antigen-based methods are not able to provide precise compositional information of individual virions due to small particle size and low-abundance chemical contents (e.g., ~ 5000 proteins in a vesicular stomatitis virus). Here, we report a widefield interferometric defocus-enhanced mid-infrared photothermal (WIDE-MIP) microscope for high-throughput fingerprinting of single viruses. With the identification of feature absorption peaks, WIDE-MIP reveals the contents of viral proteins and nucleic acids in single DNA vaccinia viruses and RNA vesicular stomatitis viruses. Different nucleic acids signatures of thymine and uracil residue vibrations are obtained to differentiate DNA and RNA viruses. WIDE-MIP imaging further reveals an enriched \b{eta} sheet components in DNA varicella-zoster virus proteins. Together, these advances open a new avenue for compositional analysis of viral vectors and elucidating protein function in an assembled virion.

Storage is expected to be a critical source of firming in low-carbon grids. A common concern raised from ex-post assessments is that storage resources can fail to respond to strong price signals during times of scarcity. While commonly attributed to forecast error or failures in operations, we posit that this behavior can be explained from the perspective of risk-averse scheduling. Using a stochastic self-scheduling framework and real-world data harvested from the Australian National Electricity Market, we demonstrate that risk-averse storage resources tend to have a myopic operational perspective, that is, they typically engage in near-term price arbitrage and chase only few extreme price spikes and troughs, thus remaining idle in several time periods with markedly high and low prices. This has important policy implications given the non-transparency of unit risk aversion and apparent risk in intervention decision-making., Comment: 5 pages

To take unit commitment (UC) decisions under uncertain net load, most studies utilize a stochastic UC (SUC) model that adopts a one-size-fits-all representation of uncertainty. Disregarding contextual information such as weather forecasts and temporal information, these models are typically plagued by a poor out-of-sample performance. To effectively exploit contextual information, in this paper, we formulate a conditional SUC problem that is solved given a covariate observation. The presented problem relies on the true conditional distribution of net load and so cannot be solved in practice. To approximate its solution, we put forward a predictive prescription framework, which leverages a machine learning model to derive weights that are used in solving a reweighted sample average approximation problem. In contrast with existing predictive prescription frameworks, we manipulate the weights that the learning model delivers based on the specific dataset, present a method to select pertinent covariates, and tune the hyperparameters of the framework based on the out-of-sample cost of its policies. We conduct extensive numerical studies, which lay out the relative merits of the framework vis-\`a-vis various benchmarks., Comment: 5 pages, 2 figures

Safely navigating through an urban environment without violating any traffic rules is a crucial performance target for reliable autonomous driving. In this paper, we present a Reinforcement Learning (RL) based methodology to DEtect and FIX (DeFIX) failures of an Imitation Learning (IL) agent by extracting infraction spots and re-constructing mini-scenarios on these infraction areas to train an RL agent for fixing the shortcomings of the IL approach. DeFIX is a continuous learning framework, where extraction of failure scenarios and training of RL agents are executed in an infinite loop. After each new policy is trained and added to the library of policies, a policy classifier method effectively decides on which policy to activate at each step during the evaluation. It is demonstrated that even with only one RL agent trained on failure scenario of an IL agent, DeFIX method is either competitive or does outperform state-of-the-art IL and RL based autonomous urban driving benchmarks. We trained and validated our approach on the most challenging map (Town05) of CARLA simulator which involves complex, realistic, and adversarial driving scenarios. The source code is publicly available at https://github.com/data-and-decision-lab/DeFIX, Comment: 6 pages, 4 figures, 2 tables, published in IEEE International Conference on Intelligent Transportation Systems (ITSC), October 12, 2022, Macau, China