检索结果-内蒙古大学图书馆

Embeddings Between State and Action Based Probabilistic Logics

Formal Aspects of Computing 2025年第2期37卷 1-58页

作者： Das, Susmoy Sharma, Arpit Department of Electrical Engineering and Computer Science Indian Institute of Science Education and Research Bhopal Madhya Pradesh Bhopal India

This article defines embeddings between state-based and action-based probabilistic logics which can be used to support probabilistic model checking. First, we slightly modify the model embeddings proposed in the literature to allow invisible computation steps and the preservation of forward and backward bisimulation relations. Next, we propose the syntax and semantics of an action-based Probabilistic Computation Tree Logic (APCTL) and an action-based PCTL∗(APCTL∗) interpreted over action-labeled discrete-time Markov chains (ADTMCs). We show that both these logics are strictly more expressive than the probabilistic variant of Hennessy-Milner logic (prHML). We define an embedding aldl which can be used to construct APCTL∗formulae from PCTL∗formulae and an embedding sldl from APCTL∗formulae to PCTL∗formulae. Similarly, we define the embeddings and from PCTL to APCTL and APCTL to PCTL, respectively. We also define the reward-based variant of APCTL (APRCTL) interpreted over action-based Markov Reward Models (AMRM), and accordingly modify the logical embeddings and which allows us to take into account the notion of rewards. Additionally, we also show that the idea of rewards can be used to reason about the bounded until operator in PCTL and APCTL. Finally, we prove that our logical embeddings combined with the model embeddings enable one to minimize, analyze, and verify probabilistic models in one domain using state-of-the-art tools and techniques developed for the other domain. In order to validate the efficacy of our theoretical framework, we apply it to two case studies using the probabilistic symbolic model checker (PRISM). © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Probabilistic Markov chain equivalence bisimulation logic embeddings rewards model checking

来源：评论

学校读者我要写书评

暂无评论

Beamforming and Reflection Design for Short Packet ISAC With Non-Ideal RIS: An A3C-Based Approach

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8379-8384页

作者： Mahmoudi, Behrad Khonsari, Ahmad Zeinali, Farshad Mili, Mohammad Robat Mashhadi, Mahdi Boloursaz Xiao, Pei University of Tehran Department of Electrical and Computer Engineering Tehran Iran University of Tehran School of Electrical and Computer Engineering College of Engineering Tehran Iran School of Computer Science in the Institute for Research in Fundamental Sciences Tehran Iran United Kingdom Institute for Advanced Innovative Solutions Tehran Iran

Integrated sensing and communication (ISAC) is a promising solution to mitigate the increasing congestion of the wireless spectrum. In this paper, we investigate the short packet communication regime within an ISAC system assisted by a reconfigurable intelligent surface (RIS) to meet the low latency ultra-reliable requirements in the next-generation wireless networks. We consider a non-ideal RIS model that captures effects of the phase-dependent amplitude variations in the reflection coefficients, and we have incorporated the near-field model into the channels between the RIS and the users or targets. In this setup, we jointly design the transmit beamforming and the RIS phase shifts to maximize the sum rate while satisfying the sensing signal-to-noise ratio (SNR) requirement. The system simultaneously carries out multitarget sensing and multi-user short packet communications with the help of the RIS. Considering the non-convex and dynamic nature of the resulting optimization problem, we propose an asynchronous advantage actor-critic (A3C) based method for beamforming and reflection design in this setup. Numerical results demonstrate the superiority of the proposed scheme over the benchmarks. © 1967-2012 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Vision Transformer and Brain Connectivity Patterns for Estimating Cognitive States

引用

IEEE Access 2025年 13卷 74602-74612页

作者： Chakladar, Debashis Das Luleå University of Technology Department of Computer Science Electrical and Space Engineering Luleå971 87 Sweden

The transformer model is excellent at handling time series signals (such as electroencephalography: EEG) because it can extract information from long-term dependencies effectively. This work combines binarization of EEG connectivity features, cognitive state classification using the vision transformer (ViT), and identifying graphical connectivity patterns for each cognitive state of the mental arithmetic task. The common spatial pattern (CSP) filter coefficient-based channel selection method selects the optimum EEG channels from the input channel set. Then, the Singular Value Decomposition (SVD) method is applied to prepare the binarized connectivity feature matrices, eliminating noisy connections between the optimum channels. The binarized functional-effective connectivity features are passed to the ViT model for cognitive state classification. The ViT model achieves the maximum classification accuracy of 94.86% with the phase-based connectivity feature. The proposed model improves classification accuracy by 6.15% compared to the state-of-the-art studies. This study also suggests a robust brain connectivity network to build a graphical connectivity pattern for each cognitive state. My findings of the EEG-based graphical patterns will bring further understanding of the scalp-level EEG channel patterns among different brain regions for other cognitive tasks. © 2013 IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Medicare fraud detection: a comparative study on the effectiveness of one-class and binary classification models

引用

International Journal of computers and Applications 2025年第3期47卷 323-328页

作者： Leevy, Joffrey L. Hancock, John Khoshgoftaar, Taghi M. Department of Electrical Engineering and Computer Science Florida Atlantic University Boca RatonFL United States

Research into Medicare fraud detection that utilizes machine learning methodologies is of great national interest due to the significant fiscal ramifications of this type of fraud. Our big data analysis pertains to three Medicare datasets: Part B, Part D, and DMEPOS. In this paper, One-Class Classification (OCC) and binary classification approaches are evaluated with six different classifiers. We note that when a practitioner is faced with a high cost or unreasonable wait associated with acquiring a second label for binary classification, OCC may intuitively seem like the better alternative. The evaluative metrics used in our study are Area Under the Receiver Operating Characteristic Curve (AUC) and Area Under the Precision-Recall Curve (AUPRC). As a result of our investigation, binary classification was found to be more effective than OCC in detecting Medicare fraud. Additionally, we determined that gradient-boosting algorithms, specifically CatBoost and XGBoost, yield the most robust performance. © 2024 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Optimized Distribution Systems Reconfiguration Considering Protection Devices Constraints

引用

IEEE Transactions on Power Delivery 2025年第3期40卷 1267-1278页

作者： Kahnamouei, Ali Shakeri Lotfifard, Saeed Rostami, Mohammadali The School of Electrical Engineering and Computer Science Washington State University PullmanWA99164 United States

This paper presents a method for the optimized reconfiguration of radial distribution systems that explicitly considers the protection systems constraints. A fully automated method based on graph analysis is proposed to automatically identify the primary-backup relation between each pair of protection devices in different network topologies. Accordingly, protection systems constraints are derived automatically and incorporated into the optimization problem. The linearized and convexified nonlinear power flow equations, along with protection system coordination constraints, are solved using the second-order cone programming (SOCP) that assures the feasibility of the results while accelerating the convergence rate. The effectiveness of the proposed methodology is demonstrated through the simulation of the 33-node IEEE test system. ©1986-2012 IEEE.

关键词： Second-order cone programming

来源：评论

学校读者我要写书评

暂无评论

Tight Exponential Strong Converse for Source Coding Problem with Encoded Side Information

引用

IEEE Transactions on Information Theory 2025年第3期71卷 1533-1545页

作者： Takeuchi, Daisuke Watanabe, Shun Tokyo University of Agriculture and Technology Department of Electrical Engineering and Computer Science Koganei184-8588 Japan

The source coding problem with encoded side information is considered. A lower bound on the strong converse exponent has been derived by Oohama, but its tightness has not been clarified. In this paper, we derive a tight strong converse exponent. For the special case where the side-information does not exist, we demonstrate that our tight exponent of the Wyner-Ahlswede-Körner (WAK) problem reduces to the known tight expression of that special case while Oohama's lower bound is strictly loose. The converse part is proved by a judicious use of the change-of-measure argument, which was introduced by Gu and Effros and further developed by Tyagi and Watanabe. A key component of the methodology by Tyagi and Watanabe is the use of soft Markov constraint, which was originally introduced by Oohama, as a penalty term to prove the Markov constraint at the end. A technical innovation of this paper compared to Tyagi and Watanabe is recognizing that the soft Markov constraint is a part of the exponent, rather than a penalty term that should vanish at the end;this recognition enables us to derive the matching achievability bound. In fact, via numerical experiment, we provide evidence that the soft Markov constraint is strictly positive. Compared to Oohama's derivation of the lower bound, which relies on the single-letterization of a certain moment-generating function, the derivation of our tight exponent only involves manipulations of the Kullback-Leibrer divergence and Shannon entropies. The achievability part is derived by a careful analysis of the type argument;however, unlike the conventional analysis for the achievable rate region, we need to derive the soft Markov constraint in the analysis of the correct probability. Furthermore, we present an application of our derivation of the strong converse exponent to the privacy amplification. © 1963-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Mathematical Model for Delay Locked Loop Discriminator for 5G Demodulation Reference Signal

引用

IEEE Access 2025年 13卷 69513-69519页

作者： Amjad, Freeha M. Yusof, Kamaludin Mohamad Bouallegue, Belgacem Gasouma, Amir A. A. Universiti Teknologi Malaysia Faculty of Electrical Engineering School of Engineering Skudai81310 Malaysia King Khalid University College of Computer Science Department of Computer Engineering Abha61421 Saudi Arabia

The vulnerable nature of satellite-based positioning systems under certain conditions such as urban canyons and indoors has given rise to the need for alternative positioning system. Cellular signal based positioning is gaining popularity and development of an accurate cellular signal-based positioning receiver is in progress. Among the cellular signals, 5G is the most preferable due to its high carrier frequency, high bandwidth, high power, ease of access and low infrastructure cost. A review of the literature suggests that 5G based positioning receiver uses a Delay Locked Loop (DLL) to track the phase of the demodulation reference signal (DMRS) of the received 5G signal. An essential part of the DLL is the discriminator, which is used to estimate the phase difference between the received DMRS and the replica of transmitted DMRS. In order to understand the working involved in the discriminator, it is ideal to study its mathematical model. The discriminator's mathematical model includes the mathematical representation of early, prompt and late DMRS symbols, the correlations between received DMRS symbols and early, prompt and late DMRS symbols, and the S-curve. These mathematical representations, available in the literature, are analyzed in this work using the MATLAB plots. It is observed that the plots do not accurately depict the theory. Therefore, the need for an improved mathematical model arises. This work is an effort to obtain improved mathematical model for the DLL discriminator processing which is also analyzed using MATLAB plots. The plots show that the improved mathematical model accords with the theory involved in the discriminator. © 2013 IEEE.

关键词： Demodulation

来源：评论

学校读者我要写书评

暂无评论

Fuzzy clustering for electric field characterization and its application to thunderstorm interpretability

引用

Digital Communications and Networks 2025年第2期11卷 299-307页

作者： Xu Yang Hongyan Xing Xinyuan Ji Wei Xu Witold Pedrycz School of Electronics and Information Engineering Nanjing University of Information Science and Technology Department of Electrical and Computer Engineering University of Alberta Systems Research Institute Polish Academy of Sciences Department of Computer Engineering Faculty of Engineering and Natural Sciences Istinye University

Changes in the Atmospheric Electric Field Signal(AEFS) are highly correlated with weather changes, especially with thunderstorm activities. However, little attention has been paid to the ambiguous weather information implicit in AEFS changes. In this paper, a Fuzzy C-Means(FCM) clustering method is used for the first time to develop an innovative approach to characterize the weather attributes carried by AEFS. First, a time series dataset is created in the time domain using AEFS attributes. The AEFS-based weather is evaluated according to the time-series Membership Degree(MD) changes obtained by inputting this dataset into the FCM. Second, thunderstorm intensities are reflected by the change in distance from a thunderstorm cloud point charge to an AEF apparatus. Thus, a matching relationship is established between the normalized distance and the thunderstorm dominant MD in the space domain. Finally, the rationality and reliability of the proposed method are verified by combining radar charts and expert experience. The results confirm that this method accurately characterizes the weather attributes and changes in the AEFS, and a negative distance-MD correlation is obtained for the first time. The detection of thunderstorm activity by AEF from the perspective of fuzzy set technology provides a meaningful guidance for interpretable thunderstorms.

关键词： Atmospheric electric field (AEF) Thunderstorm Fuzzy C-means (FCM) Attribute

来源：评论

学校读者我要写书评

暂无评论

More than just a name?From magnetic to optical skyrmions and the topology of light

引用

Light(science & Applications) 2025年第1期14卷 26-29页

作者： Jian Chen Andrew Forbes Cheng-Wei Qiu School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai200093China Department of Electrical and Computer Engineering National University of SingaporeSingapore117583Singapore School of Physics University of the WitwatersrandJohannesburgSouth Africa

Topology is usually perceived intrinsically immutable for a given *** argue that optical topologies do not immediately enjoy such ***'optical skyrmions'as an example,we show that they will exhibit varying textures and topological invariants(skyrmion numbers),depending on how to construct the skyrmion vector when projecting from real to parameter *** demonstrate the fragility of optical skyrmions under a ubiquitous scenario-simple reflection off an optical *** topology is not without benefit,but it must not be assumed.

关键词： numbers space. topology

来源：评论

学校读者我要写书评

暂无评论

The Duality Upper Bound for Finite-State Channels With Feedback

引用

IEEE Transactions on Information Theory 2025年第5期71卷 3255-3270页

作者： Huleihel, Bashar Sabag, Oron Aharoni, Ziv Permuter, Haim H. Ben-Gurion University of the Negev Department of Electrical and Computer Engineering Be’er Sheva84105 Israel The Hebrew University of Jerusalem Rachel and Selim Benin School of Computer Science and Engineering Jerusalem91904 Israel Duke University Department of Electrical and Computer Engineering DurhamNC27708 United States

This paper investigates the capacity of finite-state channels (FSCs) with feedback. We derive an upper bound on the feedback capacity of FSCs by extending the duality upper bound method from mutual information to the case of directed information. The upper bound is expressed as a multi-letter expression that depends on a test distribution on the sequence of channel outputs. For any FSC, we show that if the test distribution is structured on a Q-graph, the upper bound can be formulated as a Markov decision process (MDP) whose state being a belief on the channel state. In the case of FSCs and states that are either unifilar or have a finite memory, the MDP state simplifies to take values in a finite set. Consequently, the MDP consists of a finite number of states, actions, and disturbances. This finite nature of the MDP is of significant importance, as it ensures that dynamic programming algorithms can solve the associated Bellman equation to establish analytical upper bounds, even for channels with large alphabets. We demonstrate the simplicity of computing bounds by establishing the capacity of a broad family of Noisy Output is the State (NOST) channels as a simple closed-form analytical expression. Furthermore, we introduce novel, nearly optimal analytical upper bounds on the capacity of the Noisy Ising channel. © 1963-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：