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

Identify information sources with different start times in complex networks based on sparse observers

Chinese Physics B 2024年第11期33卷 467-479页

作者： Yuan-Zhang Deng Zhao-Long Hu Feilong Lin Chang-Bing Tang Hui Wang Yi-Zhen Huang School of Computer Science and Technology Zhejiang Normal UniversityJinhua 321004China School of Physics and Electronic Information Engineering Zhejiang Normal UniversityJinhua 321004China School of Information Engineering Jinhua PolytechnicJinhua 321016China

The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial *** there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains *** this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start *** proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread *** core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear *** experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and ***,we find that our method maintains robustness irrespective of the number of sources and the average degree of *** with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.

关键词： complex networks information spread source identification backward spread centricity

来源：评论

学校读者我要写书评

暂无评论

TSCompiler: efficient compilation framework for dynamic-shape models

引用

science China(information sciences) 2024年第10期67卷 67-84页

作者： Xiang LUO Chen ZHANG Chenbo GENG Yanzhi YI Jiahui HU Renwei ZHANG Zhen ZHANG Gianpietro CONSOLARO Fan YANG Tun LU Ning GU Li SHANG School of Computer Science Fudan University School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University School of Computer Science and Technology Harbin Institute of Technology Huawei Technologies Co. Ltd. Huawei Paris Research Center School of Microelectronics Fudan University

Today's deep learning models face an increasing demand to handle dynamic shape tensors and computation whose shape information remains unknown at compile time and varies in a nearly infinite range at runtime. This shape dynamism brings tremendous challenges for existing compilation pipelines designed for static models which optimize tensor programs relying on exact shape values. This paper presents TSCompiler, an end-to-end compilation framework for dynamic shape models. TSCompiler first proposes a symbolic shape propagation algorithm to recover symbolic shape information at compile time to enable subsequent optimizations. TSCompiler then partitions the shape-annotated computation graph into multiple subgraphs and fine-tunes the backbone operators from the subgraph within a hardware-aligned search space to find a collection of high-performance schedules. TSCompiler can propagate the explored backbone schedule to other fusion groups within the same subgraph to generate a set of parameterized tensor programs for fused cases based on dependence analysis. At runtime, TSCompiler utilizes an occupancy-targeted cost model to select from pre-compiled tensor programs for varied tensor shapes. Extensive evaluations show that TSCompiler can achieve state-of-the-art speedups for dynamic shape models. For example, we can improve kernel efficiency by up to 3.97× on NVIDIA RTX3090, and 10.30× on NVIDIA A100 and achieve up to five orders of magnitude speedups on end-to-end latency.

关键词： machine learning tensor compilers dynamic shape operator fusion code generation auto-tuning

来源：评论

学校读者我要写书评

暂无评论

A Novel Trustworthiness Measurement Model Based on Weight and User Feedback

引用

Chinese Journal of Electronics 2022年第4期31卷 612-625页

作者： ZHOU Wei MA Yanfang PAN Haiyu School of Computer Science and Technology Huaibei Normal University School of Computer Science and Information Engineering Changzhou Institute of Technology School of Computer Science and Information Security Guilin University of Electronic Technology

Software trustworthiness is an essential criterion for evaluating software quality. In componentbased software, different components play different roles and different users give different grades of trustworthiness after using the software. The two elements will both affect the trustworthiness of software. When the software quality is evaluated comprehensively, it is necessary to consider the weight of component and user feedback. According to different construction of components, the different trustworthiness measurement models are established based on the weight of components and user feedback. Algorithms of these trustworthiness measurement models are designed in order to obtain the corresponding trustworthiness measurement value automatically. The feasibility of these trustworthiness measurement models is demonstrated by a train ticket purchase system.

关键词： Component-based software Trustworthiness Weight User feedback Measurement

来源：评论

学校读者我要写书评

暂无评论

Research on facial expression recognition based on multimodal data fusion and neural network

引用

International Journal of Wireless and Mobile Computing 2024年第1期27卷 47-55页

作者： Han, Yi Wang, Xubin Lu, Zhengyu School of Mechanical Science and Engineering Huazhong University of Science and Technology Hubei Wuhan China Anyang Institute of Technology Department of Computer Science and Information Engineering Henan Province Anyang China School of Computer Science and Information Engineering Shanghai Institute of Technology FengXian District Shanghai China

Facial expression recognition is a challenging task when neural network is applied to pattern recognition. Most of the current recognition research is based on single source facial data, which generally has the disadvantages of low accuracy and low robustness. In this paper, a neural network algorithm of facial expression recognition based on multimodal data fusion is proposed. The algorithm is based on the multimodal data, and it takes the facial image, the histogram of oriented gradient of the image and the facial landmarks as the input, and establishes Convolutional Neural Network (CNN) designed to extract features from facial image, neural network designed to extract features from facial Landmarks and Neural Network (LNN) designed to extract features from Histogram of gradient (HNN), three sub-neural networks to extract data features, using multimodal data feature fusion mechanism to improve the accuracy of facial expression recognition. Experimental results show that, the algorithm has a great improvement in accuracy, robustness and detection speed. Copyright © 2024 Inderscience Enterprises Ltd.

关键词： Data fusion

来源：评论

学校读者我要写书评

暂无评论

Unleashing the power of pseudo-code for binary code similarity analysis

引用

Cybersecurity 2023年第2期6卷 44-61页

作者： Weiwei Zhang Zhengzi Xu Yang Xiao Yinxing Xue School of Computer Science and Engineering University of Science and Technology of ChinaHefeiChina School of Computer Science and Engineering Nanyang Technological UniversitySingaporeSingapore Institute of Information Engineering Chinese Academy of SciencesBeijingChina School of Cyber Security University of Chinese Academy of SciencesBeijingChina

Code similarity analysis has become more popular due to its significant applicantions,including vulnerability detection,malware detection,and patch *** the source code of the software is difficult to obtain under most circumstances,binary-level code similarity analysis(BCSA)has been paid much attention *** recent years,many BCSA studies incorporating Al techniques focus on deriving semantic information from binary functions with code representations such as assembly code,intermediate representations,and control flow graphs to measure the ***,due to the impacts of different compilers,architectures,and obfuscations,binaries compiled from the same source code may vary considerably,which becomes the major obstacle for these works to obtain robust *** this paper,we propose a solution,named UPPC(Unleashing the Power of Pseudo-code),which leverages the pseudo-code of binary function as input,to address the binary code similarity analysis challenge,since pseudocode has higher abstraction and is platform-independent compared to binary *** selectively inlines the functions to capture the full function semantics across different compiler optimization levels and uses a deep pyramidal convolutional neural network to obtain the semantic embedding of the *** evaluated UPPC on a data set containing vulnerabilities and a data set including different architectures(X86,ARM),different optimization options(O0-O3),different compilers(GCC,Clang),and four obfuscation *** experimental results show that the accuracy of UPPC in function search is 33.2%higher than that of existing methods.

关键词： Binary code similarity Machine learning Software security Pseudo-code

来源：评论

学校读者我要写书评

暂无评论

CAAF: An NDN-Based Cache-Aware Adaptive Forwarding Strategy for Reliable Content Delivery in VANETs

引用

IEEE Transactions on Mobile Computing 2025年第07期24卷 6361-6375页

作者： Wang, Haodong Han, Jiangping Xue, Kaiping Yang, Jiayu Li, Jian Sun, Qibin Lu, Jun Pengcheng Laboratory Guangdong Shenzhen518000 China University of Science and Technology of China Department of Electronic Engineering and Information Science Anhui Hefei230027 China University of Science and Technology of China School of Cyber Science and Technology Anhui Hefei230027 China

The high mobility in Vehicular Ad-hoc Networks (VANETs) significantly affects the reliability of data transmission. To solve this problem, Named Data Networking (NDN)-based VANETs are proposed, utilizing in-network caching and named-based forwarding to overcome the dual challenges of mobility and connectivity. Although in-network caching enhances content availability, a strategy that accurately locates and efficiently utilizes the cached content in VANETs with highly dynamic environments is still lacking. In this paper, we propose a novel NDN-based cache-aware adaptive forwarding (CAAF) strategy for VANETs. CAAF proactively predicts content locations and ensures reliable content retrieval by adaptively selecting forwarding nodes that prioritize fast delivery and stable transmission. Specifically, we design a content information table for each vehicle to record information about the Interest packets it receives. Furthermore, these tables are updated periodically across all vehicles and a prediction model is used to predict real-time in-network caching during the update interval. Subsequently, we execute a filter mechanism to sieve candidate forwarding vehicles that satisfy both the accessibility and stability requirements. These candidates are then evaluated using a multi-attribute decision-making method across diverse parameters to determine the optimal forwarding node. Our extensive simulation results demonstrate that the proposed CAAF outperforms the state-of-the-art forwarding strategy regarding content retrieval delay and Interest satisfaction ratio across diverse scenarios. © 2002-2012 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Generative Adversarial Networks (GANs) for Image Synthesis and Augmentation 4

Generative Adversarial Networks (GANs) for Image Synthesis a...

引用

4th IEEE International Conference on Electronic technology, Communication and information, ICETCI 2024

作者： Wen, Yuxin Mei, Zhenhao Qi, Chuyue Xinjiang University Department of Software Engineering Urumqi China Hefei University of Technology School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9798350361643

In the realm of medical imaging, a scarcity of reliable, sizable datasets for training supervised deep learning models persists. One solution involves leveraging Generative Adversarial Networks (GANs) to fabricate synthetic deepfake images, bridging this gap and enriching available data. Deepfake technology seamlessly transfers crucial features from source to target images or videos, mimicking the source with remarkable fidelity. Over the past decade, propelled by cutting-edge deep learning techniques and vast datasets, medical image processing has made monumental strides. Supervised deep learning models now achieve superhuman performance across diverse medical imaging applications. Synthetic deepfake images, produced through techniques like GANs, serve various purposes, including dataset balancing, modal translation, and expansion. To efficiently augment training data for deep learning, a hierarchical GAN (HGAN) framework is proposed, focusing on generating high-quality knee images. HGAN integrates spectral normalization in discrimination and pixel normalization in generation, enhancing training stability. Evaluation metrics such as AM Score and Mode Score are employed to benchmark HGAN against alternatives like PGGAN, reflecting its efficacy in advancing medical imaging research and application. © 2024 IEEE.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Anti-Interference Low-Power Double-Edge Triggered Flip-Flop Based on C-Elements

引用

Tsinghua science and technology 2022年第1期27卷 1-12页

作者： Zhengfeng Huang Xiao Yang Tai Song Haochen Qi Yiming Ouyang Tianming Ni Qi Xu School of Electronic Science and Applied Physics Hefei University of TechnologyHefei 230601China School of Computer and Information Hefei University of TechnologyHefei 230601China School of Electrical Engineering Anhui Polytechnic UniversityWuhu 241000China

When the input signal has been interfered and glitches occur,the power consumption of Double-Edge Triggered Flip-Flops(DETFFs)will significantly *** effectively reduce the power consumption,this paper presents an anti-interference low-power DETFF based on *** improved C-element is used in this DETFF,which effectively blocks the glitches in the input signal,prevents redundant transitions inside the DETFF,and reduces the charge and discharge frequencies of the *** C-element has also added pull-up and pull-down paths,reducing its *** with other existing DETFFs,the DETFF proposed in this paper only flips once on the clock edge,which greatly reduces the redundant transitions caused by glitches and effectively reduces power *** paper uses HSPICE to simulate the proposed DETFF and other 10 *** findings show that compared with the other 10 types of DETFFs,the proposed DETFF has achieved large performance indexes in the total power consumption,total power consumption with glitches,delays,and power delay product.A detailed analysis of variance indicates that the proposed DETFF features less sensitivity to process,voltage,temperature,and Negative Bias Temperature Instability(NBTI)-induced aging variations.

关键词： Double-Edge Triggered Flip-Flop(DETFF) glitch low-power C-element

来源：评论

学校读者我要写书评

暂无评论

Enhancing elderly care services through integrated sentiment analysis and knowledge reasoning: A deep learning approach

引用

International Journal of Cognitive Computing in engineering 2025年 6卷 477-494页

作者： Ai, Yongguan Chu, Shiwei Wang, Juan Xu, Nianfang School of Public Administration Anhui Vocational and Technical College Anhui Hefei230011 China School of Electronic Information Engineering Anhui University Hefei230039 China School of Computer and Information Technology Anhui Vocational and Technical College Anhui Hefei230011 China

This study proposes a pioneering integrated care model for elderly care service robots that integrates sentiment analysis and knowledge reasoning through a deep learning framework. The primary objective of this research is to address the limitations of current elderly care robots in providing emotionally intelligent and personalized care. The model utilizes advanced deep learning techniques, such as Long Short-Term Memory (LSTM) networks and Convolutional Neural Networks (CNNs), to analyze multimodal data comprising speech, facial expressions and body language. This enables the model to provide a comprehensive understanding of an elderly individual's emotional and health status. The efficacy of the model is demonstrated by its ability to enhance the precision of care decisions, improve the quality of care, user satisfaction, and system reliability. The experimental results demonstrate substantial improvements in sentiment recognition accuracy (96.5 %), reasoning accuracy (93.7 %), decision execution time (3.2 s), user satisfaction (4.9 points), and system stability (98.4 %), highlighting the transformative potential of the model in revolutionizing elderly care services. © 2025

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

An enhanced AMBTC for color image compression using color palette

引用

Multimedia Tools and Applications 2024年第11期83卷 31783-31803页

作者： Xiong, Lizhi Zhang, Mengtao Yang, Ching-Nung Kim, Cheonshik School of Computer Science Nanjing University of Information Science and Technology Nanjing China Department of Computer Science and Information Engineering National Dong Hwa University Hualien Taiwan Department of Computer Engineering Sejong University Seoul Korea Republic of

Digital image has been used in various fields as an essential carrier. Many color images have been constantly produced since their more realistic description, which takes up much storage space and network bandwidth. Thus, color image compression has become an essential key technology. Absolute Moment Block Truncation Coding (AMBTC) has been widely studied as one of the classical image compression methods. However, in the existing methods, the visual quality of the reconstructed images and the compression rate are all relatively low. Therefore, this paper proposes an enhanced AMBTC for color image compression using a color palette. In the proposed method, the K-means clustering algorithm is utilized for training the image's palette pattern. The color palette obtained by K-mean will be more suitable for reconstructing this image than the standard color palette, and the visual quality will be higher. The six clustered central pixels are matched with the palette through a color difference formula, and the obtained index values are used as the quantization levels. Huffman coding is used to build a bitmap to achieve a higher compression rate, that is, a lower bit rate. At last, a block of a color image can be represented by six index values and a bitmap. Experimental results and theoretical analysis demonstrate that the proposed method has better visual quality and bit rate than similar schemes. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2023.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：