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

International Conference on systems and Informatics (ICSAI)

作者： Xiwei Liu Ping Li Yuan Xu Ying Liu Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Shanghai China

ISBN: (纸本)9781479954599

Quasi-synchronization is an important type of synchronization because of the parameter mismatches in the real world, so we will investigate it for a delayed network, which is master-slave coupled. By applying the aperiodically and nonlinearly intermittent control on the network, and assuming the time delay is varying, we will present some useful criteria for exponential quasi-synchronization. The main difference of this paper with previous works is that the intermittent mode is aperiodic while that in previous works is periodic. Finally, simulations are also given to show its validity.

关键词： Synchronization Mathematical model Delay effects Numerical models Observers Equations Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A Cloudedge-Combined Data Placement Strategy Based on User Access Regions 6

A Cloudedge-Combined Data Placement Strategy Based on User A...

引用

6th International Conference on Big Data and Information Analytics, BigDIA 2020

作者： Cao, Eryang Wang, Pengwei Yan, Chungang Jiang, Changjun Department of Computer Science and Technology Tongji University Shanghai200092 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China School of Computer Science and Technology Donghua University Shanghai201620 China

To improve the availability of data in the cloud and avoid vendor lock-in risk, multi-cloud storage is attracting more and more attentions. However, accessing data from the cloud usually has some disadvantages such as higher latency and more bandwidth-consuming. Edge computing, which has become popular in recent years, could effectively solve the above problems while it usually reduces availability. Storage only in the cloud or edge environment is limited by many factors. To this end, we build mathematical model which is abstracted from real access mode of users in consideration of multi-cloud and edge. This paper presents a method combined NSGAII with multi-group method which has better ability of global search to help users determine cloud and edge services to store and access data object. A large number of experiments using real service provider information demonstrate that the proposed algorithm outperforms existing methods and effectiveness of it. © 2020 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A polynomial algorithm to performance analysis of concurrent systems via petri nets and ordinary differential equations

A polynomial algorithm to performance analysis of concurrent...

引用

作者： Ding, Zuohua Zhou, Yuan Zhou, Meng Chu Laboratory of Intelligent Computing and Software Engineering Zhejiang Sci-Tech University Hangzhou310018 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States

In this paper, a new method is proposed to evaluate the performance of concurrent systems. A concurrent system consisting of multiple processes that communicate via message passing mechanisms is modeled by a Petri net, which is in turn represented by a set of ordinary differential equations (ODEs) of a restricted type. The equations describe the system state changes, and the solutions, also called state measures, can be used for the performance analysis such as estimating response time, throughput and efficiency. This method can avoid a state explosion problem encountered by the conventional methods based on Continuous-Time Markov Chains. Its application to an IBM business system is given as an example. © 2004-2012 IEEE.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

Facial StO2-based Stress Recognition using Automatic Graph Generation and Dual-Stream GNN

Facial StO2-based Stress Recognition using Automatic Graph G...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Jia, Yingjuan Wang, Hanpu Liu, Xinyu Chen, Tong Southwest University College of Electronic and Information Engineering 400715 China Southwest University Chongqing Key Laboratory of Generic Technology and System of Service Robots China Southwest University Institute of Legal Psychology and Intelligent Computing 400715 China

ISBN: (纸本)9798350386226

The recognition of stress responses in health, resilience, and psychopathology holds significant scientific importance. The biological information carried by the facial tissue oxygen saturation (StO2) is a useful indicator for stress recognition. Although graph-based methods have achieved state-of-the-art (SOTA), there is room for improvement. This study proposes an automatic graph generation method for facial StO2, replacing manual methods and enhancing the information of graphs. To further enhance the capability of graphs' representation, a dimensionality reduction strategy for nodes is proposed. The strategy is implemented based on an novel objective function that can increase the inter-class distance and reduce the intra-class distance. After obtaining highly representative graphs, a dual-stream network integrating GAT and GCN is designed to extract stress-related features from the graphs, ultimately achieving the SOTA recognition accuracy. © 2024 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

KNOB particle swarm optimizer 1

引用

1st International Conference on Advances in Swarm Intelligence, ICSI 2010

作者： Zhang, Junqi Liu, Kun Tan, Ying Key Laboratory of Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai 200092 China Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

ISBN: (数字)9783642134951

ISBN: (纸本)3642134947

It is not trivial to tune the swarm behavior just by parameter setting because of the randomness, complexity and dynamic involved in particle swarm optimizer (PSO). Hundreds of variants in the literature of last decade, brought various mechanism or ideas, sometimes also from outside of the traditional metaheuristics field, to tune the swarm behavior. While, in the same time, additional parameters have to be afforded. This paper proposes a new mechanism, named KNOB, to directly tune the swarm behavior through parameter setting of PSO. KNOB is defined as the first principal component of the statistical probability sequence of exploration and exploitation allocation along the search process. The using of the KNOB to tune PSO by parameter setting is realized through a statistical mapping, between the parameter set and the KNOB, learned by a radial basis function neural network (RBFNN) simulation model. In this way, KNOB provides an easy way to tune PSO directly by its parameter setting. A simple application of KNOB to promote is presented to verify the mechanism of KNOB. © 2010 Springer-Verlag.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Reader activation scheduling in multi-reader RFID systems: A study of general case

Reader activation scheduling in multi-reader RFID systems: A...

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

作者： Tang, Shaojie Wang, Cheng Li, Xiang-Yang Jiang, Changjun Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China

ISBN: (纸本)9780769543857

Radio frequency identification (RFID) is a technology where a reader device can "sense" the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis. © 2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Top-n recommendation algorithms for cloud data

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2015年第1期43卷 54-61页

作者： Huang, Zhen-Hua Department of Computer and Technology Tongji University Shanghai200092 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China

Top-n recommendation technology has recently received a lot of attention in information service community. In this paper, we study the problem of top-n recommendation under the cloud data. Firstly, we propose a multilayer distributed storage architecture(MDSA)which can fit the need of top-n recommendation. Secondly, based on the consideration of reducing the cost of network transmission, we present the data encoding pattern which is based on the MDSA architecture. Lastly, we fast realize top-n recommendation using the map/reduce distributed programming model. For satisfying the realistic requirement, we further present three application variants of top-n recommendation. Massive experiments demonstrate that our approach is efficient and has high overall performance. ©, 2015, Chinese Institute of Electronics. All right reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A three-stage method to find refining schedules of crude oil operations in refinery

A three-stage method to find refining schedules of crude oil...

引用

2011 IEEE International Conference on service Operations, Logistics and Informatics, SOLI 2011

作者： Wu, Naiqi Bai, Liping Zhou, Mengchu School of Mechatronics Engineering Guangdong University of Technology Guangzhou 510090 China MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China ECE NJIT Newark NJ 07 102 United States

ISBN: (纸本)9781457705731

A short-term scheduling problem for crude oil operations is highly challenging. There lack efficient techniques and software tools for its solution. Our prior research shows that it may be solved in a hierarchical way. At the upper level, we find a realizable refining schedule to optimize concerned objectives. At the lower level, a detailed schedule is obtained to realize it. This work attempts to present a three-stage method to solve the the upper level problem from a control perspective. The first stage solves a linear programming problem to determine the maximal production rate. The second one solves a transportation problem to optimally assign crude oil types and volume to the distillers. The last one adjusts and sequences oil parcels. Consequently, the proposed method is computationally efficient. An industrial case study is presented to show the result. © 2011 IEEE.

关键词： Crude oil

来源：评论

学校读者我要写书评

暂无评论

KF-TMIAF: An Efficient Key-Frames-Based Temporal Modeling of Images and AU Features structure for Masked Facial Expression Recognition

KF-TMIAF: An Efficient Key-Frames-Based Temporal Modeling of...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Gu, Huijie Wang, Hanpu He, Shiwei Li, Mengyan Zhou, Jianmeng Chen, Tong Southwest University College of Electronic and Information Engineering Chongqing400715 China Swu Chongqing Key Laboratory of Generic Technology and System of Service Robots China Southwest University Institute of Legal Psychology and Intelligent Computing Chongqing400715 China

ISBN: (纸本)9798350386226

Masked Facial Expression refers to facial expression that people deliberately make which do not correspond to their true emotions. The purpose of masked facial expression is to conceal one's genuine feelings. Precisely identifying masked facial expression aids in revealing the genuine emotions, and finds applications in diagnosis of mental illness. However, the masked facial expression sequences have redundant information, temporal modeling is difficult, and the expressive ability of AU features needs to be improved. To solve the existing problems, we first propose a Key frame Selection and Data Augmentation (KS-DA) method to obtain the key frame in the sequence. In addition, we propose a Global Feature Relation Block (GFR) to aggregate global information and combine it with Temporal Convolutional Networks (TCN) to better realize temporal modeling. Finally, we propose an Adaptive Weight Generation Module (Ada-WGM) to form different weights from adaptation, allowing for better extraction of the temporal changes in AU features. Finally, the experiments have shown that the proposed method has improved the mixed expression classification task (36 task) by 15.23% and the experienced emotions classification task (6E task) by 17.77%, respectively, and obtain sort results. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Information Security Evaluation by Information Flow Analysis Based on Stochastic Petri Nets

Information Security Evaluation by Information Flow Analysis...

引用

2024 IEEE International Conference on systems, Man, and Cybernetics, SMC 2024

作者： Tu, Hanqian Xiang, Dongming Lin, Wang Liu, Guanjun Zhejiang Sci-Tech University Department of Computer Science and Technology Hangzhou310018 China Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science Shanghai201804 China

ISBN: (纸本)9781665410205

The Petri-net-based information flow analysis offers an effective approach for detecting information leakage by the concept of non-interference. Although the related studies propose efficient solutions, they lack quantitative evaluation on information leakage. In this paper, we propose a novel method for quantitative evaluation of information security based on stochastic labeled Petri nets (SLPNs) and information flow analysis. Specifically, we introduce four different levels of security metrics, and provide a methodology for evaluating the information security. Furthermore, a case study is presented to show the feasibility of our method. © 2024 IEEE.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：