检索结果-南通市图书馆

GPIO-Based Continuous Sliding Mode Control for Networked Control Systems Under Communication Delays With Experiments on Servo Motors

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2025年第1期 99-113页

作者： Kamal Rsetam Zhenwei Cao Zhihong Man Xian-Ming Zhang the School of software and Electrical Engineering Swinburne University of Technology the Department of Automated Manufacturing Al Khwarizmi College of Engineering University of Baghdad IEEE

To handle input and output time delays that commonly exist in many networked control systems(NCSs), a new robust continuous sliding mode control(CSMC) scheme is proposed for the output tracking in uncertain single input-single-output(SISO) networked control systems. This scheme consists of three consecutive steps. First, although the network-induced delay in those systems can be effectively handled by using Pade approximation(PA), the unmatched disturbance cames out as another difficulty in the control design. Second, to actively estimate this unmatched disturbance, a generalized proportional integral observer(GPIO) technique is utilized based on only one measured state. Third, by constructing a new sliding manifold with the aid of the estimated unmatched disturbance and states, a GPIO-based CSMC is synthesized, which is employed to cope with not only matched and unmatched disturbances, but also networkinduced delays. The stability of the entire closed-loop system under the proposed GPIO-based CSMC is detailedly *** promising tracking efficiency and feasibility of the proposed control methodology are verified through simulations and experiments on Quanser's servo module for motion control under various test conditions.

关键词：

Multi-Agent Deep Reinforcement Learning for Efficient Computation Offloading in Mobile Edge Computing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第9期76卷 3585-3603页

作者： Tianzhe Jiao Xiaoyue Feng Chaopeng Guo Dongqi Wang Jie Song Department of software Engineering Software CollegeNortheastern UniversityShenyang110819China

Mobile-edge computing(MEC)is a promising technology for the fifth-generation(5G)and sixth-generation(6G)architectures,which provides resourceful computing capabilities for Internet of Things(IoT)devices,such as virtual reality,mobile devices,and smart *** general,these IoT applications always bring higher energy consumption than traditional applications,which are usually *** provide persistent energy,many references have studied the offloading problem to save energy ***,the dynamic environment dramatically increases the optimization difficulty of the offloading *** this paper,we aim to minimize the energy consumption of the entireMECsystemunder the latency constraint by fully considering the dynamic *** games,we propose amulti-agent deep reinforcement learning approach based on the bi-level actorcritic learning structure to jointly optimize the offloading decision and resource allocation,which can solve the combinatorial optimization problem using an asymmetric method and compute the Stackelberg equilibrium as a better convergence point than Nash equilibrium in terms of Pareto *** method can better adapt to a dynamic environment during the data transmission than the single-agent strategy and can effectively tackle the coordination problem in the multi-agent *** simulation results show that the proposed method could decrease the total computational overhead by 17.8%compared to the actor-critic-based method and reduce the total computational overhead by 31.3%,36.5%,and 44.7%compared with randomoffloading,all local execution,and all offloading execution,respectively.

关键词： Computation offloading multi-agent deep reinforcement learning mobile-edge computing latency energy efficiency

A Linear-Time Solution for All-SAT Problem Based on P System

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2018年第2期27卷 367-373页

作者： GUO Ping ZHU Jian CHEN Haizhu YANG Ruilong college of Computer Science Chongqing University Chongqing Key Laboratory of software Theory and Technology Department of software Engineering Chongqing College of Electronic Engineering

P system is a new kind of distributed parallel computing model, and its many variants are used to solve NP problems. All-SAT problem is a well-known NPhard problem and it has been widely applied in the fields of pro ject selection problem, capital budgeting problem and so on. In this paper, we present a family of P systems to solve All-SAT problem in a linear time based on membrane division and give an instance to illustrate the feasibility and effectiveness of our designed P systems.

关键词： Membrane computing Cell-like P systems Boolean Satisfiability problem(SAT problem) Find All solutions of SAT(All-SAT) problem

Web Service Composition Based on QoS Rules

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2010年第6期25卷 1143-1156页

作者：张明卫张斌刘莹那俊朱志良 college of software Northeastern University college of Information Science and Engineering Northeastern University

For workflow-based service composition approach,the relations between the Web service QoS and environments are usually not considered,so that the information about QoS for composite service selection is *** makes the selected composite service inefficient,or even *** address this problem,a novel service composition approach based on production QoS rules is proposed in this ***,it is very difficult to directly analyze how different kinds of environment factors influence the Web service *** adopt ＂black-box＂ analysis method of optimizing composite services,discovering the knowledge such as ＂the QoS of one Web service will be higher in specific environments＂.In our approach,the execution information of the composite service is recorded into a log first,which will be taken as the basis of the subsequent statistical analysis and data ***,the timely QoS values of the Web services are estimated and the production QoS rules being used to qualitatively express the different performances of the Web service QoS in different environments are *** last,we employ the mined QoS knowledge of the Web services to optimize the composite service *** experimental results show that our approach can improve the performance of selected composite services on the premise of assuring the selecting computation cost.

关键词： service composition service selection QoS data mining production rules

维普期刊数据库

QoS-Driven Self-Healing Web Service Composition Based on Performance Prediction

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2009年第2期24卷 250-261页

作者：代钰杨雷张斌 college of software Northeastern University college of Information Science and Engineering Northeastern University

Web services run in a highly dynamic environment, as a result, the QoS of which will change relatively frequently. In order to make the composite service adapt to such dynamic property of Web services, we propose a self-healing approach for web service composition. Such an approach is an integration of backing up in selection and reselecting in execution. In order to make the composite service heal itself as quickly as possible and minimize the number of reselections, a way of performance prediction is proposed in this paper. On this basis, the self-healing approach is presented including framework, the triggering algorithm of the reselection and the reliability model of the service. Experiments show that the proposed solutions have better performance in supporting the self-healing Web service composition.

关键词： service composition QoS self-healing performance prediction reselection

维普期刊数据库

Solving All-SAT Problems by P Systems

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第4期24卷 744-749页

作者： GUO Ping JI Jinfang CHEN Haizhu LIU Ran college of Computer Science Chongqing University Chongqing Key Laboratory of software Theory & Technology Department of software Engineering Chongqing College of Electronic Engineering

The satisfiability problem(SAT) is a well known NP-complete problem. Obtaining All of the truth assignments of SAT is called All-SAT and it has numerous applications in artificial intelligence and computer theories. Many algorithms about SAT have been built, but how to solve All-SAT is still difficult. P system is a new distributed and parallel computation model. We use membrane division, which is frequently investigated to obtain an exponential working space in a linear time, to design a family of P systems to solve All-SAT in polynomial *** work provides a new and effective solution to All-SAT in a distributed and parallel manner.

关键词： All solutions for Satisfiability problem(All-SAT) Satisfiability problem(SAT problem) Conjunctive normal form(CNF) P system Memb

A Family of P Systems for Solving Linear Equations

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第4期26卷 667-674页

作者： GUO Ping WEI Lijiao CHEN Haizhu LIU Ran college of Computer Science Chongqing University Chongqing Key Laboratory of software Theory and Technology Department of software Engineering Chongqing College of Electronic Engineering

Solving linear equations is one of the fundamental problems in numerical calculation and has a wide application in many science and engineering fields. We present a family of P systems to solve linear equations in which the coefficients are real numbers. An instance is given to illustrate the feasibility and effectiveness of our designed P systems. Our work contributes to make P systems to solve more complicated computation problems effectively.

关键词： Membrane computing Cell-like P systems Fraction arithmetic operation Numerical calculation P systems

Evaluation of Remote-I/O Support for a DSM-Based Computation Offloading Scheme

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2017年第5期32卷 957-973页

作者： Yuhun Jun Jaemin Lee Euiseong Seo college of software Sungkyunkwan University Suwon 16419 Korea

Computation offloading enables mobile devices to execute rich applications by using the abundant computing resources of powerful server systems. The distributed shared memory based (DSM-based) computation offloading approach is expected to be especially popular in the near future because it can dynamically migrate running threads to computing nodes and does not require any modifications of existing applications to do so. The current DSM-based computation offloading scheme, however, has focused on efficiently offloading computationally intensive applications and has not considered the significant performance degradation caused by processing the I/O requests issued by offloaded threads. Because most mobile applications are interactive and thus yield frequent I/O requests, efficient handling of I/O operations is critically important. In this paper, we quantitatively analyze the performance degradation caused by I/O processing in DSM-based computation offloading schemes using representative commodity applications. To remedy the performance degradation, we apply a remote I/O scheme based on remote device support to computation offloading. The proposed approach improves the execution time by up to 43.6% and saves up to 17.7% of energy consumption in comparison with the existing offloading schemes. Selective compression of the remote I/O scheme reduces the network traffic by up to 53.5%.

关键词： computation offloading mobile-cloud computing distributed shared memory (DSM) mobile computing

Towards efficient allocation of graph convolutional networks on hybrid computation-in-memory architecture

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第6期64卷 112-125页

作者： Jiaxian CHEN Guanquan LIN Jiexin CHEN Yi WANG college of Computer Science and software Engineering Shenzhen University

Graph convolutional networks(GCNs) have been applied successfully in social networks and recommendation systems to analyze graph data. Unlike conventional neural networks, GCNs introduce an aggregation phase, which is both computation-and memory-intensive. This phase aggregates features from the neighboring vertices in the graph, which incurs significant amounts of irregular data and memory *** emerging computation-in-memory(CIM) architecture presents a promising solution to alleviate the problem of irregular accesses and provide fast near-data processing for GCN applications by integrating both three-dimensional stacked CIM and general-purpose processing units in the system. This paper presents Graph-CIM, which exploits the hybrid CIM architecture to determine the allocation of GCN ***-CIM models the GCN application process as a directed acyclic graph(DAG) and allocates tasks on the hybrid CIM architecture. It achieves fine-grained graph partitioning to capture the irregular characteristics of the aggregation phase of GCN applications. We use a set of representative GCN models and standard graph datasets to evaluate the effectiveness of Graph-CIM. The experimental results show that Graph-CIM can significantly reduce the processing latency and data-movement overhead compared with the representative schemes.

关键词： computation-in-memory graph convolutional networks hybrid architecture scheduling inference accelerator