2021 11th International Conference on Information Science and Technology (ICIST)最新文献_第8页

Accounts Receivable Financing and Supply Chain Coordination under the Government Subsidy 政府补贴下的应收账款融资与供应链协调

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440590

Shengying Zhao, Xiangyuan Lu

引用次数: 2

Continuous-Time Algorithm for Multi-Agent Optimization with Global Coupled Constraints 全局耦合约束下多智能体优化的连续时间算法

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440624

Jiaojiao Yan, Jinde Cao, Qingshan Liu

引用次数: 0

Self-triggered Impulsive Synchronization of Multi-agent Systems with Encrypted Communication* 具有加密通信的多智能体系统的自触发脉冲同步*

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440569

Xuegang Tan, Jinde Cao

引用次数: 0

Opinion Targets and Sentiment Terms Extraction based on Self-Attention 基于自关注的意见目标和情感词提取

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440579

Guoyong Cai, Hongyu Li, Tianlin Lan

引用次数: 1

A Hungarian-based Heuristic for Dual-command Storage/Retrieval in Single-machine Flow-rack AS/RS with Determined Locations 基于匈牙利语的单机流架AS/RS双指令存取启发式算法

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440613

Tingyu Zhang, Zhuxi Chen, Li Li

引用次数: 0

Optimal Algorithm of Dual-satellite Navigation Information Based on Inertial Assistance 基于惯性辅助的双星导航信息优化算法

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440577

Wei Ren, Yingjie Wei, Cong Wang

{"title":"Optimal Algorithm of Dual-satellite Navigation Information Based on Inertial Assistance","authors":"Wei Ren, Yingjie Wei, Cong Wang","doi":"10.1109/ICIST52614.2021.9440577","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440577","url":null,"abstract":"Aiming at the application scenarios of the Global Navigation Satellite System (GNSS)/Strapdown inertial navigation system (SINS) integrated navigation algorithm for some special aircraft or some vehicles with high reliability requirements, this article selects two or more satellite navigation receivers to ensure satellite navigation For the reliable application of information, a dual-satellite navigation information optimization algorithm based on inertial assistance is designed. This algorithm designs navigation information availability criteria based on inertial information, navigation information tightening protection criteria, and two-way satellite navigation information selection criteria. On the one hand, it makes full use of inertial information, and on the other hand, it fully considers receiver performance indicators. Based on the principle of whoever locates first and use whoever is first, complete the optimal selection of dual-satellite navigation information sources, thereby improving the reliability and redundancy of satellite navigation information. Finally, the effectiveness of the information source selection algorithm is verified by simulation, and the algorithm can be promoted It is applied to the process of selecting the best use of the two information sources of guidance radar and seeker.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133373420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi-UAVs Task Assignment Based on Fully Adaptive Cross-Entropy Algorithm 基于全自适应交叉熵算法的多无人机任务分配

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440618

Xun Zhang, Kehao Wang, Wenfeng Dai

引用次数: 2

Parallelization of Fast Monte Carlo Dose Calculation for Radiotherapy Treatment Planning on the ARMv8 Architecture 基于ARMv8架构的放射治疗计划快速蒙特卡罗剂量计算并行化

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440606

Chi Jin, Qinglin Wang, Yang Zhao, Y. Dou

{"title":"Parallelization of Fast Monte Carlo Dose Calculation for Radiotherapy Treatment Planning on the ARMv8 Architecture","authors":"Chi Jin, Qinglin Wang, Yang Zhao, Y. Dou","doi":"10.1109/ICIST52614.2021.9440606","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440606","url":null,"abstract":"Monte Carlo (MC) simulation plays a key role in radiotherapy. Since the simulation time of the MC program cannot fully meet the clinical requirements, we use the ARM-based FT-2000+ multi-core processor for parallelization, which provides an effective solution for accelerating MC dose calculation. In this paper, we implement and verify FT-DPM, which is an OpenMP-based MC Dose Planning Method on FT-2000+. FT-DPM utilizes the parallelism of MC simulation and the advantage of ARM architecture to achieve the parallelization on ARM architecture. Meanwhile, we optimize the original DPM program in terms of memory allocation, data structure and data type. The experiments show that, compared with the original DPM code, FT-DPM obtains very accurate results and reaches the maximum speedups of 155.94 times for the electron case. The parallel program based on FT-2000+ only takes 44.1 seconds to simulate the particle transport of 100 million times, showing good clinical application potential. In addition, the speedup and efficiency of FT-DPM running on different core counts are also discussed.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"23 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124876008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reversible data hiding method in encrypted images using secret sharing and Huffman coding 基于秘密共享和霍夫曼编码的加密图像可逆数据隐藏方法

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440649

Shuang Yi, Juan Zhou, Zhongyun Hua, Yong Xiang

{"title":"Reversible data hiding method in encrypted images using secret sharing and Huffman coding","authors":"Shuang Yi, Juan Zhou, Zhongyun Hua, Yong Xiang","doi":"10.1109/ICIST52614.2021.9440649","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440649","url":null,"abstract":"Early works on reversible data hiding in encrypted images (RDHEI) usually generate only one encrypted image from the original image, if the encrypted image is lost or maliciously damaged by an attacker, all information about the original image will be lost. Thus, storing images in distributed servers is an effective solution. Therefore, this paper proposes an RDHEI method using (k, n)-threshold secret sharing. It is not a traditional secret sharing technique, but takes its principles and ideas. In this algorithm, we combine the image encryption and sharing process to generate n shares and send them to the cloud for storage. It maintains the advantage of (k, n)-threshold secret sharing technique that only at least k shares can successfully recover the original image while less than k shares cannot. In addition, the size of each share is smaller than the original image, so that it can save storage spaces. By Huffman coding the pixel difference in the encrypted image block, secret data are embedded into these shares. It is a full reversible method that data extraction and image recovery are performed separately and losslessly. Simulation results, comparisons and security analysis are demonstrated to show superior performances of the proposed algorithm.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

End-to-end Network Embedding Unsupervised Key Frame Extraction for Video-based Person Re-identification 基于视频的人再识别端到端网络嵌入无监督关键帧提取

2021 11th International Conference on Information Science and Technology (ICIST) Pub Date : 2021-05-21 DOI: 10.1109/ICIST52614.2021.9440586

Ye Li, Xiaoyu Luo, Shaoqi Hou, Chao Li, Guangqiang Yin

{"title":"End-to-end Network Embedding Unsupervised Key Frame Extraction for Video-based Person Re-identification","authors":"Ye Li, Xiaoyu Luo, Shaoqi Hou, Chao Li, Guangqiang Yin","doi":"10.1109/ICIST52614.2021.9440586","DOIUrl":"https://doi.org/10.1109/ICIST52614.2021.9440586","url":null,"abstract":"At present, regarding the task of video-based person re-identification, the input sequences have subtle differences and large redundancies because there are not enough effective interventions in the extraction of frame sequences. Although some studies have mentioned that key frame should be extracted first, they have not jointed the key frame extraction and the person re-identification. Consequently, it is difficult to evaluate whether the extracted key frames are effective for person re-identification. In this paper, we introduce an End-to-end Network Embedding Unsupervised Key Frame Extraction (EKEN) to address the above problems. First, we design a key frame extraction module and train it using pseudo labels generated by hierarchical clustering to extract key frames. Second, we embed the key frame extraction module into the person re-identification task. The results of the key frame extraction and the pedestrian re-recognition are fed back to each other in time. The instant feedback promotes the synchronization optimization of these two modules. The mAP achieved by our method in the MARS dataset is improved by 0.7%, 2.9%, 2.1% and 2.3% over the methods based on Random, Evenly, Cluster and Frame difference, respectively. Particularly, our method is more fit for the real-world application comparing to existing methods.","PeriodicalId":371599,"journal":{"name":"2021 11th International Conference on Information Science and Technology (ICIST)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115925816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2