Hidden Markov models (HMMs) are a powerful class of dynamical models for representing complex systems that are partially observed through sensory data. Existing data collection methods for HMMs, typically based on act...
详细信息
Variable-flux permanent magnet synchronous machines (VF-PMSMs) were proposed to avoid the additional losses of conventional PMSMs during flux weakening (FW) operation at high speeds, as they allow dynamic manipulation...
详细信息
The offering strategy of energy storage in energy and frequency response(FR) markets needs to account for country-specific market regulations around FR products as well as FR utilization factors, which are highly unce...
详细信息
The offering strategy of energy storage in energy and frequency response(FR) markets needs to account for country-specific market regulations around FR products as well as FR utilization factors, which are highly uncertain. To this end, a novel optimal offering model is proposed for stand-alone price-taking storage participants, which accounts for recent FR market design developments in the UK, namely the trade of FR products in time blocks, and the mutual exclusivity among the multiple FR products. The model consists of a day-ahead stage, devising optimal offers under uncertainty, and a real-time stage, representing the storage operation after uncertainty is materialized. Furthermore, a concrete methodological framework is developed for comparing different approaches around the anticipation of uncertain FR utilization factors(deterministic one based on expected values, deterministic one based on worst-case values, stochastic one, and robust one), by providing four alternative formulations for the real-time stage of the proposed offering model, and carrying out an out-of-sample validation of the four model instances. Finally, case studies employing real data from UK energy and FR markets compare these four instances against achieved profits, FR delivery violations, and computational scalability.
The incredible progress in technologies has drastically increased the usage of Web *** share their credentials like userid and password or use their smart cards to get authenticated by the application *** cards are ha...
详细信息
The incredible progress in technologies has drastically increased the usage of Web *** share their credentials like userid and password or use their smart cards to get authenticated by the application *** cards are handy to use,but they are susceptible to stolen smart card attacks and few other notable security *** prefer to use Web applications that guarantee for security against several security attacks,especially insider attacks,which is *** of several existing schemes prove the security pitfalls of the protocols from preventing security attacks,specifically insider *** paper introduces LAPUP:a novel lightweight authentication protocol using physically unclonable function(PUF)to prevent security attacks,principally insider *** PUFs are used to generate the security keys,challenge-response pair(CRP)and hardware signature for designing the *** transmitted messages are shared as hash values and encrypted by the keys generated by *** messages are devoid of all possible attacks executed by any attacker,including insider *** is also free from stolen verifier attacks,as the databases are secured by using the hardware signature generated by *** analysis of the protocol exhibits the strength of LAPUP in preventing insider attacks and its resistance against several other security *** evaluation results of the communication and computation costs of LAPUP clearly shows that it achieves better performance than existing protocols,despite providing enhanced security.
The field of computer vision is predominantly driven by supervised models, which, despite their efficacy, are computationally expensive and often intractable for many applications. Recently, research has expedited alt...
详细信息
Purpose: Potassium imbalance, often symptomless but potentially fatal, is prevalent in patients with kidney or heart conditions. Traditional laboratory tests for potassium measurement are costly and require skilled te...
详细信息
Millimeter-wave network deployment is an essential and ongoing problem due to the limited coverage and expensive network infrastructure. In this work, we solve a joint network deployment and resource allocation optimi...
详细信息
Millimeter-wave network deployment is an essential and ongoing problem due to the limited coverage and expensive network infrastructure. In this work, we solve a joint network deployment and resource allocation optimization problem for a mmWave cell-free massive MIMO network considering indoor environments. The objective is to minimize the number of deployed access points (APs) for a given environment, bandwidth, AP cooperation, and precoding scheme while guaranteeing the rate requirements of the user equipments (UEs). Considering coherent joint transmission (C-JT) and non-coherent joint transmission (NC-JT), we solve the problem of AP placement, UE-AP association, and power allocation among the UEs and resource blocks jointly. For numerical analysis, we model a mid-sized airplane cabin in ray-tracing as an exemplary case for IDS. Results demonstrate that a minimum data rate of 1 Gbps can be guaranteed with less than 10 APs with C-JT. From a holistic network design perspective, we analyze the trade-off between the required fronthaul capacity and the processing capacity per AP, under different network functional split options. We observe an above 600 Gbps fronthaul rate requirement, once all network operations are centralized, which can be reduced to 200 Gbps under physical layer functional splits. 2002-2012 IEEE.
This study investigates robot path planning for multiple agents,focusing on the critical requirement that agents can pursue concurrent pathways without *** agent is assigned a task within the environment to reach a de...
详细信息
This study investigates robot path planning for multiple agents,focusing on the critical requirement that agents can pursue concurrent pathways without *** agent is assigned a task within the environment to reach a designated *** the map or goal changes unexpectedly,particularly in dynamic and unknown environments,it can lead to potential failures or performance degradation in various ***,priority inheritance plays a significant role in path planning and can impact *** study proposes a ConflictBased Search(CBS)approach,introducing a unique hierarchical search mechanism for planning paths for multiple *** study aims to enhance flexibility in adapting to different *** scenarios were tested,and the accuracy of the proposed algorithm was *** the first scenario,path planning was applied in unknown environments,both stationary and mobile,yielding excellent results in terms of time to arrival and path length,with a time of 2.3 *** the second scenario,the algorithm was applied to complex environments containing sharp corners and unknown obstacles,resulting in a time of 2.6 s,with the algorithm also performing well in terms of path *** the final scenario,the multi-objective algorithm was tested in a warehouse environment containing fixed,mobile,and multi-targeted obstacles,achieving a result of up to 100.4 *** on the results and comparisons with previous work,the proposed method was found to be highly effective,efficient,and suitable for various environments.
This paper provides a finite-sample analysis of a passive stochastic gradient Langevin dynamics (PSGLD) algorithm. This algorithm is designed to achieve adaptive inverse reinforcement learning (IRL). Adaptive IRL aims...
详细信息
We explore the impact of coarse quantization on matrix completion in the extreme scenario of dithered one-bit sensing, where the matrix entries are compared with random dither levels. In particular, instead of observi...
详细信息
We explore the impact of coarse quantization on matrix completion in the extreme scenario of dithered one-bit sensing, where the matrix entries are compared with random dither levels. In particular, instead of observing a subset of high-resolution entries of a low-rank matrix, we have access to a small number of one-bit samples, generated as a result of these comparisons. In order to recover the low-rank matrix using its coarsely quantized known entries, we begin by transforming the problem of one-bit matrix completion (one-bit MC) with random dithering into a nuclear norm minimization problem. The one-bit sampled information is represented as linear inequality feasibility constraints. We then develop the popular singular value thresholding (SVT) algorithm to accommodate these inequality constraints, resulting in the creation of the One-Bit SVT (OBSVT). Our findings demonstrate that incorporating multiple random dither sequences in one-bit MC can significantly improve the performance of the matrix completion algorithm. In pursuit of achieving this objective, we utilize diverse dithering schemes, namely uniform, Gaussian, and discrete dithers. To accelerate the convergence of our proposed algorithm, we introduce three variants of the OB-SVT algorithm. Among these variants is the randomized sketched OB-SVT, which departs from using the entire information at each iteration, opting instead to utilize sketched data. This approach effectively reduces the dimension of the operational space and accelerates the convergence. We perform numerical evaluations comparing our proposed algorithm with the maximum likelihood estimation method previously employed for one-bit MC, and demonstrate that our approach can achieve a better recovery performance. Authors
暂无评论