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

Utilization-Aware Data Variable Allocation on NVM- Based SPM in Real-Time Embedded Systems

Journal of Electronic Science and Technology 2021年第2期19卷 163-172页

作者： Jin-Yu Zhan Yi-Xin Li Wei Jiang Jun-Huan Yang School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054 State Key Lab of Mathematical Engineering and Advanced Computing Wuxi 214000

With the development of the nonvolatile memory(NVM),using NVM in the design of the cache and scratchpad memory(SPM)has been *** paper presents a data variable allocation(DVA)algorithm based on the genetic algorithm for NVM-based SPM to prolong the *** lifetime can be formulated indirectly as the write counts on each SPM *** the differences between global variables and stack variables,our optimization model has three *** constraints of the central processing unit(CPU)utilization and size are used for all variables,while no-overlay constraint is only used for stack *** satisfy the constraints of the optimization model,we use the greedy strategy to generate the initial population which can determine whether data variables are allocated to SPM and distribute them evenly on SPM ***,we use the Mälardalen worst case executive time(WCET)benchmark to evaluate our *** experimental results show that the DVA algorithm can not only obtain close-to-optimal solutions,but also prolong the lifetime by 9.17% on average compared with SRAM-based SPM.

关键词： Data variables allocation genetic algorithm nonvolatile momory(NVM) scratchpad memory(SPM)

来源：评论

学校读者我要写书评

暂无评论

Bi-population genetic algorithm-based attack path discovery research in large-scale networks 4

Bi-population genetic algorithm-based attack path discovery ...

引用

4th World Conference on computing and Communication Technologies, WCCCT 2021

作者： Tairan, Hu Wenlong, Gao Tianyang, Zhou Yichao, Zang National Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9780738144986

with the growth of network scale, present researches on the attack path discovery often encounter the problem of search space explosion that results in fails. To tackle the problem of attack path discovery for large-scale networks, this paper proposes a bi-population genetic algorithm for the attack path discovery in large-scale networks. Firstly, this paper represents the connective relationship between hosts as vectors and uses the Balanced Iterative Reducing and Clustering Using Hierarchies (Birch) algorithm to realize network decomposition. Then, the attack path discovery problem is encoded based on the decomposition result, and the bi-population mechanism is introduced to find the attack path. The experiment result shows that our algorithm performs better than Metric-FF and SGA in optimization and efficiency. © 2021 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal scheme for dynamic adjustment of active mirror in FAST system 2021

Optimal scheme for dynamic adjustment of active mirror in FA...

引用

2021 5th International Conference on Computer Science and Artificial Intelligence

作者： Hongchuan Zhou Jiaqi Liu Junyan Song Benchao Yang State Key Laboratory of Mathematical Engineering and advanced computing China

ISBN: (纸本)9781450384155

This paper mainly studies the optimal scheme of dynamic adjustment of active mirror in FAST system by establishing mathematical model. According to the constraints such as distance variation range, a mathematical model describing the dynamic trajectory of the position and angle of the active mirror is established, and the correctness of the solution of the model is verified by simulation. The optimal surface model is selected from all the results. When the measured object is directly above the fast system, it is modeled based on the ideal parabola to ensure that the expansion constraints and threshold conditions of the actuator are met. Because the distribution of actuator and cable in the whole fast system is not a uniform sphere, the change of radial distance of cable can be considered as the expansion of actuator; In addition, the model is optimized from two aspects: adjusting the position of focus on the horizontal plane and changing the size of zoom alignment. From these two aspects, the parabolic focusing range satisfying the expansion range is obtained. Finally, the optimization strategy of dynamic adjustment of active mirror in fast system is given.

关键词： Dimension reduction to simplify mathematical modeling Optimization model

来源：评论

学校读者我要写书评

暂无评论

ThickV-Stain: Unprocessed Thick Tissues Virtual Staining for Rapid Intraoperative Histology 7

ThickV-Stain: Unprocessed Thick Tissues Virtual Staining for...

引用

7th International Conference on Medical Imaging with Deep Learning, MIDL 2024

作者： Shi, Lulin Hou, Xingzhong Wong, Ivy H.M. Chan, Simon C.K. Chen, Zhenghui Lo, Claudia T.K. Wong, Terence T.W. Translational and Advanced Bioimaging Laboratory Department of Chemical and Biological Engineering The Hong Kong University of Science and Technology Hong Kong State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

Virtual staining has shown great promise in realizing a rapid and low-cost clinical alternative for pathological examinations, eliminating the need for chemical reagents and laborious staining procedures. However, most of the previous studies mainly focus on thin slice samples, which still require tissue sectioning and are unsuitable for intraoperative use. In this paper, we propose a multi-scale model to virtually stain label-free and slide-free biological tissues, allowing hematoxylin- and eosin- (H&E) staining generation in less than a minute for an image with 100 million pixels. We name this ThickV-Stain model, specifically developed to virtually stain intricated and unprocessed thick tissues. We harness the ability of a multi-scale network to encourage the model to capture multiple-level micromorphological characteristics from low-resolution images. Experimental results highlight the advantages of our method for virtual staining on unprocessed thick samples. We also show the effectiveness of ThickV-Stain on thin sections, showing generalizability to other clinical workflows. The proposed method enables us to obtain virtually stained images from unstained samples within minutes and can be seamlessly integrated with downstream pathological analysis tasks, providing an efficient alternative scheme for intraoperative assessment as well as general pathological examination. © 2024 CC-BY 4.0, L. Shi, X. Hou, I.H.M. Wong, S.C.K. Chan, Z. Chen, C.T.K. Lo & T.T.W. Wong.

关键词： Tissue

来源：评论

学校读者我要写书评

暂无评论

A Survey on Knowledge Graph Representation Learning with Text Information 21

A Survey on Knowledge Graph Representation Learning with Tex...

引用

Proceedings of the 3rd World Symposium on Software engineering

作者： Ling Wang Jicang Lu Gang Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing China

ISBN: (纸本)9781450384094

Knowledge graph representation learning provides a lot of help for subsequent tasks such as knowledge graph completion, information retrieval, and intelligent question answering. By representing the knowledge graph as low-dimensional dense vectors, these tasks can improve efficiency significantly. However, limited by the sparseness and huge scale of the actual structure, representation learning only from a structural perspective can no longer meet the research *** improve the performance, researchers introduced auxiliary information into representation learning. This paper focuses on models using text as auxiliary information, dividing all text-combined models into two categories: Closed-world assumption models and Open-world assumption models. The former is limited by the model's demand for the structural representation of the graph itself, and can only predict the entities and relationships that already exist in the knowledge graph. The latter can handle entities that have not previously been seen during model training, and connect brand-new entities to the knowledge graph, which is more in line with the dynamic trend of the knowledge graph in real world. Open-world assumption models can be further subdivided into multiple types according different joint functions, such as alignment function, fusion function, score function and transformation function. This paper summarizes existing methods in detail and looks forward to future possible research directions.

关键词： Open-world assumption Representation learning Knowledge graph Text information

来源：评论

学校读者我要写书评

暂无评论

Edge-Driven Industrial computing Power Networks: Digital Twin-Empowered Service Provisioning by Hybrid Soft Actor-Critic

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8095-8109页

作者： Zhang, Long Song, Deng-Ao Zhang, Hongliang Tian, Ni Zhuang, Zirui Niyato, Dusit Han, Zhu Hebei University of Engineering School of Information and Electrical Engineering Handan056038 China Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Beijing100871 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Nanyang Technological University College of Computing and Data Science 639798 Singapore University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

With the proliferation of data-intensive industrial applications, the collaboration of computing powers among standalone edge servers is vital to provision such services for smart devices. In this paper, we propose an edge-driven industrial computing power network (CPN) by orchestrating the computing and network resources of edge servers through the centralized resource scheduling and decentralized task computing. However, efficient task offloading and collaborative processing is challenging, which requires higher degrees of network automation and intelligence. Therefore, we incorporate digital twins (DTs) into the edge-driven CPN architecture, where the DTs are created as the digital replicas to assist both the computation offloading and collaborative processing. A joint optimization problem of the computing power assignment, service association, task partition, and transmit power control is formulated for maximizing the system average weighted utility. Due to the temporal-spatial variability of tasks and the resulted dynamic environment, we transform the original problem as a Markov decision process aiming at maximizing the long-term average weighted utility. To efficiently handle the high-dimensional discrete-continuous action space, a hybrid soft actor-critic based deep reinforcement learning algorithm is developed for optimizing the joint design. Simulation results validate the superiority of our proposed algorithm over the benchmarks, showing the significant gains obtained by integrating DTs into the edge-driven CPN. © 1967-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Software Vulnerability Mining Techniques Based on Data Fusion and Reverse engineering

引用

Wireless Communications and Mobile computing 2022年第0期2022卷

作者： Liu, Tieming State Key Laboratory of Mathematical Engineering and Advanced Computing Henan Zhengzhou450001 China

Software vulnerability mining is an important component of network attack and defense technology. To address the problems of high leakage rate and false positive rate of existing static analysis methods, this paper proposes a static analysis vulnerability detection technique based on data fusion for source code. By parsing the analysis results of different detection methods and fusing the data, the technique can effectively reduce the false positive rate and the false positive rate. A prototype of a scalable source code static analysis tool is designed and implemented, which can be automatically optimized by user feedback. Finally, an example is given to demonstrate how to uncover buffer overflow software vulnerabilities in the helpctr program based on reverse engineering techniques. The experimental results show that the false positive and false negative rates are significantly reduced compared to individual vulnerability detection methods. © 2022 Tieming Liu.

关键词： Data fusion

来源：评论

学校读者我要写书评

暂无评论

DSSA: Dual-Side Sparse Systolic Array Architecture for Accelerating Convolutional Neural Network Training 22

DSSA: Dual-Side Sparse Systolic Array Architecture for Accel...

引用

Proceedings of the 51st International Conference on Parallel Processing

作者： Zhengbo Chen Qi Yu Fang Zheng Feng Guo Zuoning Chen Information Engineering University China State Key Laboratory of Mathematical Engineering and Advanced Computing China Chinese Academy of Engineering China

ISBN: (纸本)9781450397339

Ever-growing CNN size incurs a significant amount of redundancy in model parameters, which in turn, puts considerable burden on hardware. Unstructured pruning is widely used to reduce model sparsity. While, the irregularity introduced by unstructured pruning makes it difficult to accelerate sparse CNNs on systolic array. To address this issue, a variety of accelerators have been proposed. SIGMA, the state-of-the-art sparse GEMM accelerator, achieves significant speedup over systolic array. However, SIGMA suffers from two disadvantages: 1) it only supports one-side sparsity, leaving potential for further performance gains; 2) SIGMA improves utilization of large-sized systolic arrays at the cost of extra overhead. In this paper, we propose DSSA, a dual-side sparse systolic array, to accelerate CNN training. DSSA bases its designs on a small-sized systolic array, which naturally achieves higher cell utilization without additional overhead. To facilitate dual-side sparsity processing, DSSA utilizes a cross-cycle reduction module to accumulate partial sum that belongs to the same column but being processed in different cycles. A comprehensive design space exploration is performed to seek the local optimal configurations for DSSA. We implement the logic design of DSSA using Verilog in RTL and evaluate its performance using a C++-based cycle-accurate performance simulator we built. Experimental results show that DSSA delivers, on average, a speedup of 2.13x and 13.81x over SIGMA and a basic systolic array with the same number of cells. Compared to SIGMA, DSSA incurs 16.59% area overhead and 25.49% power overhead when sparse filter is excluded, as SIGMA did.

关键词： Convolutional Neural Network Hardware Accelerator Sparsity Processing Systolic Array Unstructured Pruning

来源：评论

学校读者我要写书评

暂无评论

Coarse-to-Fine Proposal Refinement Framework for Audio Temporal Forgery Detection and Localization 24

Coarse-to-Fine Proposal Refinement Framework for Audio Tempo...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wu, Junyan Lu, Wei Luo, Xiangyang Yang, Rui Wang, Qian Cao, Xiaochun School of Computer Science and Engineering Sun Yat-sen University Guangzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Alibaba Group Hangzhou China School of Cyber Science and Engineering Wuhan University Wuhan China School of Cyber Science and Technology Sun Yat-sen University Shenzhen Campus Shenzhen China

ISBN: (纸本)9798400706868

Recently, a novel form of audio partial forgery has posed challenges to its forensics, requiring advanced countermeasures to detect subtle forgery manipulations within long-duration audio. However, existing countermeasures still serve a classification purpose and fail to perform meaningful analysis of the start and end timestamps of partial forgery segments. To address this challenge, we introduce a novel coarse-to-fine proposal refinement framework (CFPRF) that incorporates a frame-level detection network (FDN) and a proposal refinement network (PRN) for audio temporal forgery detection and localization. Specifically, the FDN aims to mine informative inconsistency cues between real and fake frames to obtain discriminative features that are beneficial for roughly indicating forgery regions. The PRN is responsible for predicting confidence scores and regression offsets to refine the coarse-grained proposals derived from the FDN. To learn robust discriminative features, we devise a difference-aware feature learning (DAFL) module guided by contrastive representation learning to enlarge the sensitive differences between different frames induced by minor manipulations. We further design a boundary-aware feature enhancement (BAFE) module to capture the contextual information of multiple transition boundaries and guide the interaction between boundary information and temporal features via a cross-attention mechanism. Extensive experiments show that our CFPRF achieves state-of-the-art performance on various datasets, including LAV-DF, ASVS2019PS, and HAD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Pixel+ and Pixel++: compact and efficient forward-secure multi-signatures for PoS blockchain consensus 24

Pixel+ and Pixel++: compact and efficient forward-secure mul...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Jianghong Wei Guohua Tian Ding Wang Fuchun Guo Willy Susilo Xiaofeng Chen State Key Laboratory of Integrated Service Networks (ISN) Xidian University and State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Integrated Service Networks (ISN) Xidian University College of Cyber Science Nankai University School of Computing and Information Technology University of Wollongong

ISBN: (纸本)9781939133441

Multi-signature schemes have attracted considerable attention in recent years due to their popular applications in PoS blockchains. However, the use of general multi-signature schemes poses a critical threat to the security of PoS blockchains once signing keys get corrupted. That is, after an adversary obtains enough signing keys, it can break the immutable nature of PoS blockchains by forking the chain and modifying the history from some point in the past. Forward-secure multi-signature (FS-MS) schemes can overcome this issue by periodically updating signing keys. The only FS-MS construction currently available is Drijvers et al's Pixel, which builds on pairing groups and only achieves forward security at the time period *** this work, we present new FS-MS constructions that either are free from pairing or capture forward security at the individual message level (i.e., fine-grained forward security). Our first construction Pixel+ works for a maximum number of time periods T. Pixel+ signatures consist of only one group element, and can be verified using two exponentiations. It is the first FS-MS from RSA assumption, and has 3.5x and 22.8x faster signing and verification than Pixel, respectively. Our second FS-MS construction Pixel++ is a pairing-based one. It immediately revokes the signing key's capacity of re-signing the message after creating a signature on this message, rather than at the end of the current time period. Thus, it provides more practical forward security than Pixel. On the other hand, Pixel++ is almost as efficient as Pixel in terms of signing and verification. Both Pixel+ and Pixel++ allow for non-interactive aggregation of signatures from independent signers and are proven to be secure in the random oracle model. In addition, they also support the aggregation of public keys, significantly reducing the storage overhead on PoS *** demonstrate how to integrate Pixel+ and Pixel++ into PoS blockchains. As a proof-of-concept, we provid

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：