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

Understanding transitions in animated bar charts

Visual Intelligence 2023年第1期1卷 249-263页

作者： Datong Wei Can Liu Xiaolong(Luke)Zhang Xiaoru Yuan Key Laboratory of Machine Perception(Ministry of Education) and the School of Intelligence Science and TechnologyPeking UniversityBeijingChina College of Information Sciences and Technology Pennsylvania State UniversityUniversity ParkUSA National Engineering Laboratory for Big Data Analysis and Application Peking UniversityBeijingChina

Animated bar charts have gained popularity on the Internet for their ability to display historical rankings through smooth animated transitions that clearly show the rankings over *** investigate the usage scenarios of these charts,we analyzed the pop-up comments to understand viewers’*** suggest that animated transitions play a key role in viewers’perception of ranking *** summarized various transition methods and evaluated their impact on user perception and memory through user *** also conducted a detailed analysis of each transition method’s *** research sheds light on the effectiveness of different transition strategies for animated bar charts.

关键词： Visualization for the masses Animation Transition Quantitative evaluation

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Efficient key-Exchange Protocol for Intelligent Supply Line Surveillance in Smart Grids

引用

IEEE Internet of Things Journal 2025年第12期12卷 21784-21792页

作者： Ayub, Muhammad Faizan Li, Xiong Mahmood, Khalid Alenazi, Mohammed J.F. Das, Ashok Kumar Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu12599 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan Department of Computer Engineering Riyadh11451 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500 032 India Korea University College of Informatics Department of Computer Science and Engineering Anam-ro Seoul145 Korea Republic of Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan 250353 China

Intelligent supply line surveillance is critical for modern smart grids. Smart sensors and gateway nodes are strategically deployed along supply lines to achieve intelligent surveillance. They collect data continuously and transmit it to the control centre in real-time. It enables real-time monitoring, fault detection, and efficient energy management across distribution networks. This advanced surveillance system ensures continuous monitoring of supply lines, detecting anomalies, and optimizing operations to maintain the stability and reliability of the smart grid. However, the reliance of all participating nodes on public communication channels to transmit supply line surveillance data exposes these systems to critical cyber attacks. These cyber attacks include impersonation, physical tampering, ephemeral secret leakage, and desynchronization attacks. To address these issues, existing key-exchange protocols often fail to ensure robust security while imposing high computation and communication overheads, limiting their practicality for resource-constrained environments. Therefore, we propose a secure and efficient key exchange and tamper-resistant authentication protocol using Elliptic Curve Cryptography (ECC) and Physical Unclonable Functions (PUFs). The PUF mechanism provides robust resistance against physical tampering and cloning attacks, ensuring enhanced physical security for supply line devices. We validate the security robustness of the devised protocol using the Random or Real (ROR) model. Furthermore, informal security analysis demonstrates the protocol's robustness in rigorously resisting various attacks, including physical tampering, impersonation, ephemeral secret leakage and desynchronization. Moreover, we determine the performance evaluation that reveals the protocol's superior efficiency compared to competing protocols, achieving significant reductions of 28.64% in computation overhead and 9.96% in communication overhead. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Improving Visual Reinforcement Learning via Spatial-Temporal data Augmentation

Improving Visual Reinforcement Learning via Spatial-Temporal...

引用

Consumer Electronics and Computer engineering (ICCECE), 2021 IEEE International Conference on

作者： Jiabao Li Qingwen Hou Jie Zhang Xianzhong Chen Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing China

ISBN: (数字)9798331533113

ISBN: (纸本)9798331533120

Sample efficiency has been a challenging problem in visual reinforcement learning, where agents not only learn polices but also extract meaningful state representations for decision making from images. Reinforcement Learning methods that adopt data augmentation have significantly improved sample efficiency. However, prior studies have primarily focused on spatial augmentation, which enhances data diversity but insufficiently exploits temporal information, such as historical states which is critical for time-series-dependent reinforcement learning tasks. To address this gap, we introduce a Spatial-Temporal data Augmentation (STDA) framework designed to enhance the agent's ability to learn task-relevant state representations by effectively leveraging historical state information. We evaluate our approach using the DeepMind Control Suite, and empirical results demonstrate that STDA significantly improves performance, surpassing state-of-the-art methods across a range of tasks.

关键词： Visualization Q-learning Law enforcement Decision making Training data Reinforcement learning Benchmark testing data augmentation Consumer electronics

来源：评论

学校读者我要写书评

暂无评论

Semantic Correspondence with Peripheral Position Coding 13

Semantic Correspondence with Peripheral Position Coding

引用

13th International Conference on Information Technology in Medicine and Education, ITME 2023

作者： Chen, Jinjian Li, Zuoyong Lai, Taotao Xie, Huosheng College of Computer and Data Science Fuzhou University Fuzhou350108 China College of Computer and Control Engineering Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou350121 China

ISBN: (纸本)9798350319156

Establishing dense correspondences between semantically similar images is a challenging task. Cost aggregation is a crucial step in finding correct dense correspondences, with the goal of optimizing the initial correlation map thereby removing the ambiguity of the correspondences. Current approaches use transformer architectures for cost aggregation, which lack local priors to adequately capture the local information contained in the correlation map. We propose to incorporate peripheral position coding into the transformer to explore the local information to obtain the matching set and call it the Peripheral Transformer Matcher (PTM). This coding technique partitions the overall receptive field of the self-attention mechanism into diverse peripheral regions, each with its own set of weights. By doing this, the proposed PTM gets a specific local prior by adding an inductive bias to the transformer models and making the initial correlation map less confusing. In addition, a local self-attention module is used to enhance the image features and obtain an enhanced initial correlation map. Comparisons of the experimental results with baselines on public datasets demonstrate the effectiveness of the proposed PTM. © 2023 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Block Broyden's Methods for Solving Nonlinear Equations 37

Block Broyden's Methods for Solving Nonlinear Equations

引用

37th Conference on Neural Information Processing Systems, NeurIPS 2023

作者： Liu, Chengchang Chen, Cheng Luo, Luo Lui, John C.S. Department of Computer Science & Engineering The Chinese University of Hong Kong Hong Kong Shanghai Key Laboratory of Trustworthy Computing East China Normal University China School of Data Science Fudan University China

ISBN: (纸本)9781713899921

This paper studies quasi-Newton methods for solving nonlinear equations. We propose block variants of both good and bad Broyden's methods, which enjoy explicit local superlinear convergence rates. Our block good Broyden's method has a faster condition-number-free convergence rate than existing Broyden's methods because it takes the advantage of multiple rank modification on Jacobian estimator. On the other hand, our block bad Broyden's method directly estimates the inverse of the Jacobian provably, which reduces the computational cost of the iteration. Our theoretical results provide some new insights on why good Broyden's method outperforms bad Broyden's method in most of the cases. The empirical results also demonstrate the superiority of our methods and validate our theoretical analysis. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

Seastar: A Cache-Efficient and Load-Balanced key-Value Store on Disaggregated Memory

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store...

引用

2024 IEEE International Conference on Cluster Computing, CLUSTER 2024

作者： Du, Jingwen Wang, Fang Feng, Dan Zeng, Dexin Yi, Sheng Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System China School of Computer Science and Technology Huazhong University of Science and Technology China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (纸本)9798350358711

In modern datacenters, memory disaggregation un-packs monolithic servers to build independent network-connected compute and memory pools, greatly improving resource uti-lization. Existing memory-disaggregated key-value stores adopt ownership sharing or ownership partitioning for request scheduling and they all show poor performance and scalability. The former generates multiple cache misses and multiple network round trips due to poor cache locality, while the latter fails to fully use resources on all Compute Nodes (CNs) due to load imbalance. In this paper, we propose Seastar, a fast and scalable key-value store that achieves high cache locality as well as load balancing. To enable high concurrency and ensure linearizability, Seastar exploits a self-verification version chain to provide out-of-place atomic updates and ensure consistent reads. To improve cache locality, Seastar leverages a pair-based ownership assigning scheme to assign the processing permission of requests corre-sponding to each key to a CN pair through two independent hash functions. To ensure load balancing among CNs, Seastar proposes a decentralized power-of-two-choices routing scheme to route the requests to the less-loaded CNs in CN pairs for handling. Experimental results demonstrate that Seastar improves the throughput by up to 6.7x and significantly reduces the latency compared with state-of-the-art memory-disaggregated key-value stores. © 2024 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Considering the full induction control of intersection for intelligent connected new energy vehicles

Considering the full induction control of intersection for i...

引用

2023 International Conference on Computer Application and Information Security, ICCAIS 2023

作者： Wang, Ruihan Liang, Zijun Li, Yuqi Deng, Ran Zhan, Xuejuan Shan, Ailin Wang, Ruipeng Niu, Yiran School of Urban Construction and Transportation Hefei University Anhui Hefei230601 China Anhui Provincial Key Laboratory of Urban Rail Transit Safety and Emergency Management Anhui Hefei230601 China Anhui Province Transportation Big Data Analysis and Application Engineering Laboratory Anhui Hefei230601 China

ISBN: (纸本)9781510675032

In response to the inadequacy of timing control methods in adapting to the random changes in traffic flow at intersections and the neglect of the impact of intelligent connected new energy vehicles (ICNEVs), we investigate the effectiveness of a full induction control logic for intersections considering ICNEVs. Firstly, vehicle headway and queue detectors are deployed at each approach of the intersection to monitor real-time traffic conditions. Subsequently, a full induction control logic and corresponding parameters are established based on the clearance and queue status of vehicles at the intersection. The study then considers the influence of different permeability of ICNEVs on the full induction control logic. Finally, a comparison is made among the current state scheme, timed optimization, and full induction control schemes using VISSIM traffic simulation software. Additionally, the study further analyzes the effects of intersection full induction control under different permeability of ICNEVs, thereby validating the effectiveness of the research. © 2024 SPIE.

关键词： Computer software

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Tuple Transfer for Pipelined Query Execution on CPU-GPU Coprocessor 28th

Fine-Grained Tuple Transfer for Pipelined Query Execution o...

引用

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Yang, Zhenhua Pan, Qingfeng Xu, Chen Shanghai Engineering Research Center of Big Data Management East China Normal University Shanghai200062 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China

ISBN: (纸本)9783031306365

To leverage the massively parallel capability of GPU for query execution, GPU databases have been studied for over a decade. Recently, researchers proposed to execute queries with both CPU and GPU in a pipelined approach. In the pipelined query execution, the cross-processor tuple transfer plays a crucial role for the overall query execution performance. The state-of-the-art solution achieves cross-processor tuple transfer using a queue-like data structure. However, it is coarse-grained due to the use of a single spin lock to achieve thread-safety. This design causes performance issues as it prevents the threads from accessing the queue simultaneously. In this paper, we propose a fine-grained tuple transfer mechanism. It employs decoupled enqueue/dequeue to enable two threads on different processors to access the queue at the same time. Moreover, this mechanism explores subqueue-based locking to enable the threads on the same processor to access the queue at the same time. In particular, we implement a prototype system, namely π QC, which adopts fine-grained tuple transfer. Our experiments show that π QC achieves an order of magnitude better performance than existing GPU databases such as HeavyDB. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Multi-source Multi-label Feature Selection

Multi-source Multi-label Feature Selection

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiulan Yuan Xuegang Hu Peipei Li Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei City China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei City China

Feature selection for multi-source multi-label data has attracted much attention, because there are a lot of scenarios that produce multiple source data with multi-labels in the real-world applications, which aggravates the problems of dimensional disaster and the label skewness. However, most of existing multi-source feature selection methods miss the multi-label issue while existing multi-label feature selection methods can not select the optimal feature set in the multi-source environment. Motivated by this, we propose a novel feature selection method, called MSMLFS. To be specific, the Inf-FS algorithm is firstly introduced to handle multi-label feature selection for each data source, which considers the label weight in the feature selection. Secondly, the over-sampling mechanism and the inter-source feature fusion method are used to handle the label skewness of multi-label data and the feature selection in multiple sources respectively. Finally, extensive experiments conducted on synthetic and real-world multi-source multi-label data sets demonstrate that the proposed method outperforms several state-of-the-art multi-source or multi-label feature selection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：