期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到67篇文章
< 1 2 … 4 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Task Graph Reduction Algorithm for Hardware/Software Partitioning 认领 引用 被引量：2
1
作者 LI Hui LIU Wenjui +2 位作者 WU Jigang JIANG Guiyuan HAN Honglei 《Wuhan University Journal of Natural Sciences》 CAS 2012年第2期126-130,共5页
Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with p... Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy. 展开更多
关键词 HW/SW partitioning task graph algorithm embedded system
暂未订购 下载PDF
Correlation analysis between characteristics under gastroscope and image information of tongue in patients with chronic gastritis 认领 引用 被引量：8
2
作者 SHANG Zimeng DU Zhengguang +4 位作者 GUAN Bei JI Xingyu CHEN Longchang WANG Yongji MA Yun 《Journal of Traditional Chinese Medicine》 SCIE CSCD 2022年第1期102-107,共6页
OBJECTIVE:To explore the correlation between diagnostic information of tongue and gastroscopy results of patients with chronic gastritis.METHODS:Frequent pattern growth(FP-Growth),SPSS Modeler was used to analyze the ... OBJECTIVE:To explore the correlation between diagnostic information of tongue and gastroscopy results of patients with chronic gastritis.METHODS:Frequent pattern growth(FP-Growth),SPSS Modeler was used to analyze the correlation rules between the image information of tongue parameters and the characteristics of the stomach and duodenum seen under gastroscopy.RESULTS:Ranking in order of confidence:cyanotic tongue,slippery fur,yellow fur and spotted tongue were sequently associated with both gastric antrum mucosal hyperemia or edema and gastric antrum mucosal erythema/macula.L,one value of tongue coating color,which counted among(30,60),tooth-marked tongue and b,one value of tongue coating color,which counted in the range of(5,20)were sequently associated with gastric antrum mucosal erythema/macula.A,one value of tongue body color,which counted in the range of(0,20),was related to both gastric antrum mucosal hyperemia or edema and gastric antrum mucosal erythema/macula.a,one value of tongue coating color,which counted in the range of(15,35),was associated with gastric antrum mucosal erythema/macula.There are a total of 9 strong correlation rules.CONCLUSIONS:Cyanotic tongue,slippery fur,yellow fur,the CIE Lab value of tongue coating,a,the value of tongue body color,spotted tongue,and tooth-marked tongue are all related to the gastric antrum mucosal hyperemia or edema and gastric antrum mucosal erythema/macula.The conditions of gastric mucosa could be predicted by the examination of the above related image information of tongue. 展开更多
关键词 gastritis tongue stomach duodenum correlation of data frequent pattern growth algorithm
暂未订购 下载PDF
Defect detection of gear parts in virtual manufacturing 认领 引用 被引量：2
3
作者 Zhenxing Xu Aizeng Wang +1 位作者 Fei Hou Gang Zhao 《Visual Computing for Industry,Biomedicine,and Art》 EI 2023年第1期76-87,共12页
Gears play an important role in virtual manufacturing systems for digital twins;however,the image of gear tooth defects is difficult to acquire owing to its non-convex shape.In this study,a deep learning network is pr... Gears play an important role in virtual manufacturing systems for digital twins;however,the image of gear tooth defects is difficult to acquire owing to its non-convex shape.In this study,a deep learning network is proposed to detect gear defects based on their point cloud representation.This approach mainly consists of three steps:(1)Various types of gear defects are classified into four cases(fracture,pitting,glue,and wear);A 3D gear dataset was constructed with 10000 instances following the aforementioned classification.(2)Gear-PCNet++introduces a novel Combinational Convolution Block,proposed based on the gear dataset for gear defect detection to effectively extract the local gear information and identify its complex topology;(3)Compared with other methods,experiments show that this method can achieve better recognition results for gear defects with higher efficiency and practicability. 展开更多
关键词 Defect detection Gear surface Gear dataset Combinational Convolution Block
暂未订购 下载PDF
Three-dimensional reconstruction of industrial parts from a single image 认领 引用 被引量：2
4
作者 Zhenxing Xu Aizeng Wang +1 位作者 Fei Hou Gang Zhao 《Visual Computing for Industry,Biomedicine,and Art》 EI 2024年第1期340-351,共12页
This study proposes an image-based three-dimensional(3D)vector reconstruction of industrial parts that can gener-ate non-uniform rational B-splines(NURBS)surfaces with high fidelity and flexibility.The contributions o... This study proposes an image-based three-dimensional(3D)vector reconstruction of industrial parts that can gener-ate non-uniform rational B-splines(NURBS)surfaces with high fidelity and flexibility.The contributions of this study include three parts:first,a dataset of two-dimensional images is constructed for typical industrial parts,including hex-agonal head bolts,cylindrical gears,shoulder rings,hexagonal nuts,and cylindrical roller bearings;second,a deep learning algorithm is developed for parameter extraction of 3D industrial parts,which can determine the final 3D parameters and pose information of the reconstructed model using two new nets,CAD-ClassNet and CAD-ReconNet;and finally,a 3D vector shape reconstruction of mechanical parts is presented to generate NURBS from the obtained shape parameters.The final reconstructed models show that the proposed approach is highly accurate,efficient,and practical. 展开更多
关键词 Three-dimensional reconstruction Non-uniform rational B-splines Industrial parts Deep learning
暂未订购 下载PDF
On Self-adjustment of Social Conventions to Small Perturbations 认领 引用 被引量：1
5
作者 蒋嶷川 《Chinese Physics Letters》 SCIE EI CAS 2008年第12期4215-4218,共4页
We present a model for self-adjustment of social conventions to small perturbations, and investigate how perturbations can influence the convergence of social convention in different situations. The experimental resul... We present a model for self-adjustment of social conventions to small perturbations, and investigate how perturbations can influence the convergence of social convention in different situations. The experimental results show that the sensitivity of social conventions is determined by not only the perturbations themselves but also the agent adjustment functions for the perturbations; and social conventions are more sensitive to the outlier agent number than to the strategy fluctuation magnitudes and localities of perturbations. 展开更多
关键词 field emission molybdenum dioxide enhancement factor
暂未订购 下载PDF
Experimental robustness benchmarking of quantum neural networks on a superconducting quantum processor 认领 引用
6
作者 Hai-Feng Zhang Zhao-Yun Chen +17 位作者 Peng Wang Liang-Liang Guo Tian-Le Wang Xiao-Yan Yang Ren-Ze Zhao Ze-An Zhao Sheng Zhang Lei Du Hao-Ran Tao Zhi-Long Jia Wei-Cheng Kong Huan-Yu Liu Athanasios V.Vasilakos Yang Yang Yu-Chun Wu Ji Guan Peng Duan Guo-Ping Guo 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CSCD 2026年第6期75-85,共11页
Quantum machine learning(QML)models,like their classical counterparts,are intrinsically vulnerable to adversarial attacks,hindering their secure deployment.Here,we report the first systematic experimental benchmark of... Quantum machine learning(QML)models,like their classical counterparts,are intrinsically vulnerable to adversarial attacks,hindering their secure deployment.Here,we report the first systematic experimental benchmark of robustness for 20-qubit quantum neural network(QNN)classifiers executed on a superconducting processor.Our benchmarking protocol features an efficient adversarial attack algorithm tailored for quantum hardware,enabling the diagnosis of QNN’s robustness across diverse datasets.The empirical upper bound extracted from our attack experiments deviates by only 3×10−3from the analytical lower bound,providing strong experimental confirmation of our attack’s precision and the tightness of the fidelity-based robustness bounds.Furthermore,our quantitative analysis reveals that adversarial training mitigates sensitivity to targeted perturbations by regularizing input gradients,thereby significantly enhancing QNN robustness.Additionally,we observe that experimentally measured QNNs exhibit higher adversarial robustness than classical neural networks,an effect attributed to inherent quantum noise.Our work establishes the first scalable and experimentally accessible framework for robustness benchmarking,paving the way for secure and reliable QML applications. 展开更多
关键词 quantum neural networks adversarial attack algorithm quantum adversarial robustness superconducting qubits
暂未订购 下载PDF
Correction to: The Life Cycle of Knowledge in Big Language Models: A Survey 认领 引用
7
作者 Boxi Cao Hongyu Lin +1 位作者 Xianpei Han Le Sun 《Machine Intelligence Research》 EI CSCD 2025年第6期1167-1167,共1页
Correction to:The Life Cycle of Knowledge in Big Language Models:A Survey DOI:10.1007/s11633-023-1416-x Authors:Boxi Cao,Hongyu Lin,Xianpei Han,Le Sun The article The Life Cycle of Knowledge in Big Language Models:A S... Correction to:The Life Cycle of Knowledge in Big Language Models:A Survey DOI:10.1007/s11633-023-1416-x Authors:Boxi Cao,Hongyu Lin,Xianpei Han,Le Sun The article The Life Cycle of Knowledge in Big Language Models:A Survey,written by Boxi Cao,Hongyu Lin,Xianpei Han,Le Sun,was originally published without Open Access.After publication,the authors decided to opt for Open Choice and to make the article an Open Access publication. 展开更多
关键词 life cycle knowledge knowledge survey life cycle open access publication open choice big language models open accessafter
Modelling and Verification of Real-Time Publish and Subscribe Protocol Using UPPAAL and Simulink/Stateflow 认领 引用 被引量：2
8
作者 Qian-Qian Lin Shu-Ling Wang +1 位作者 Bo-Hua Zhan Bin Gu 《Journal of Computer Science & Technology》 SCIE EI CSCD 2020年第6期1324-1342,共19页
Real-Time Publish and Subscribe (RTPS) protocol is a protocol for implementing message exchange over an unreliable transport in data distribution service (DDS). Formal modelling and verification of the protocol provid... Real-Time Publish and Subscribe (RTPS) protocol is a protocol for implementing message exchange over an unreliable transport in data distribution service (DDS). Formal modelling and verification of the protocol provide stronger guarantees of its correctness and efficiency than testing alone. In this paper, we build formal models for the RTPS protocol using UPPAAL and Simulink/Stateflow. Modelling using Simulink/Stateflow allows analyzing the protocol through simula-tion, as well as generate executable code. Modelling using UPPAAL allows us to verify properties of the model stated in TCTL (Timed Computation Tree Logic), as well as estimate its performance using statistical model checking. We further describe a procedure for translation from Stateflow to timed automata, where a subset of major features in Stateflow is supported, and prove the soundness statement that the Stateflow model is a refinement of the translated timed automata model. As a consequence, any property in a certain fragment of TCTL that we have verified for the timed automata model in UPPAAL is preserved for the original Stateflow model. 展开更多
关键词 Real-Time Publish and Subscribe(RTPS) modelling verification UPPAAL Simulink/Stateflow
暂未订购 下载PDF
Empirical investigation of stochastic local search for maximum satisfiability 认领 引用 被引量：6
9
作者 Yi CHU Chuan LUO +1 位作者 Shaowei CAI Haihang YOU 《Frontiers of Computer Science》 SCIE EI CSCD 2019年第1期86-98,共13页
The maximum satisfiability (MAX-SAT)problem is an important NP-hard problem in theory,and has a broad range of applications in practice.Stochastic local search (SLS)is becoming an increasingly popular method for solvi... The maximum satisfiability (MAX-SAT)problem is an important NP-hard problem in theory,and has a broad range of applications in practice.Stochastic local search (SLS)is becoming an increasingly popular method for solving MAX-SAT.Recently,a powerful SLS algorithm called CCLS shows efficiency on solving random and crafted MAX-SAT instances.However,the performance of CCLS on solving industrial MAX-SAT instances lags far behind.In this paper,we focus on experimentally analyzing the performance of SLS algorithms for solving industrial MAXSAT instances.First,we conduct experiments to analyze why CCLS performs poor on industrial instances.Then we propose a new strategy called additive BMS (Best from Multiple Selections)to ease the serious issue.By integrating CCLS and additive BMS,we develop a new SLS algorithm for MAXSAT called CCABMS,and related experiments indicate the efficiency of CCABMS.Also,we experimentally analyze the effectiveness of initialization methods on SLS algorithms for MAX-SAT,and combine an effective initialization method with CCABMS,resulting in an enhanced algorithm.Experimental results show that our enhanced algorithm performs better than its state-of-the-art SLS competitors on a large number of industrial MAX-SAT instances. 展开更多
关键词 empirical investigation stochastic local search maximum satisfiability industrial instances additive BMS
暂未订购 下载PDF
Improved Bounded Model Checking for the Universal Fragment of CTL 认领 引用 被引量：8
10
作者 徐亮 陈伟 +1 位作者 徐艳艳 张文辉 《Journal of Computer Science & Technology》 SCIE EI 2009年第1期96-109,共14页
SAT-based bounded model checking （BMC） has been introduced as a complementary technique to BDD-based symbolic model checking in recent years, and a lot of successful work has been done in this direction. The approac... SAT-based bounded model checking （BMC） has been introduced as a complementary technique to BDD-based symbolic model checking in recent years, and a lot of successful work has been done in this direction. The approach was first introduced by A. Biere et al. in checking linear temporal logic （LTL） formulae and then also adapted to check formulae of the universal fragment of computation tree logic （ACTL） by W. Penczek et al. As the efficiency of model checking is still an important issue, we present an improved BMC approach for ACTL based on Penczek＇s method. We consider two aspects of the approach. One is reduction of the number of variables and transitions in the κ-model by distinguishing the temporal operator EX from the others. The other is simplification of the transformation of formulae by using uniform path encoding instead of a disjunction of all paths needed in the κ-model. With these improvements, for an ACTL formula, the length of the final encoding of the formula in the worst case is reduced. The improved approach is implemented in the tool BMV and is compared with the original one by applying both to two well known examples, mutual exclusion and dining philosophers. The comparison shoves the advantages of the improved approach with respect to the efficiency of model checking. 展开更多
关键词 software verification model checking algorithm bounded model checking ACTL SAT
暂未订购 下载PDF
Bottleneck Prediction Method Based on Improved Adaptive Network-based Fuzzy Inference System (ANFIS) in Semiconductor Manufacturing System 认领 引用 被引量：7
11
作者 曹政才 邓积杰 +1 位作者 刘民 王永吉 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2012年第6期1081-1088,共8页
Semiconductor manufacturing (SM) system is one of the most complicated hybrid processes involved continuously variable dynamical systems and discrete event dynamical systems. The optimization and scheduling of semicon... Semiconductor manufacturing (SM) system is one of the most complicated hybrid processes involved continuously variable dynamical systems and discrete event dynamical systems. The optimization and scheduling of semiconductor fabrication has long been a hot research direction in automation. Bottleneck is the key factor to a SM system, which seriously influences the throughput rate, cycle time, time-delivery rate, etc. Efficient prediction for the bottleneck of a SM system provides the best support for the consequent scheduling. Because categorical data (product types, releasing strategies) and numerical data (work in process, processing time, utilization rate, buffer length, etc.) have significant effect on bottleneck, an improved adaptive network-based fuzzy inference system (ANFIS) was adopted in this study to predict bottleneck since conventional neural network-based methods accommodate only numerical inputs. In this improved ANFIS, the contribution of categorical inputs to firing strength is reflected through a transformation matrix. In order to tackle high-dimensional inputs, reduce the number of fuzzy rules and obtain high prediction accuracy, a fuzzy c-means method combining binary tree linear division method was applied to identify the initial structure of fuzzy inference system. According to the experimental results, the main-bottleneck and sub-bottleneck of SM system can be predicted accurately with the proposed method. 展开更多
关键词 semiconductor manufacturing system bottleneck prediction adaptive network-based fuzzy inference system
暂未订购 下载PDF
The Life Cycle of Knowledge in Big Language Models:A Survey 认领 引用 被引量：2
12
作者 Boxi Cao Hongyu Lin +1 位作者 Xianpei Han Le Sun 《Machine Intelligence Research》 EI CSCD 2024年第2期217-238,共22页
Knowledge plays a critical role in artificial intelligence.Recently,the extensive success of pre-trained language models(PLMs)has raised significant attention about how knowledge can be acquired,maintained,updated and... Knowledge plays a critical role in artificial intelligence.Recently,the extensive success of pre-trained language models(PLMs)has raised significant attention about how knowledge can be acquired,maintained,updated and used by language models.Despite the enormous amount of related studies,there is still a lack of a unified view of how knowledge circulates within language models throughout the learning,tuning,and application processes,which may prevent us from further understanding the connections between current progress or realizing existing limitations.In this survey,we revisit PLMs as knowledge-based systems by dividing the life circle of knowledge in PLMs into five critical periods,and investigating how knowledge circulates when it is built,maintained and used.To this end,we systematically review existing studies of each period of the knowledge life cycle,summarize the main challenges and current limitations,and discuss future directions. 展开更多
关键词 Pre-trained language model knowledge acquisition knowledge representation knowledge probing knowledge editing knowledge application
The theory and practice in the evolution of trusted computing 认领 引用 被引量：8
13
作者 Dengguo Feng Yu Qin +1 位作者 Wei Feng Jianxiong Shao 《Chinese Science Bulletin》 2014年第32期4173-4189,共17页
Trusted computing(TC)is an emerging technology to enhance the security of various computing platforms by a dedicated secure chip(TPM/TCM),which is widely accepted by both the industrial and academic world.This paper a... Trusted computing(TC)is an emerging technology to enhance the security of various computing platforms by a dedicated secure chip(TPM/TCM),which is widely accepted by both the industrial and academic world.This paper attempts to sketch the evolution of TC from the view of our theoretical and engineering work.In theory,we focus on protocol design and security analysis.We have proposed the first ECDAA protocol scheme based on q-SDH assumption,which highlights a new way to design direct anonymous attestation scheme.In technical evolution,we discuss the key technologies of trust chain,trusted network connection and TC testing and evaluation.We break through several key technologies such as trusted boot,OS measurement and remote attestation,and implement a TC system from TPM/TCM to network.We also design and implement a testing and evaluation system of TC platform,which is the first one put into practical application in China.Finally,with the rapid development of cloud computing and mobile applications,TC is moving toward some new directions,such as the trust in cloud and mobile environments,new TPM standard,and flexible trust execution environment trust establishment method. 展开更多
关键词 可信计算 TCM 计算平台 移动应用 TPM 安全芯片 安全分析 匿名认证
A web based tool to merge geometric morphometric data from multiple characters 认领 引用 被引量：2
14
作者 Ming Bai Jing Li +7 位作者 Wencheng Wang Rolf G. Beutel Benjamin Wipfle Wangang Liu ShaLi Mengna Zhang Yuanyuan Lu Xingke Yang 《Zoological Systematics》 CSCD 2017年第1期34-45,共12页
Geometric morphometrics （GM） is an important method of shape analysis and increasingly used in a wide range of scientific disciplines. Presently, a single character comparison system of geometric morphometric data i... Geometric morphometrics （GM） is an important method of shape analysis and increasingly used in a wide range of scientific disciplines. Presently, a single character comparison system of geometric morphometric data is used in almost all empirical studies, and this approach is sufficient for many scientific problems. However, the estimation of overall similarity among taxa or objects based on multiple characters is crucial in a variety of contexts （e.g. （semi-）automated identification, phenetic relationships, tracing of character evolution, phylogenetic reconstruction）. Here we propose a new web-based tool for merging several geometric morphometrics data files from multiple characters into a single data file. Using this approach information from multiple characters can be compared in combination and an overall similarity estimate can be obtained in a convenient and geometrically rigorous manner. To illustrate our method, we provide an example analysis of 25 dung beetle species with seven Procrustes superimposed landmark data files representing the morphological variation of body features： the epipharynx, right mandible, pronotum, elytra, hindwing, and the metendosternite in dorsal and lateral view. All seven files were merged into a single one containing information on 649 landmark locations. The possible applications of such merged data files in different fields of science are discussed. 展开更多
关键词 Geometric morphometrics multiple characters merging overall similarity lcs.ios.ac.cn/-mgm.
暂未订购 下载PDF
Interactive Depth-of-Field Rendering with Secondary Rays 认领 引用 被引量：2
15
作者 谢国富 孙鑫 王文成 《Journal of Computer Science & Technology》 SCIE EI CSCD 2013年第3期490-498,共9页
This paper presents an efficient method to trace secondary rays in depth-of-field （DOF） rendering, which significantly enhances realism. Till now, the effects by secondary rays have been little addressed in real-tim... This paper presents an efficient method to trace secondary rays in depth-of-field （DOF） rendering, which significantly enhances realism. Till now, the effects by secondary rays have been little addressed in real-time/interactive DOF rendering, because secondary rays have less coherence than primary rays, making them very difficult to handle. We propose novel measures to cluster secondary rays, and take a virtual viewpoint to construct a layered image-based representation for the objects that would be intersected by a cluster of secondary rays respectively. Therefore, we can exploit coherence of secondary rays in the clusters to speed up tracing secondary rays in DOF rendering. Results show that, we can interactively achieve DOF rendering effects with reflections or refractions on a commodity graphics card. 展开更多
关键词 interactive rendering depth-of-field effect reflection refraction clustering
暂未订购 下载PDF
Complete Proof Systems for Amortised Probabilistic Bisimulations 认领 引用 被引量：1
16
作者 Li-Li Xu Hui-Min Lin 《Journal of Computer Science & Technology》 SCIE EI CSCD 2016年第2期300-316,共17页
The notion of amortisation has been integrated in quantitative bisimulations to make long-term behavioral comparisons between nondeterministic systems. In this paper, we present sound and complete proof systems for am... The notion of amortisation has been integrated in quantitative bisimulations to make long-term behavioral comparisons between nondeterministic systems. In this paper, we present sound and complete proof systems for amortised strong probabilistic bisimulation and its observational congruence on a process algebra with probability and nondeterminism, and prove their soundness and completeness. Our results make it possible to reason about long-term （observable） probabilistic behaviors by syntactic manipulations. 展开更多
关键词 axiomatization probabilistic calculus for communication systems （CCS） probabilistic automata amortisedbisimulation
暂未订购 下载PDF
Linear algorithm for lexicographic enumeration of CFG parse trees 认领 引用 被引量：2
17
作者 DONG YunMei 《Science in China(Series F)》 2009年第7期1177-1202,共26页
We study CFG parse tree enumeration in this paper. By dividing the set of all parse trees into infinite hierarchies according to height of parse tree, the hierarchical lexicographic order on the set of parse trees is ... We study CFG parse tree enumeration in this paper. By dividing the set of all parse trees into infinite hierarchies according to height of parse tree, the hierarchical lexicographic order on the set of parse trees is established. Then grammar-based algorithms for counting and enumerating CFG parse trees in this order are presented. To generate a parse tree of height n, the time complexity is O（n）. If τ is a lowest parse tree for its yield, then O（n） =O（｜｜τ｜｜ ＋ 1）, where ｜｜τ｜｜ is the length of the sentence （yield） generated by τ. The sentence can be obtained as a by-product of the parse tree. To compute sentence from its parse tree （needn＇t be lowest one）, the time complexity is O（node）＋O（｜｜τ｜｜ ＋ 1）, where node is the number of non-leaf nodes of parse tree τ. To generate both a complete lowest parse tree and its yield at the same time, the time complexity is O（｜｜τ｜｜ ＋ 1）. 展开更多
关键词 hierarchical construction of set of parse trees lexicographic enumeration of parse trees counting of parse trees
An Axiom System of Probabilistic Mu-Calculus 认领 引用
18
作者 Wanwei Liu Junnan Xu +2 位作者 David N.Jansen Andrea Turrini Lijun Zhang 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2022年第2期372-385,共14页
Mu-calculus(a.k.a.μTL)is built up from modal/dynamic logic via adding the least fixpoint operatorμ.This type of logic has attracted increasing attention since Kozen’s seminal work.PμTL is a succinct probabilistic ... Mu-calculus(a.k.a.μTL)is built up from modal/dynamic logic via adding the least fixpoint operatorμ.This type of logic has attracted increasing attention since Kozen’s seminal work.PμTL is a succinct probabilistic extension of the standardμTL obtained by making the modal operators probabilistic.Properties of this logic,such as expressiveness and satisfiability decision,have been studied elsewhere.We consider another important problem:the axiomatization of that logic.By extending the approaches of Kozen and Walukiewicz,we present an axiom system for PμTL.In addition,we show that the axiom system is complete for aconjunctive formulas. 展开更多
关键词 PμTL axiom system aconjunctive formula tableau approach
暂未订购 下载PDF
Clausal Presentation of Theories in Deduction Modulo 认领 引用
19
作者 高建华 《Journal of Computer Science & Technology》 SCIE EI CSCD 2013年第6期1085-1096,共12页
Resolution modulo is an extension of first-order resolution in which rewrite rules are used to rewrite clauses during the search. In the first version of this method, clauses are rewritten to arbitrary propositions. T... Resolution modulo is an extension of first-order resolution in which rewrite rules are used to rewrite clauses during the search. In the first version of this method, clauses are rewritten to arbitrary propositions. These propositions are needed to be dynamically transformed into clauses. This unpleasant feature can be eliminated when the rewrite system is clausal, i.e., when it rewrites clauses to clauses. We show in this paper how to transform any rewrite system into a clausal one, preserving the existence of cut free proofs of any sequent. 展开更多
关键词 resolution deduction modulo cut free proof clause
暂未订购 下载PDF
Optimal Policies for Quantum Markov Decision Processes 认领 引用 被引量：3
20
作者 Ming-Sheng Ying Yuan Feng Sheng-Gang Ying 《International Journal of Automation and computing》 CSCD 2021年第3期410-421,共12页
Markov decision process(MDP)offers a general framework for modelling sequential decision making where outcomes are random.In particular,it serves as a mathematical framework for reinforcement learning.This paper intro... Markov decision process(MDP)offers a general framework for modelling sequential decision making where outcomes are random.In particular,it serves as a mathematical framework for reinforcement learning.This paper introduces an extension of MDP,namely quantum MDP(q MDP),that can serve as a mathematical model of decision making about quantum systems.We develop dynamic programming algorithms for policy evaluation and finding optimal policies for q MDPs in the case of finite-horizon.The results obtained in this paper provide some useful mathematical tools for reinforcement learning techniques applied to the quantum world. 展开更多
关键词 Quantum Markov decision processes quantum machine learning reinforcement learning dynamic programming decision making
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 4 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈