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

A high-level Petri net for accurate modeling of reactive and concurrent systems

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1996年第11期E79A卷 1797-1808页

作者： Uchihira, N Honiden, S Systems and Software Engineering Laboratory Toshiba Corporation Kawasaki-shi 210 Japan

This paper concerns a Petri-net-based model for describing reactive and concurrent systems. Although many high-level Petri nets have been proposed, they are insufficiently practical to describe reactive and concurrent systems in the detail modeling, design and implementation phases. They are mainly intended to describe concurrent systems in the rough modeling phase and lack in several important features (e.g., concurrent tasks, task communication/synchronization, I/O interface, task scheduling) which the most actual implementations of reactive and concurrent systems have. Therefore it is impossible to simulate and analyze the systems accurately without explicitly modeling these features. On the other hand, programming languages based on Petri nets are deeply dependent on their execution environments and not sophisticated as modeling and specification languages. This paper proposes MENDEL net which is a high-level Petri net extended by incorporating concurrent tasks, task communication/synchronization, I/O interface, and task scheduling in a sophisticated manner. MENDEL nets are a wide-spectrum modeling language, that is, they are suitable for not only modeling but also designing and implementing reactive and concurrent systems.

关键词： high-level Petri net reactive and concurrent system programming language task scheduling real-time operating system

来源：评论

学校读者我要写书评

暂无评论

PQL - MODAL LOGIC FOR COMPOSITIONAL VERIFICATION OF CONCURRENT PROGRAMS

引用

systems AND COMPUTERS IN JAPAN 1994年第1期25卷 1-16页

作者： UCHIHIRA, N Member Systems & Software Engineering Laboratory Toshiba Corporation Kawasaki Japan 210

The temporal logic model checking method is very useful for verification of concurrent programs that can be expressed by finite state transition systems. However, a major drawback to using this method is that as the scale of the programs increases, the computation costs for verification increase exponentially. An effective solution for this problem is compositional verification. Compositional verification is a method in which the bisimulation equivalence of concurrent programs is used to extract from each construction element (subprocess) only that abstract information necessary to verify each query, thereby avoiding an explosion in cost. In this paper, PQL (Process Query Language) is proposed as an improved method in the solution of this problem. PQL is based on modal logic which is the union of temporal and process logic. Also in this paper, the compositional verification method is proposed by using PQL with consideration of the ''divergence by internal transition''.

关键词： COMPOSITIONAL VERIFICATION CONCURRENT PROGRAM MODAL LOGIC TRANSITION SYSTEM BISIMULATION EQUIVALENCE MODEL CHECKING TEMPORAL LOGIC

来源：评论

学校读者我要写书评

暂无评论

Correction to: A comprehensive performance evaluation of container migration strategies

引用

Computing 2025年第4期107卷 1-2页

作者： Feitosa, Leonel Barbosa, Vandirleya Sabino, Arthur Lima, Luiz Nelson Fé, Iure Silva, Luis Guilherme Callou, Gustavo Carvalho, Juliana Leão, Erico Nguyen, Tuan Anh Rego, Paulo Silva, Francisco Airton Laboratory of Applied Research to Distributed Systems (PASID) Federal University of Piauí (UFPI) Picos Brazil Department of Computing Federal Rural University of Pernambuco (UFRPE) Recife Brazil Department of Software Engineering Faculty of Information Technology University of Industry and Trade (HUIT) Ho Chi Minh City Vietnam Department of Computer Science Federal University of Ceará (UFC) Fortaleza Brazil

来源：评论

学校读者我要写书评

暂无评论

Development of a Hypersonic Entry Test Platform

Development of a Hypersonic Entry Test Platform

引用

AIAA Science and Technology Forum and Exposition, AIAA SciTech Forum 2025

作者： Johnson, Breanna J. Johnson, Kate E. Jang, Peter Steffes, Stephen R. Fritz, Matthew P. Hawke, Veronica Garcia, Joseph A. Morr, Donald E. NASA Johnson Space Center Flight Mechanics and Trajectory Design Branch HoustonTX77058 United States NASA Johnson Space Center Applied Aeroscience and CFD Branch HoustonTX77058 United States Aerodyne Industries Applied Aeroscience and CFD Branch HoustonTX77058 United States Charles Stark Draper Laboratory Navigation Algorithms and Software Space GNC Group HoustonTX77058 United States Science Technology Corporation Systems Analysis Office Mountain ViewCA United States NASA Ames Research Center NASA Systems Analysis Office Mountain ViewCA94035 United States Millennium Engineering and Integration Company ArlingtonVA22202 United States

ISBN: (数字)9781624107238

ISBN: (纸本)9781624107238

NASA is designing and building a low-cost, scalable, rapidly developed test platform to lower the barrier to entry for entry, descent, and landing (EDL) technologies. This HyperSonic Testing for Entry Platform, HyperSTEP, will enable the low-cost flight demonstration of hypersonic entry technologies, leveraging a publishable government reference design to further enable future government and industry landers. The HyperSTEP vehicle leverages a lifting body shape that was originally designed for a NASA human-class Mars mission concept vehicle, the CobraMRV. Lifting body vehicles offer increased volume efficiency and greater range control capabilities over capsules, making them an attractive class of vehicles to further develop for small to large payload return missions from the Moon, Mars, and beyond. Progress has been made in the development of the HyperSTEP vehicle in the areas of aerodynamics, aerothermodynamics, structural design and packaging, propulsion, guidance navigation and control (GN&C), decelerators (i.e., parachutes), and the thermal protection system (TPS). This paper details progress made in refining the mission concept of operations (ConOps) for the first notional missions and the development of the aerodynamic and aerothermodynamic databases, GN&C, and parachute system, as the project moves into its build and test phase. © 2025, American Institute of Aeronautics and Astronautics Inc, AIAA. All rights reserved.

关键词： NASA

来源：评论

学校读者我要写书评

暂无评论

Dynamic Pricing based Near-Optimal Resource Allocation for Elastic Edge Offloading

引用

IEEE Transactions on Mobile Computing 2025年

作者： Xia, Yun Xue, Hai Zhang, Di Mumtaz, Shahid Xu, Xiaolong Rodrigues, Joel J. P. C. University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Zhengzhou University School of Electrical and Information Engineering Henan International Joint Laboratory of Intelligent Health Information System National Telemedicine Center National Engineering Laboratory for Internet Medical Systems and Applications Zhengzhou450001 China Nottingham Trent University Department of Engineering NottinghamNG1 4FQ United Kingdom Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of Nanjing University of Information Science and Technology School of Software Nanjing210044 China Amazonas State University Manaus Brazil

In mobile edge computing (MEC), task offloading can significantly reduce task execution latency and energy consumption of end user (EU). However, edge server (ES) resources are limited, necessitating efficient allocation to ensure the sustainable and healthy development for MEC system. In this paper, we propose a dynamic pricing mechanism based near-optimal resource allocation for elastic edge offloading. First, we construct a resource pricing model and accordingly develop the utility functions for both EU and ES, the optimal pricing model parameters are derived by optimizing the utility functions. In the meantime, our theoretical analysis reveals that the EU's utility function reaches a local maximum within the search range, but exhibits barely growth with increased resource allocation beyond this point. To this end, we further propose the Dynamic Inertia and Speed-Constrained particle swarm optimization (DISC-PSO) algorithm, which efficiently identifies the near-optimal resource allocation. Comprehensive simulation results validate the effectiveness of DISC-PSO algorithm, demonstrating that it significantly outperforms existing schemes by reducing the average number of iterations to reach a near-optimal solution by 86.88%, increasing the EU utility function value by 0.13%, and decreasing the variance of results by 96.78%. © 2025 IEEE. All rights reserved.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy systems 2025年

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points. Our code is available at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

ForkXplorer:an approach of fork summary generation

引用

Frontiers of Computer Science 2022年第2期16卷 1-15页

作者： Zhang ZHANG Xinjun MAO Chao ZHANG Yao LU Key Laboratory of Software Engineering for Complex Systems College of ComputerNational University of Defense TechnologyChangsha 410073China

Pull-based development has become an important paradigm for distributed software *** this model,each developer independently works on a copied repository(i.e.,a fork)from the central *** is essential for developers to maintain awareness of the state of other forks to improve collaboration *** this paper,we propose a method to automatically generate a summary of a *** first use the random forest method to generate the label of a fork,i.e.,feature implementation or a bug *** on the information of the fork-related commits,we then use the TextRank algorithm to generate detailed activity information of the ***,we apply a set of rules to integrate all related information to construct a complete fork *** validate the effectiveness of our method,we conduct 30 groups of manual experiment and 77 groups of case studies on *** propose Fea_(avg)to evaluate the performance of Fea_(avg)the generated fork summary,considering the content accuracy,content integrity,sentence fluency,and label extraction *** results show that the average of of the fork summary generated by this method is *** than 63%of project maintainers and the contributors believe that the fork summary can improve development efficiency.

关键词： open source software pull-based development fork summary distributed cooperative development

来源：评论

学校读者我要写书评

暂无评论

MLFuse: Multi-Scenario Feature Joint Learning for Multi-Modality Image Fusion

引用

IEEE Transactions on Multimedia 2025年

作者： Lei, Jia Li, Jiawei Liu, Jinyuan Wang, Bin Zhou, Shihua Zhang, Qiang Wei, Xiaopeng Kasabov, Nikola K. Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Dalian University of Technology School of Mechanical Engineering Dalian116024 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China Auckland University of Technology Knowledge Engineering and Discovery Research Institute Auckland1010 New Zealand Ulster University Intelligent Systems Research Center LondonderryBT52 1SA United Kingdom

Multi-modality image fusion (MMIF) entails synthesizing images with detailed textures and prominent objects. Existing methods tend to use general feature extraction to handle different fusion tasks. However, these methods have difficulty breaking fusion barriers across various modalities owing to the lack of targeted learning routes. In this work, we propose a multi-scenario feature joint learning architecture, MLFuse, that employs the commonalities of multi-modality images to deconstruct the fusion progress. Specifically, we construct a cross-modal knowledge reinforcing network that adopts a multipath calibration strategy to promote information communication between different images. In addition, two professional networks are developed to maintain the salient and textural information of fusion results. The spatial-spectral domain optimizing network can learn the vital relationship of the source image context with the help of spatial attention and spectral attention. The edge-guided learning network utilizes the convolution operations of various receptive fields to capture image texture information. The desired fusion results are obtained by aggregating the outputs from the three networks. Extensive experiments demonstrate the superiority of MLFuse for infrared-visible image fusion and medical image fusion. The excellent results of downstream tasks (i.e., object detection and semantic segmentation) further verify the high-quality fusion performance of our method. The code is publicly available at https://***/jialei-sc/MLFuse. © 1999-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Landing scheduling for carrier aircraft fleet considering bolting probability and aerial refueling

引用

Defence Technology 2025年

作者： Zhang, Genlai Wang, Lei Deng, Zhilong Liu, Xuanbo Su, Xichao Li, Haixu Lu, Chen Liu, Kai Wang, Xinwei School of Mathematical Science Dalian University of Technology Dalian116024 China Department of Engineering Mechanics State Key Laboratory of Structural Analysis Optimization and CAE Software for Industrial Equipment Dalian University of Technology Dalian116024 China Naval Aviation University Yantai264001 China China State Shipbuilding Corporation Systems Engineering Research Institute Beijing100094 China Department of Automation School of Information Science and Technology Tsinghua University Beijing100084 China School of Reliability and Systems Engineering Beihang University Beijing100191 China Institute of Reliability Engineering Beihang University Beijing100191 China Hangzhou International Innovation Institute Beihang University Hangzhou311100 China School of Aeronautics and Astronautics Dalian University of Technology Dalian116024 China

Recovery is a crucial supporting process for carrier aircraft, where a reasonable landing scheduling is expected to guide the fleet landing safely and quickly. Currently, there is little research on this topic, and most of it neglects potential influence factors, leaving the corresponding supporting efficiency questionable. In this paper, we study the landing scheduling problem for carrier aircraft considering the effects of bolting and aerial refueling. Based on the analysis of recovery mode involving the above factors, two types of primary constraints (i.e., fuel constraint and wake interval constraint) are first described. Then, taking the landing sequencing as decision variables, a combinatorial optimization model with a compound objective function is formulated. Aiming at an efficient solution, an improved firefly algorithm is designed by integrating multiple evolutionary operators. In addition, a dynamic replanning mechanism is introduced to deal with special situations (i.e., the occurrence of bolting and fuel shortage), where the high efficiency of the designed algorithm facilitates the online scheduling adjustment within seconds. Finally, numerical simulations with sufficient and insufficient fuel cases are both carried out, highlighting the necessity to consider bolting and aerial refueling during the planning procedure. Simulation results reveal that a higher bolting probability, as well as extra aerial refueling operations caused by fuel shortage, will lead to longer recovery complete time. Meanwhile, due to the strong optimum-seeking capability and solution efficiency of the improved algorithm, adaptive scheduling can be generated within milliseconds to deal with special situations, significantly improving the safety and efficiency of the recovery process. An animation is accessible at ***/video/BV1QprKY2EwD. © 2025 China Ordnance Society

关键词： Air refueling

来源：评论

学校读者我要写书评

暂无评论

Robust Deadlock Avoidance Policy for Automated Manufacturing System With Multiple Unreliable Resources

引用

IEEE/CAA Journal of Automatica Sinica 2020年第3期7卷 812-821页

作者： Jianchao Luo Zhiqiang Liu Shuogang Wang Keyi Xing School of Software Northwestern Polytechnical UniversityXi’an 710072China State Key Laboratory for Manufacturing Systems Engineering and Systems Engineering InstituteXi’an Jiaotong UniversityXi’an 710049China

This work studies the robust deadlock control of automated manufacturing systems with multiple unreliable resources. Our goal is to ensure the continuous production of the jobs that only require reliable resources. To reach this goal, we propose a new modified Banker's algorithm(MBA) to ensure that all resources required by these jobs can be freed. Moreover,a Petri net based deadlock avoidance policy(DAP) is introduced to ensure that all jobs remaining in the system after executing the new MBA can complete their processing smoothly when their required unreliable resources are operational. The new MBA together with the DAP forms a new DAP that is robust to the failures of unreliable resources. Owing to the high permissiveness of the new MBA and the optimality of the DAP, it is tested to be more permissive than state-of-the-art control policies.

关键词： Automated manufacturing system(AMS) deadlock avoidamce policy(DAP) modified Banker's algorithm(MBA) Petrinet

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：