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

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yang Yang Jialiang Chen Xianghan Zheng Ximeng Liu Wenzhong Guo Hairong Lv College of Mathematics and Computer Science Fuzhou University Fuzhou China Guangxi Key Laboratory of Cryptography and Information Security Guangnxi China Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Guangzhou China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control (Minjiang University) Fuzhou China Ministry of Education Key Laboratory of Bioinformatics Bioinformatics Division and Center for Synthetic and Systems Biology Beijing National Research Center for Information Science and TechnologyDepartment of Automation Tsinghua University Beijing China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

With the rapid development of computation and communication technologies, the traditional vehicle ad hoc networks (VANETs) are changing to Internet of vehicle (IoV). Vehicular announcement networks in IoV have been widely used in the communication of vehicles. Generally, we need to solve two problems while establishing a vehicular announcement system. First, we need to protect user's privacy when broadcasting the message. Second, participants usually lack the enthusiasm to reply to the announcement. To solve these two problems, we propose a novel blockchain-based incentive announcement system that not only allows participants to anonymously announce their message on the blockchain in a non-trusted environment, but also motivates witnesses to respond to the request of the traffic information with incentive mechanism. Meanwhile, traffic messages and signatures in our system are tamper-resistant, which are recorded on the blockchain. According to the security and performance analysis, it shows that our system is privacy-preserving and efficient in computation cost.

关键词： Blockchain Privacy Smart contracts Authentication Internet Remuneration Hash functions

来源：评论

学校读者我要写书评

暂无评论

Constructing multi-modality and multi-classifier radiomics predictive models through reliable classifier fusion

arXiv

引用

arXiv 2017年

作者： Zhou, Zhiguo Zhou, Zhi-Jie Hao, Hongxia Li, Shulong Chen, Xi Zhang, You Folkert, Michael Wang, Jing Department of Radiation Oncology UT Southwestern Medical Center DallasTX United States High-Tech Institute of Xi'an Xi'an China Department of Information and Control Engineering Xi'an University of Technology Xi'an China School of Computer Science and Technology Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an China School of Biomedical Engineering Southern Medical Unversity Guangzhou China Institute of Image Processing and Pattern Recognition Xi'an Jiaotong Unversity Xi'an China

Radiomics aims to extract and analyze large numbers of quantitative features from medical images and is highly promising in staging, diagnosing, and predicting outcomes of cancer treatments. Nevertheless, several challenges need to be addressed to construct an optimal radiomics predictive model. First, the predictive performance of the model may be reduced when features extracted from an individual imaging modality (e.g. PET, CT, MRI) are blindly combined into a single predictive model. Second, because many different types of classifiers are available to construct a predictive model, selecting an "optimal" classifier for a particular application is still challenging. In this work, we developed multi-modality and multi-classifier radiomics predictive models that address the aforementioned issues in currently available models. Specifically, a new reliable classifier fusion strategy was proposed to optimally combine output from different modalities and classifiers. In this strategy, modality-specific classifiers were first trained, and an analytic evidential reasoning (ER) rule was developed to fuse the output score from each modality to construct an optimal predictive model. One public datasets and two clinical case studies were performed to validate model performance. The experimental results indicated that the proposed ER rule based radiomics models outperformed the traditional models that rely on a single classifier or simply use combined features from different modalities. Copyright © 2017, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Dynamic Ca2+ sensitivity of BK channels

Dynamic Ca2+ sensitivity of BK channels

引用

The 10th Chinese Symposium on Calcium Signaling(第十届全国钙信号和细胞功能研讨会)

作者： Pan-Pan Hou Feng Xiao Hao-Wen Liu Ming Yuchi Guo-Hui Zhang Ying Wu Wei Wang Wen-Ping Zeng Ming-Yue Ding Zheng-Xing Wu Jian-Ming Cui Jiu-Ping Ding Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Department of Biomedical Engineering College of Life Science and Technology Wuhan Hubei China Department of pharmacology Soochow University college of pharmaceutical Sciences Suzhou 215123China Key Laboratory of Molecular Biophysics Huazhong University of Science and Technology Ministry of Education College of Life Science and Technology Wuhan Hubei China Department of Biomedical Engineering Center for the Investigation of Membrane Excitability DisordersCardiac Bioelectricity and Arrhythmia Center Washington University St Louis MO 63130 USA

来源：评论

学校读者我要写书评

暂无评论

Coordinated Guiding Vector Field Design for Ordering-Flexible Multi-Robot Surface Navigation

arXiv

引用

arXiv 2024年

作者： Hu, Bin-Bin Zhang, Hai-Tao Yao, Weijia Sun, Zhiyong Cao, Ming The School of Artificial Intelligence and Automation The Engineering Research Center of Autonomous Intelligent Unmanned Systems The Key Laboratory of Image Processing and Intelligent Control The State Key Lab of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan430074 China The School of Robotics Hunan University Hunan410082 China The Institute of Engineering and Technology University of Groningen Groningen9747 AG Netherlands Department of Electrical Engineering Eindhoven University of Technology Netherlands

We design a distributed coordinated guiding vector field (CGVF) for a group of robots to achieve ordering-flexible motion coordination while maneuvering on a desired two-dimensional (2D) surface. The CGVF is characterized by three terms, i.e., a convergence term to drive the robots to converge to the desired surface, a propagation term to provide a traversing direction for maneuvering on the desired surface, and a coordinated term to achieve the surface motion coordination with an arbitrary ordering of the robotic group. By setting the surface parameters as additional virtual coordinates, the proposed approach eliminates potential singularity of the CGVF and enables both the global convergence to the desired surface and the maneuvering on the surface from all possible initial conditions. The ordering-flexible surface motion coordination is realized by each robot to share with its neighbors only two virtual coordinates, i.e. that of a given target and that of its own, which reduces the communication and computation cost in multi-robot surface navigation. Finally, the effectiveness of the CGVF is substantiated by extensive numerical simulations. Copyright © 2024, The Authors. All rights reserved.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

Impulsive control with time windows for hyperchaotic exponential synchronization

Impulsive control with time windows for hyperchaotic exponen...

引用

International Conference on Informative and Cybernetics for Computational Social Systems (ICCSS)

作者： Hongjuan Wu Xiang Hu Yuming Feng Zhengwen Tu Key Laboratory of Intelligent Information Processing and Control of Chongqing Municipal Institutions of Higher Education Chongqing Three Gorges University Wanzhou Chongqing P. R. China School of Three Gorges Artificial Intelligence Chongqing Three Gorges University Wanzhou Chongqing P. R. China

ISBN: (数字)9781728158570

ISBN: (纸本)9781728158587

In actual situation, the input error of impulsive signal is inevitable and there are always some time delays when different systems communicate with each other. Then, considering the input error and time delays in the real world, this paper provides the criteria for the exponential lag synchronization of one kind of hyperchaotic system based on impulsive control with time windows, matrix inequalities, etc. Finally, the simulation results are displayed to illustrate the theoretical results.

关键词： Input error delays exponential lag synchronization hyperchaotic system impulsive control time windows Input Error Time windows control period Impulsiveness time delay delay

来源：评论

学校读者我要写书评

暂无评论

Incremental Online Learning of Randomized Neural Network with Forward Regularization

arXiv

引用

arXiv 2024年

作者： Wang, Junda Hu, Minghui Li, Ning Al-Ali, Abdulaziz Suganthan, Ponnuthurai Nagaratnam The Key Laboratory of System Control and Information Processing Ministry of Education of China China The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China The School of Electrical and Electronic Nanyang Technological University Singapore The KINDI Computing Research Center College of Engineering Qatar University Qatar

Online learning of deep neural networks suffers from challenges such as hysteretic non-incremental updating, increasing memory usage, past retrospective retraining, and catastrophic forgetting. To alleviate these drawbacks and achieve progressive immediate decision-making, we propose a novel Incremental Online Learning (IOL) process of Randomized Neural Networks (Randomized NN), a framework facilitating continuous improvements to Randomized NN performance in restrictive online scenarios. Within the framework, we further introduce IOL with ridge regularization (-R) and IOL with forward regularization (-F). -R generates stepwise incremental updates without retrospective retraining and avoids catastrophic forgetting. Moreover, we substituted -R with -F as it enhanced precognition learning ability using semi-supervision and realized better online regrets to offline global experts compared to -R during IOL. The algorithms of IOL for Randomized NN with -R/-F on non-stationary batch stream were derived respectively, featuring recursive weight updates and variable learning rates. Additionally, we conducted a detailed analysis and theoretically derived relative cumulative regret bounds of the Randomized NN learners with -R/-F in IOL under adversarial assumptions using a novel methodology and presented several corollaries, from which we observed the superiority on online learning acceleration and regret bounds of employing -F in IOL. Finally, our proposed methods were rigorously examined across regression and classification tasks on diverse datasets, which distinctly validated the efficacy of IOL frameworks of Randomized NN and the advantages of forward regularization. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Performance-Based Model Recovery Anti-Windup Design for Linear Systems Subject to Actuator Saturation

A Performance-Based Model Recovery Anti-Windup Design for Li...

引用

American control Conference (ACC)

作者： Wenxin Lai Yuanlong Li Zongli Lin Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Char-lottesville VA U.S.A.

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

In this paper, we investigate the problem of reference tracking for a class of linear systems subject to actuator saturation and propose a performance-based model recovery anti-windup strategy. We adopt the classic model recovery anti-windup framework and regard the states or one of the outputs of the anti-windup compensator as the tracking error, by which the difference between the unconstrained system and the saturated system is quantified. Then, instead of employing the commonly used $\mathcal{L}_{2}$ gain, we present the prescribed performance functions (PPFs) to characterize the real-time tracking error such that the system performance can be captured more specifically. In particular, to avoid singular issues arising from the occurrence of saturation, we modify the existing PPFs with an auxiliary system when saturation occurs. Based on these modified performance functions, we follow a modified prescribed performance control approach and design the remaining output of the anti-windup compensator. Such a design procedure is constructive, making it more promising for extension to nonlinear systems. Theoretical results establish the boundedness of all signals in the closed-loop system. Simulation results verify the effectiveness of our design strategy.

关键词： Linear systems Actuators Simulation System performance Stability analysis Real-time systems Trajectory

来源：评论

学校读者我要写书评

暂无评论

AoI-Reliability Analysis with Block Length over Erasure Channels Using Rateless Codes

AoI-Reliability Analysis with Block Length over Erasure Chan...

引用

International Conference on Communication Technology (ICCT)

作者： Haobo Huang Yusun Fu Yue Qiao Junpeng Yin Weiwu Yan Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350363760

ISBN: (纸本)9798350363777

As a metric to measure the information freshness, Age of Information (AoI) is widely used to evaluate low-latency high-reliability communication. Since the communication in Industrial Internet of Things (IIoT) often has the special requirements, the relationship among AoI, reliability and block length in time-critical scenarios with bounded latency and non-time-critical scenarios without bounded latency is explored respectively in this paper, based on erasure channels using rateless codes. We build a model using LT codes over erasure channels and consider two metrics: average AoI and bounded AoI. Theoretical analysis and simulation results show that AoI has a minimum value with different block lengths. Furthermore, we draw a conclusion that the minimum value of AoI under different reliability is monotonically decreasing functioned with reliability. Finally, the impact of overhead on reliability and AoI of LT codes in time-critical scenarios is studied.

关键词： Measurement Codes Simulation Reliability theory Information age Communications technology Time factors Low latency communication Industrial Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Enhancing the McEliece Scheme Based on Concatenation of Polar Codes and Blocked QC-LDPC Codes

Enhancing the McEliece Scheme Based on Concatenation of Pola...

引用

IEEE Conference on Communications and Network Security (CNS)

作者： Xin Lin Yusun Fu Zihao Wang Junpeng Yin Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350375961

ISBN: (纸本)9798350375978

This paper proposes an enhanced McEliece cryptosystem, leveraging a concatenation scheme of Polar codes and blocked QC-LDPC codes. During the key generation phase, the generator matrices for both Polar and blocked QC-LDPC codes are employed as private keys. These matrices are subsequently multiplied by reversible and random permutation matrices respectively. The products of these multiplications are then combined to form the public key, effectively concealing the structural properties of the generator matrices. In the encryption phase, the plaintext is encrypted sequentially through the Polar codes and the blocked QC-LDPC codes. This process introduces two layers of random error vectors, culminating in the generation of the encrypted ciphertext. The proposed scheme reduces the public key length by 54% and doubles the security level compared to the original McEliece scheme with similar parameters. It also significantly reduces the total key length compared to improved schemes based on Polar codes and QC-LDPC/MDPC codes at an 80-bit security level, and shortens the private key length compared to schemes based on Polar-LDPC concatenated codes. Notably, the scheme is secure against known structural and decoding attacks while increases resistance to information set decoding (ISD) attacks. Through the randomization and hashing of the plaintext, the proposed scheme can achieve IND-CCA2 security.

关键词： Resistance Codes Public key Network security Generators Vectors Decoding Encryption Concatenated codes Polar codes

来源：评论

学校读者我要写书评

暂无评论

Boltzmann Robust Soliton Distribution for Rateless Codes

Boltzmann Robust Soliton Distribution for Rateless Codes

引用

International Conference on Communication Technology (ICCT)

作者： Jinhui Tang Yusun Fu Yue Qiao Junpeng Yin Haobo Huang School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Ningbo Artificial Intelligence Institute Shanghai Jiao Tong University Ningbo China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350363760

ISBN: (纸本)9798350363777

The decoding success rate may be worse when classical degree distributions are used in short-packet transmission of rateless codes, especially in industrial communication scenarios. A novel Boltzmann degree distribution is proposed for Luby Transform (LT) codes. The Boltzmann degree distribution has a high decoding success rate for short-packet transmission but a lower decoding success rate in long-packet transmission. To balance the performance of rateless codes for short and long packet transmission, the Boltzmann degree distribution and the robust soliton distribution (RSD) are combined with a new joint degree distribution, called Boltzmann Robust Soliton Distribution (BRSD). Simulation results show that compared with RSD and Poisson robust soliton distribution (PRSD), the proposed joint distribution can achieve a higher decoding success rate and reduce the average degree, especially in short-packet transmission of industrial communication.

关键词： Codes Simulation Industrial communication Symbols Solitons Transforms Robustness Decoding Complexity theory Physics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：