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

International Conference on systems and Informatics (ICSAI)

作者： Chenggong Sun Xiwei Liu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China

ISBN: (数字)9798331510138

ISBN: (纸本)9798331510145

In this paper, we explore and establish several necessary and sufficient conditions that are instrumental in achieving consensus within second-order discrete-time multi-agent systems (SDMAS). Different with previous research, this study addresses the more intricate scenario where the velocity coupling matrix is distinct from the position coupling matrix. We introduce a novel eigenvector condition tailored to this challenge. Furthermore, in response to the burgeoning interest in multiweighted networks, this study is extended to SDMAS with multiple weights. We employ a technique, that rearranges the order of variables, to effectively simplify the analysis of multiweighted networks by transforming them into single-weighted equivalents. The efficacy of our method is substantiated through three numerical examples, which illustrate the practical value in elucidating consensus dynamics within SDMAS featuring diverse coupling matrices.

关键词： Couplings Sufficient conditions Instruments Numerical simulation Trajectory Numerical models Multiaccess communication Informatics Pragmatics Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive Granulation for Efficient Classification on Noise Labeled Images

Adaptive Granulation for Efficient Classification on Noise L...

引用

International Conference on Computational Intelligence and Applications (ICCIA)

作者： Kecan Cai Hongyun Zhang Duoqian Miao Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China

ISBN: (数字)9798350352214

ISBN: (纸本)9798350352221

Current semi-supervised learning-based sample selection methods for noisy label image classification typically utilize all clean and noisy samples for model training. However, not all noisy samples contribute positively to model training. This paper introduces a novel semi-supervised image data granulation method that employs adaptively generated granular noisy sample subsets in place of the original noisy samples to enhance classification efficiency. The granular data generated retain the essential features of the original data, thereby improving efficiency without compromising classification accuracy. The quality of the granular data is assessed using coverage and specificity criteria, standard metrics for evaluating information granules. The proposed method consists of three main components: (i)selecting clean and noisy samples through network co-training, (ii)calculating granular noisy sample subsets by adaptive granulation, and (iii)optimizing the network model using a semi-supervised strategy. Experimental results on benchmark datasets with varying noise rates demonstrate that our method significantly improves the efficiency of noisy label image classification while maintaining accuracy.

关键词： Training Adaptation models Accuracy Computational modeling Noise Benchmark testing Noise measurement Standards Image classification Noise level

来源：评论

学校读者我要写书评

暂无评论

Synchronization and control for multi-weighted and directed complex networks

arXiv

引用

arXiv 2021年

作者： Liu, Xiwei Department of Computer Science and Technology Tongji University China The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

The study of complex networks with multi-weights has been a hot topic recently. For a network with a single weight, previous studies have shown that they can promote synchronization. But for complex networks with multi-weights, there are no rigorous analysis to show that synchronization can be reached faster. In this paper, the complex network is allowed to be directed, which will make the synchronization analysis difficult for multiple couplings. In virtue of the normalized left eigenvectors (NLEVec) corresponding to the zero eigenvalue of coupling matrices, we prove that if the Chebyshev distance between NLEVec is less than some value, which is defined as the allowable deviation bound, then the synchronization and control will be realized with sufficiently large coupling strengths, i.e., all coupling matrices do accelerate synchronization. Moreover, adaptive rules are also designed for the coupling strength. © 2021, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Construction algorithms for index model based on Web page classification

引用

Journal of Computational Information systems 2014年第2期10卷 655-664页

作者： Zhang, Yangjie Yan, Chungang Wang, Pengwei Sun, Haichun Department of Computer Science and Technology Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Web pages on the Internet are massive, diverse, heterogeneous and redundant. How to organize and manage them effectively is an urgent problem. In this paper, we propose a method to index web pages and build an index model based on web page classification and hyperlink analysis. First, an initialization algorithm is given to construct an index model for an initial set of web pages. Then, considering the dynamics of web pages on the Internet, we propose an incremental updating algorithm which can update an index model incrementally. Through theoretical analysis, the complexity of proposed algorithms shows linear relationships with the scale of web pages and their growth. The experimental results show that initialization algorithm can construct an index model for a fixed number of web pages relatively fast, while the incremental updating algorithm can satisfy the update speed of web pages on the Internet. Thus, the proposed algorithms are feasible and effective. The constructed index model can provide supports for diversified information service systems to enable them to make better use of web resources and provide more valuable services to users. Copyright © 2014 Binary Information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Robust control reconfiguration of resource allocation systems with Petri nets and integer programming

Robust control reconfiguration of resource allocation system...

引用

作者： Li, Jun Zhou, Mengchu Guo, Tao Gan, Yahui Dai, Xianzhong Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education China School of Automation Southeast University Nanjing 210096 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

Supervisory control reconfiguration can handle the uncertainties including resource failures and task changes in discrete event systems. It was not addressed to exploit the robustness of closed-loop systems to accommodate some uncertainties in the prior studies. Such exploitation can cost-efficiently achieve reconfigurability and flexibility for real systems. This paper presents a robust reconfiguration method based on Petri nets (PNs) and integer programming for supervisory control of resource allocation systems (RASs) subject to varying resource allocation relationships. An allocation relationship is seen as a control specification while the execution processes requiring resources as an uncontrolled plant. First, a robust reconfiguration mechanism is proposed. It includes updating the P-invariant-based supervisor and evolving the state of the closed-loop system. The latter adapts to the control specification changes by the self-regulation of the closed-loop system's state. Next, two novel integer programming models for control reconfiguration are proposed, called a reconfiguration model with acceptability and reconfiguration one with specification correction. Since both models integrate the firability condition of transitions, no additional efforts are required for the state reachability analysis. Finally, a hospital emergency service system is used as an example to illustrate them. © 2014 Elsevier Ltd. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Hybrid Filtrations Recommendation system based on Privacy Preserving in Edge computing

引用

Procedia Computer Science 2018年 129卷 407-409页

作者： Lina Ni Hongdi Lin Mengmeng Zhang Jinquan Zhang College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

It is challenging to design a secure recommendation system on the Internet which can help users to select their favorite products as less privacy leaked as possible. In this paper, we present a hybrid filtrations recommendation system based on privacy preserving in edge computing (HFRS-PP), which can prevent the users’ privacy information from being leaked via the merits of edge computing in the process of computing and ensure the real-time, accuracy and stability of the query results. Particularly, we propose a privacy-preserving recommendation algorithm to obtain the desired results for the end users through hybrid filtrations. The filtration-rough set theory algorithm is given to distinguish the valid reviews from spam reviews for the next filtration.

关键词： Privacy protection edge computing recommendation system rough set theory

来源：评论

学校读者我要写书评

暂无评论

A method to calculate recommendation trust of web services

Journal of Software Engineering

引用

Journal of Software Engineering 2014年第2期8卷 108-115页

作者： Liu, Wei Du, Yu-Yue Yan, Chun Sha, Jing College of Information Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Web services are widely accepted and used in the e-commerce. Trust plays an important role in selecting one Web service for application among many services satisfying the demand of requesters and trust for Web services is a hot topic in research fields. This study proposes a method to calculate recommendation trust of Web services and the weight of every recommender is confirmed by norm grey correlation analysis method. The detailed process of the given method is revealed by a specific instance. The method avoids the vicious recommendation and improves the reliability of selected services. © 2014 Academic Journals Inc.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A Location Privacy Preserving Scheme Based on Repartitioning Anonymous Region in Mobile Social Network

引用

Procedia Computer Science 2018年 129卷 368-371页

作者： Lina Ni Yanfeng Yuan Xiao Wang Mengmeng Zhang Jinquan Zhang College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Applying the proliferated location-based services (LBS) to social networks has spawned mobile social network (MSN) services that it allows users to discover potential friends around them. In this paper, we focus on the problem of location privacy preserving in MSN. Particularly, we propose a location privacy preserving (RPAR) scheme via to repartition anonymous region where the central anonymous location minimizes the traffic between the anonymous server and the LBS server while protecting the privacy of the user location.

关键词： Privacy preserving mobile social network location-based service location privacy anonymous region repartition

来源：评论

学校读者我要写书评

暂无评论

Capacity and delay in mobile cognitive networks with random way-point mobility model

引用

AEU - International Journal of Electronics and Communications 2011年第4期65卷 288-295页

作者： Xingzhen Bai Shu Li Changjun Jiang Juan Xu Cheng Wang Lina Han The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China College of Information & Electrical Engineering Shandong University of Science & Technology Qingdao 266510China

We study the throughput and delay scaling laws of the mobile cognitive network. There are n primary users and m secondary users in the primary network and the secondary network, respectively. They are distributed uniformly and independently on the surface of a unit torus, moving according to the random way-point mobility model (RWMM). The primary users have priority to access the spectrum, and do not alter their protocol in the presence of the secondary network. The secondary users opportunistically use the licensed spectrum when it remains unused. Under the improved 2-hop relay policy, we derive the constant throughput of Θ ( 1 ) per primary source–destination (S–D) pair when the radius of the preservation region r p = Θ ( 1 / m ) . The expected delay scales as Θ ( n / v ( n ) ) , where v ( n ) is the average speed of the primary nodes. Moreover, if the secondary network is denser than the primary network, i.e., m = n γ with γ > 1 , the constant throughput of Θ ( 1 ) per secondary S–D pair and the expected delay of Θ ( m / v ( m ) ) can be derived surprisingly when the radius of the avoidance region r s = Θ ( 1 / n ) and r p = Θ ( 1 / m ) , where v ( m ) is the average speed of the secondary nodes.

关键词： Throughput Delay Scaling law Cognitive networks Mobility

来源：评论

学校读者我要写书评

暂无评论

A Blockchain Based Automatic Access Scheme Design and Implement for Small Cell Base Station 21

A Blockchain Based Automatic Access Scheme Design and Implem...

引用

21st IEEE International Conference on Communication technology, ICCT 2021

作者： Liang, Jingchao Wu, Jun Tan, Bin Ren, Haoqi Zhang, Zhifeng School of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Fudan University School of Computer Science Shanghai China Jinggangshan University Electronics and Information Engineering Ji'an China Tongji University Electronics and Information Engineering Shanghai China

ISBN: (纸本)9781665432061

5G technology is constrained by its higher frequency band and smaller coverage area, which leads to the need for operators to use technologies such as small cell base stations to increase the density of base station deployment to ensure signal coverage quality, which leads to more enormous construction costs. Therefore, it is urgent to find a safe and reliable solution that can use the existing public network to realize small cell base stations with automatic access. Based on this demand, we summarize various existing small cell base station automatic access technology solutions and their advantages and disadvantages while combing the characteristics of blockchain technology and its application solutions in similar scenarios. And then, we propose a new blockchain-based base station automatic access solution and implements the system in a practical scenario. In our solution, we innovatively introduce blockchain as an intermediate manager for small base stations and core networks, which solves traditional solutions requiring customized equipment while ensuring safety and reliability. It reduces costs and improves efficiency, but some problems are brought by the 'decentralization' of blockchain waiting to be solved. © 2021 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：