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

Partial-order Algorithm of Model Checking in µ-Predicate Ambient Logic

Journal of Computers (Taiwan) 2018年第5期29卷 142-159页

作者： Jiang, Hua Lin, Rong-De Zou, Fu-Min Li, Ling-Xiang Key Lab of Granular Computing Minnan Normal University ZhangZhou China School of Mathematical Science Huaqiao university QuanZhou China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fuzhou Fujian350008 China School of Electronics and Information Engineering Hunan University of Science and Engineering Yongzhou425199 China

This paper introduces a kind of partial-order algorithm of model-checking in finite-control mobile ambients against μ-predicate ambient logic(Ambient logic based on first-order μ-calculus). Based on Tarski's fixpoint theorem, nested predicate equations and Block Dependency Graph, a group of partial ordering relation between inter-mediate results in the process of model checking is given, and thus a kind of local model-checking algorithm is proposed. To our knowledge, this is the first algorithm which exponent of time complexity is d/2+2, the exponent of space complexity is d/2 (d is the alternate nesting depth of fixpoint operator in the formula) and this is the third model-checking algorithm for predicate ambient logic with recursion. This paper's contributions are: (1) getting a group of partial ordering relation between intermediate results in the computing process of model checking for µ-calculus first-order predicate ambient logic based on Tarski's fixpoint theorem;(2) using the partial ordering relation to design an algorithm for model checking in mobile ambients;(3) analyzing the complexity of the algorithm. © 2018 Computer Society of the Republic of China. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Achieving High Open-Circuit Voltage in Efficient Kesterite Solar Cells Via Lanthanide Europium Ion Induced Carrier Lifetime Enhancement

SSRN

引用

SSRN 2024年

作者： Chen, Xingye Zhao, Yunhai Ahmad, Nafees Zhao, Jun Zheng, Zhuanghao Su, Zhenghua Peng, Xiaogang Li, Xuejin Zhang, Xianghua Fan, Ping Liang, Guangxing Chen, Shuo Shenzhen Key Laboratory of Advanced Thin Films and Applications Key Laboratory of Optoelectronic Devices and Systems Ministry of Education and Guangdong Province College of Physics and Optoelectronic Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China UMR 6226 Université de Rennes Rennes F-35000 France Shenzhen518060 China

Short carrier lifetimes is a key challenge limiting the open-circuit voltage (VOC) and power conversion efficiency (PCE) of kesterite Cu2ZnSn(S,Se)4 (CZTSSe) solar cells. In this work, for the first time, lanthanide europium (Eu) ions have been introduced into Ag-incorporated CZTSSe absorber layer, which can modify the selenization reaction pathway during the initial selenization process, leading to high-quality (Ag, Eu)-CZTSSe absorber with large compact crystal grains and benign surface potential fluctuations. This innovative absorber engineering can also optimize defects dynamics with less detrimental defects and defects-assisted non-radiative recombination. Thus, significantly enhanced minority carrier lifetimes from 0.97 to 3.15 ns can be achieved, representing one of the top values among various bulk and/or interface engineering treated CZTSSe. The champion CZTSSe thin-film solar cell exhibits an impressive VOC of 545.6 mV, accompanied with a stimulating increase in PCE from 10.61% to 13.30%. These findings underscore the potential of lanthanide cation doping to drive significant advancements in CZTSSe photovoltaic technology, and therefore promoting its further development and future applications. © 2024, The Authors. All rights reserved.

关键词： Open circuit voltage

来源：评论

学校读者我要写书评

暂无评论

Incremental Cognitive Learning Approach Based on Concept Reduction

SSRN

引用

SSRN 2024年

作者： Liang, Taoju Lin, Yidong Li, Jinjin Wang, Qijun School of Mathematics and Statistics Minnan Normal University Zhangzhou363000 China Institute of Meteorological Big Data-Digital Fujian Minnan Normal University Zhangzhou363000 China Fujian Key Laboratory of Granular Computing and Applications Minnan Normal University Zhangzhou363000 China

Concept-cognitive learning (CCL) offers an innovative approach to classification, and concept reduction serves as a powerful method for compressing data. Nonetheless, most existing CCLs tend to incur information loss during the compression of concept space. On the other hand, current incremental CCLs have limited capacity to effectively utilize newly acquired knowledge. In view of these observations, in this article, we propose a novel incremental CCL method based on concept reduction for dynamic classification. To enhance the efficiency of knowledge acquisition, recover degree is developed to obtain concept reduction from granular concept space. Subsequently, the updating mechanism for concept reduction is explored in dynamic environments. For label recognition, a learning method based on concept reduction is discussed and an incremental learning mechanism for dynamic increased data is further constructed. Empirical studies on twelve datasets from UCI reveal the effectiveness and efficiency of proposed model. © 2024, The Authors. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

On Star Coloring of Several Corona Graphs

引用

Journal of Physics: Conference Series 2021年第1期1738卷

作者： Jin Cai Shuangliang Tian Zhuomo An School of Mathematics and Computer Science Northwest for Minzu University Lanzhou 730030 China Key Laboratory of Streaming Data Computing Technologies and Applications Northwest Minzu University Lanzhou 730030 China

Let G be a simple graph with vertex set V(G) and edge set E(G). A vertex coloring of G is called a star coloring of G if any of the paths of 4 order are bicolored. The minimum number of colors required for a star coloring of G is denoted by χs(G). The corona product of simple graphs G of order m and H of order n is graph G ∘ H with vertex set V(G ∘ H) = {vi|i = 1,2,⋯m}∪{vij|i = 1,2,⋯m, j = 1,2,⋯n}, in which vi is adjacent to every vertex of Hi if and only if, vi ∈ V(G), vij ∈ V(Hi). According to the existing graph dyeing literature, it has become a very important technical means to study the graph dyeing problem by using the graph structure operation. Therefore, it is of great significance to study the star coloring of graphs for studying the acyclic coloring and distance coloring of graphs, the study has strong application background and great theoretical value for computing graphs. In this paper, we find the upper bound of χs(G ∘ H) and the exact values of χs(G ∘ H) of the corona product G ∘ H of two graphs G and H as: χs(G ∘ H) ≤ χs(G) + χs(H); χs(Pm ∘ H) = χs(H) + 2; χs(K1,m ∘ H) = χs(H) + 2; χs(Cn ∘ H) = χs(H) + 2, where n ≠ 5.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Machine learning for modelling unstructured grid data in computational physics: a review

arXiv

引用

arXiv 2025年

作者： Cheng, Sibo Bocquet, Marc Ding, Weiping Finn, Tobias Sebastian Fu, Rui Fu, Jinlong Guo, Yike Johnson, Eleda Li, Siyi Liu, Che Moro, Eric Newton Pan, Jie Piggott, Matthew Quilodran, Cesar Sharma, Prakhar Wang, Kun Xiao, Dunhui Xue, Xiao Zeng, Yong Zhang, Mingrui Zhou, Hao Zhu, Kewei Arcucci, Rossella CEREA ENPC EDF R&D Institut Polytechnique de Paris Île-de-France France School of Artificial Intelligence and Computer Science Nantong University Jiangsu Nantong226019 China School of Mathematical Sciences Key Laboratory of Intelligent Computing and Applications Tongji University Shanghai200092 China School of Engineering and Materials Science Faculty of Science and Engineering Queen Mary University of London LondonE1 4NS United Kingdom Zienkiewicz Centre for Modelling Data and AI Faculty of Science and Engineering Swansea University SwanseaSA1 8EN United Kingdom Department of Computer Science and Engineering Hong Kong university of science and technology Hong Kong Department of Earth Science & Engineering Imperial College London LondonSW7 2AZ United Kingdom Tianjin Key Laboratory of Imaging and Sensing Microelectronics Technology School of Microelectronics Tianjin University Tianjin300072 China Centre for Health Informatics Cumming School of Medicine University of Calgary CalgaryABT2N 1N4 Canada Department of Community Health Sciences Cumming School of Medicine University of Calgary CalgaryABT2N 1N4 Canada Undaunted Grantham Institute for Climate Change and the Environment Imperial College London LondonSW7 2AZ United Kingdom Culham Campus AbingdonOX14 3DB United Kingdom Centre for Computational Science Department of Chemistry University College London LondonWC1E 6BT United Kingdom Concordia Institute for Information Systems Engineering Concordia University MontrealQCH3G 1M8 Canada School of Mechanical Medical and Process Engineering Faculty of Engineering Queensland University of Technology BrisbaneQLD Australia Department of Chemical Engineering University College London LondonWC1E 6BT United Kingdom

Unstructured grid data are essential for modelling complex geometries and dynamics in computational physics. Yet, their inherent irregularity presents significant challenges for conventional machine learning (ML) techniques. This paper provides a comprehensive review of advanced ML methodologies designed to handle unstructured grid data in high-dimensional dynamical systems. key approaches discussed include graph neural networks, transformer models with spatial attention mechanisms, interpolation-integrated ML methods, and meshless techniques such as physics-informed neural networks. These methodologies have proven effective across diverse fields, including fluid dynamics and environmental simulations. This review is intended as a guidebook for computational scientists seeking to apply ML approaches to unstructured grid data in their domains, as well as for ML researchers looking to address challenges in computational physics. It places special focus on how ML methods can overcome the inherent limitations of traditional numerical techniques and, conversely, how insights from computational physics can inform ML development. To support benchmarking, this review also provides a summary of open-access datasets of unstructured grid data in computational physics. Finally, emerging directions such as generative models with unstructured data, reinforcement learning for mesh generation, and hybrid physics-data-driven paradigms are discussed to inspire future advancements in this evolving field. © 2025, CC BY-NC-SA.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

EmT: A Novel Transformer for Generalized Cross-subject EEG Emotion Recognition

arXiv

引用

arXiv 2024年

作者： Ding, Yi Tong, Chengxuan Zhang, Shuailei Jiang, Muyun Li, Yong Liang, Kevin Lim Jun Guan, Cuntai College of Computing and Data Science Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Wilmar International Singapore School of Computer Science and Engineering Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Nanjing210096 China

Integrating prior knowledge of neurophysiology into neural network architecture enhances the performance of emotion decoding. While numerous techniques emphasize learning spatial and short-term temporal patterns, there has been limited emphasis on capturing the vital long-term contextual information associated with emotional cognitive processes. In order to address this discrepancy, we introduce a novel transformer model called emotion transformer (EmT). EmT is designed to excel in both generalized cross-subject EEG emotion classification and regression tasks. In EmT, EEG signals are transformed into a temporal graph format, creating a sequence of EEG feature graphs using a temporal graph construction module (TGC). A novel residual multi-view pyramid GCN module (RMPG) is then proposed to learn dynamic graph representations for each EEG feature graph within the series, and the learned representations of each graph are fused into one token. Furthermore, we design a temporal contextual transformer module (TCT) with two types of token mixers to learn the temporal contextual information. Finally, the task-specific output module (TSO) generates the desired outputs. Experiments on four publicly available datasets show that EmT achieves higher results than the baseline methods for both EEG emotion classification and regression tasks. The code is available at https://***/yi-ding-cs/EmT. Copyright © 2024, The Authors. All rights reserved.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Path ω-automaton

引用

Journal of Information Hiding and Multimedia Signal Processing 2017年第3期8卷 640-648页

作者： Jiang, Hua Zou, Fumin Lin, Rongde Li, Lingxiang Key Lab of Granular Computing Minnan Normal University ZhangzhouFujian China Beidou Navigation and Smart Traffic Innovation Center of Fujian Province FuzhouFujian China School of Mathematical Science Huaqiao university QuanzhouFujian China Fujian Provincial Key Laboratory of Big Data Mining and Applications FuzhouFujian China School of Electronics and Information Engineering Hunan University of Science and Engineering YongzhouHunan China

Automata theory is an important branch of theoretical computer science. ω-automaton is an important part of automata theory. The judgment standard for the equivalence of two automata is the equivalence of their acceptance language. Acceptance conditions for automata are expressed with state set. This paper tries to use path to express acceptance conditions for ω-automaton that is convenient for judging the automatons equivalence property and transforming between different types of automata. With the help of Path ω-automaton, Muller automaton is transformed into Büchi automaton. Compared with the existing algorithm, the state scale of Büchi automaton has been reduced and the problem of state space explosion has been relieved. The research findings in this paper contribute to enrich the existing ω-automaton theory and provide a new idea for ω-automaton theory and application research. © 2017.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

A fine-grained perspective on the robustness of global cargo ship transportation networks

引用

Journal of Geographical Sciences 2018年第7期28卷 881-899页

作者：彭澎程诗奋陈金海廖梦迪吴琳刘希亮陆锋 State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources Research CAS University of Chinese Academy of Sciences Navigation Aids Technology Research Center of Jimei University National & Local Joint Engineering Research Center for Marine Navigation Aids Services College of Geomatics Shandong University of Science and Technology Institute of Computing Technology CAS Fujian Collaborative Innovation Center for Big Data Applications in Governments Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application

The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current research mainly focuses on the coarse-grained, holistic cargo ship transportation network while ignoring the structural diversity of different sub-networks. In this paper, we evaluate the robustness of the global cargo ship transportation network based on the most recent Automatic Identification System（AIS） data available. First, we subdivide three typical cargo ship transportation networks（i.e., oil tanker, container ship and bulk carrier） from the original cargo ship transportation network. Then, we design statistical indices based on complex network theory and employ four attack strategies, including random attack and three intentional attacks（i.e., degree-based attack, betweenness-based attack and flux-based attack） to evaluate the robustness of the three typical cargo ship transportation networks. Finally, we compare the integrity of the remaining ports of the network when a small proportion of ports lose their function. The results show that 1） compared with the holistic cargo ship transportation network, the fine-grain-based cargo ship transportation networks can fully reflect the pattern and process of global cargo transportation; 2） different cargo ship networks behave heterogeneously in terms of their robustness, with the container network being the weakest and the bulk carrier network being the strongest; and 3） small-scale intentional attacks may have significant influence on the integrity of the container network but a minor impact on the bulk carrier and oil tanker transportation networks. These conclusions can help improve the decision support capabilities in maritime transportation planning and emergency response and facilitate the establishment of a more reliable maritime transportation ***： The robustness of cargo ship transportation networks is essential to the stability of the world trade system. The current resear

关键词： complex network fine-grained cargo ship transportation network robustness automatic identification system

来源：评论

学校读者我要写书评

暂无评论

An efficient aggregate signature scheme for healthcare wireless sensor networks

Journal of Network Intelligence

引用

Journal of Network Intelligence 2021年第1期6卷 1-15页

作者： Chen, Jian-Neng Zhou, Yu-Ping Huang, Zhen-Jie Wu, Tsu-Yang Zou, Fu-Min Tso, Raylin Minnan Normal University Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Zhangzhou363000 China Lab of Granular Computing Zhangzhou363000 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Key Laboratory of Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology National Demonstration Center for Experimental Electronic Information and Electrical Technology Education Fujian University of Technology Fuzhou350008 China Department of Computer Science National Chengchi University Taipei Taiwan

In healthcare wireless sensor networks, there are a large number of sensors, which need to transmit a lot of information in real time. The aggregate signature scheme combines a great deal of signatures signed by different signers on different messages into one short signature, which greatly improves the efficiency of data transmission. In this paper, we present a scheme of certificate based aggregate signature, and prove its security in the random oracle model. The performance analysis shows that the scheme is efficient in sign and verify phase, and suitable for healthcare wireless sensor networks. © 2021, Taiwan Ubiquitous Information. All rights reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Ascl: Accelerating Semi-Supervised Learning Via Contrastive Learning

SSRN

引用

SSRN 2024年

作者： Liu, Haixiong Li, Zuoyong Wu, Jiawei Zeng, Kun Hu, Rong Zeng, Wei Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Minjiang University Fuzhou350121 China School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University Guangdong Shenzhen518107 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Physics and Mechanical and Electrical Engineering Longyan University Longyan364012 China

SSL(Semi-supervised learning) is widely used in machine learning, which leverages labeled and unlabeled data to improve model performance. SSL aims to optimize class mutual information, but noisy pseudo-labels introduce false class information due to the scarcity of labels. Therefore, these algorithms often need significant training time to refine pseudo-labels for performance improvement iteratively. To tackle this challenge, we propose a novel plug-and-play method named ASCL(Accelerating Semi-Supervised Learning via Contrastive Learning). This method combines contrastive learning with uncertainty-based selection for performance improvement and accelerates the convergence of SSL algorithms. Contrastive learning initially emphasizes the mutual information between samples as a means to decrease dependence on pseudo-labels. Subsequently, it gradually turns to maximizing the mutual information between classes, aligning with the objective of semi-supervised learning. Uncertainty-based selection provides a robust mechanism for acquiring pseudo-labels. The combination of the contrastive learning module and the uncertainty-based selection module forms a virtuous cycle to improve the performance of the proposed model. Extensive experiments demonstrate that ASCL outperforms state-of-the-art methods in terms of both convergence efficiency and performance. In the experimental scenario where only one label is assigned per class in the CIFAR-10 dataset, the application of ASCL to Pseudo-label, UDA (Unsupervised data Augmentation for Consistency Training), and Fixmatch benefits substantial improvements in classification accuracy. Specifically, the results demonstrate notable improvements in respect of 16.32%, 6.9%, and 24.43% when compared to the original outcomes. Moreover, the required training time is reduced by almost 50%. © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：