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

58th ACM/IEEE Design Automation Conference (DAC)

作者： Chen, Jianli Chen, Jiarui Shi, Xiao Sun, Lichong Yu, Jun Fudan Univ State Key Lab ASIC & Syst Shanghai 200433 Peoples R China Fuzhou Univ Ctr Discrete Math & Theoret Comp Sci Fuzhou 350108 Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing 210096 Peoples R China HiSilicon Technol Co Ltd Shenzhen 518129 Peoples R China

ISBN: (纸本)9781665432740

A parallel simulation that partitions a large circuit into sub-circuits is widely used to reduce simulation rtmtime. To achieve higher simulation throughput, we shall consider signal directions, and thus the final partitioning solution must he acyclic. In this paper, we model a circuit as a directed graph imd consider acyclic graph partitioning to minimize edge cuts. This problem differs from the traditional partitioning problem because of the additional acyclicity constraint. Unlike traditional heuristics that tend to be trapped in local minima, especially for large graphs, we present a novel discrete dynamic filled function algorithm for the acyclic graph partitioning problem. Our algorithm can guarantee convergence and effectively move from one discrete local minimizer to another better one. Experimental results show that our algorithm achieves 8% average cutsize reduction over the state-of-the-art works in a comparable runtime.

关键词： Runtime Design automation Heuristic algorithms Directed graphs Throughput partitioning algorithms Integrated circuit modeling

来源：评论

学校读者我要写书评

暂无评论

Fast Multi-Type Tree Partition for H.266/VVC Inter Coding

Fast Multi-Type Tree Partition for H.266/VVC Inter Coding

引用

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW)

作者： Ciou, Yi-Sheng Chen, Mei-Juan Yeh, Chia-Hung Lu, Chen-Rung Hsieh, Meng-Chun Lo, Chen Natl Dong Hwa Univ Dept Elect Engn Hualien Taiwan Natl Taiwan Normal Univ Dept Elect Engn Taipei Taiwan Natl Sun Yat Sen Univ Dept Elect Engn Kaohsiung Taiwan

ISBN: (数字)9781665470506

ISBN: (纸本)9781665470506

Versatile Video Coding (H.266/VVC), the latest international video coding standard, effectively encodes ultra-high-definition video. Compared to the quadtree (QT) split of High Efficiency Video Coding (H.265/HEVC), the quadtree with nested multi-type tree (QT-MTT) structure applying binary tree (BT) and ternary tree (TT) coding blocks in H.266/VVC provides various coding unit (CU) partitions. The functionality improves the compression performance but greatly increases encoding complexity. Therefore, the acceleration of encoding is an essential issue. In this paper, the image feature extracted by edge detection is utilized to make fast decisions about the TT split and direction in the MTT structure of CU. Moreover, the maximum partition depth of the coding tree unit is predicted from the reference frames for the early termination of the encoding process. Experimental results demonstrate that the coding time of the proposed algorithm is reduced while the bitrate is well-maintained under random access configuration. The proposed method significantly outperforms the previous work.

关键词： Image coding Correlation Image edge detection Prediction algorithms Feature extraction Encoding partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

On Coverage Control for Limited Range Multi-Robot Systems

On Coverage Control for Limited Range Multi-Robot Systems

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Pratissoli, Federico Capelli, Beatrice Sabattini, Lorenzo Univ Modena & Reggio Emilia Dept Sci & Methods Engn DISMI Modena Italy

ISBN: (数字)9781665479271

ISBN: (纸本)9781665479271

This paper presents a coverage based control algorithm to coordinate a group of autonomous robots. Most of the solutions presented in the literature rely on an exact Voronoi partitioning, whose computation requires complete knowledge of the environment to be covered. This can be achieved only by robots with unlimited sensing capabilities, or through communication among robots in a limited sensing scenario. To overcome these limitations, we present a distributed control strategy to cover an unknown environment with a group of robots with limited sensing capabilities and in the absence of reliable communication. The control law is based on a limited Voronoi partitioning of the sensing area, and we demonstrate that the group of robots can optimally cover the environment using only information that is locally detected (without communication). The proposed method is validated by means of simulations and experiments carried out on a group of mobile robots.

关键词： Robot kinematics Decentralized control Robot sensing systems Sensors partitioning algorithms Reliability Multi-robot systems

来源：评论

学校读者我要写书评

暂无评论

MPDA: Multivariate Probability Distribution Autoencoder for Hyperspectral Anomaly Detection

引用

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 2024年 62卷

作者： Mu, Zhenhua Wang, Yihan Zhang, Yating Song, Chuanming Wang, Xianghai Liaoning Normal Univ Sch Geog Dalian 116029 Peoples R China Liaoning Normal Univ Sch Comp Sci & Artificial Intelligence Dalian 116029 Peoples R China Dalian Univ Sch Informat Engn Dalian 116622 Peoples R China

In recent years, the significant success of deep learning (DL) in computer vision has contributed to its continuous development in the field of hyperspectral image (HSI) anomaly detection (AD). However, in practical applications, HSI-AD based on DL faces many challenges due to the inability to effectively acquire training samples and predict the types of anomaly targets. This makes it a challenging task, especially for AD in complex scenes. In this article, we propose an unsupervised DL framework for HSI-AD based on the multivariate probability distribution autoencoder (MPDA). First, to explore the distribution characteristics of high-dimensional data, we use the probability density histogram to statistically distribute the frequencies of each interval adaptively, dividing the HSI and obtaining an AD-guided image through the designed grid structure. Second, we propose an unsupervised multilayer autoencoder network based on energy-weighted skip connections. By coupling the detection-guided image in the network, we achieve reverse-guided module reconstruction, weakening the feature representation of anomalous in the reconstructed information and enhancing the separability of targets. Finally, we model the reconstructed error images using the multivariate skewed t-distribution based on data distribution characteristics to obtain the final AD map. Through the comparative experiments with other innovative AD algorithms on authentic HSI datasets captured in five different scenarios, the proposed algorithm demonstrates strong generalization and detection capabilities. The source code of the MPDA will be public at https://***/muzhenhuam/MPDA/tree/master.

关键词： Image reconstruction Probability distribution Probability Feature extraction Detectors partitioning algorithms Nonhomogeneous media Histograms Gaussian distribution Anomaly detection Anomaly detection (AD) autoencoder hyperspectral image (HSI) probability density distribution skewed distribution unsupervised deep learning (DL)

来源：评论

学校读者我要写书评

暂无评论

Parallelized Technology Mapping to General PLBs by Adaptive Circuit partitioning 20

Parallelized Technology Mapping to General PLBs by Adaptive ...

引用

20th International Conference on Field-Programmable Technology (ICFPT)

作者： Wang, Xiaoxi Yang, Moucheng Li, Zhen Wang, Lingli Fudan Univ State Key Lab ASIC & Syst Shanghai Peoples R China

ISBN: (纸本)9781665420105

Technology mapping from logic netlists to programmable logic blocks (PLB) plays an important role in FPGA EDA flow, especially for architecture exploration of PLBs. However, technology mapping becomes time-consuming due to the booming scale and complexity of IC designs as well as the growing complexity of PLB architectures. To speed up this process, a parallelized technology mapping approach based on adaptive circuit partitioning is proposed in this paper to perform fast multi-thread technology mapping. First, We choose the best of the three candidate partitioning strategies for the given netlist by circuit analysis to partition the original netlist into several independent sub-netlists. Secondly, these sub-netlists are mapped to the given PLB architecture simultaneously in their corresponding mapping threads. Finally, the complete mapped netlist is generated by merging the mapped sub-netlists. The proposed approach is implemented in ABC, independent of the detailed mapping algorithm. 13 large circuits from the Titan23 benchmark set are used as benchmarks to evaluate the proposed approach. Experimental results show that the proposed approach leads to an average of 5.76x speedup over the single-thread version (up to 8.21x individually) with no delay loss and less than 0.57% average area penalty.

关键词： Instruction sets Merging Decision making Benchmark testing Delays Complexity theory partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

LLM-shark - A Tool for Automatic Resource-boundness Analysis and Cache partitioning Setup 45

LLM-shark - A Tool for Automatic Resource-boundness Analysis...

引用

45th Annual International IEEE-Computer-Society Computers, Software, and Applications Conference (COMPSAC)

作者： Danielsson, Jakob Seceleanu, Tiberiu Jagemar, Marcus Behnam, Moris Sjodin, Mikael Malardalen Univ Vasteras Sweden Ericsson AB Stockholm Sweden

ISBN: (纸本)9781665424639

We present LLM-shark, a tool for automatic hardware resource-boundness detection and cache-partitioning. Our tool has three primary objectives: First, it determines the hardware resource-boundness of a given application. Secondly, it estimates the initial cache partition size to ensure that the application performance is conserved and not affected by other processes competing for cache utilization. Thirdly, it continuously monitors that the application performance is maintained over time and, if necessary, change the cache partition size. We demonstrate LLM-shark's functionality through a series of tests using six different applications, including a set of feature detection algorithms and two synthetic applications. Our tests reveal that it is possible to determine an application's resource-boundness using a Pearson-correlation scheme implemented in LLM-shark. We propose a scheme to size cache partitions based on the correlation coefficient applications depending on their resource boundness.

关键词： Correlation coefficient Feature detection Conferences Tools Hardware Software partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

WSGP: A Window-based Streaming Graph partitioning Approach 21

WSGP: A Window-based Streaming Graph Partitioning Approach

引用

21st IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing (CCGrid)

作者： Li, Yunbo Li, Chuanyou Orgerie, Anne-Cecile Parvedy, Philippe Raipin Shanghai Pudong Dev Bank Shanghai Peoples R China Southeast Univ Nanjing Peoples R China Univ Rennes IRISA CNRS INRIA Rennes France Orange Labs Lannion France

ISBN: (纸本)9781728195865

Graph partitioning, a preliminary step of distributed graph processing, has been attracting increasing attention in the last decade. A high quality graph partitioning algorithm should facilitate graph processing by minimizing the communication overhead and maintaining the load balancing among distributed computing units. Offline partitioning algorithms usually require the knowledge of a complete graph,and therefore, are not adaptive to handle massive graph-structured data. On the contrary, streaming partitioning algorithms take edges or vertices as a stream and make partitioning decisions on the fly. However, the streaming manner faces dilemmas from time to time because of a lack of knowledge. Furthermore, an unmindful partitioning decision in such a dilemma could significantly decrease the partition quality. In this paper, we propose a novel window-based streaming graph partitioning algorithm (WSGP). WSGP leverages a greedy-based heuristic to perform edge partitioning. When facing a decision dilemma, WSGP utilizes a size-bounded window to buffer the edges. When the window is fully filled, an edge is poped and assigned to a partition. The assignment is decided by knowledge obtained from both the edges already settled and the ones still cached in the buffer window. Our experiments take into account various real-world benchmark graphs. The experimental results demonstrate that WSGP consistently has a smaller replication factor than the state-of-the-art algorithms by up to 23%, at a limited cost in terms of memory and comprehensive running time.

关键词： Cloud computing Clustering algorithms Benchmark testing Load management partitioning algorithms Faces

来源：评论

学校读者我要写书评

暂无评论

Automatic Quality of Service Control in Multi-core Systems using Cache partitioning 26

Automatic Quality of Service Control in Multi-core Systems u...

引用

26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Danielsson, Jakob Seceleanu, Tiberiu Jagemar, Marcus Behnam, Moris Sjodin, Mikael Malardalen Univ Vasteras Sweden Ericsson AB Stockholm Sweden

ISBN: (纸本)9781728129891

In this paper, we present a last-level cache partitioning controller for multi-core systems. Our objective is to control the Quality of Service (QoS) of applications in multi-core systems by monitoring run-time performance and continuously re-sizing cache partition sizes according to the applications' needs. We discuss two different use-cases;one that promotes application fairness and another one that prioritizes applications according to the system engineers' desired execution behavior. We display the performance drawbacks of maintaining a fair schedule for all system tasks and its performance implications for system applications. We, therefore, implement a second control algorithm that enforces cache partition assignments according to user-defined priorities rather than system fairness. Our experiments reveal that it is possible, with non-instrusive (0.3-0.7% CPU utilization) cache controlling measures, to increase performance according to setpoints and maintain the QoS for specific applications in an over-saturated system.

关键词： Schedules Conferences Quality of service Control systems partitioning algorithms Task analysis Monitoring

来源：评论

学校读者我要写书评

暂无评论

A Submodular Optimization Approach to Stable and Minimally Disruptive Controlled Islanding in Power Systems

A Submodular Optimization Approach to Stable and Minimally D...

引用

American Control Conference (ACC)

作者： Sahabandu, Dinuka Niu, Luyao Clark, Andrew Poovendran, Radha Univ Washington Dept Elect & Comp Engn Network Secur Lab Seattle WA 98195 USA Worcester Polytech Inst Dept Elect & Comp Engn Worcester MA 01609 USA

ISBN: (数字)9781665451963

ISBN: (纸本)9781665451963

Power systems must maintain dynamical stability while meeting user demand in the presence of major disturbances including failures of multiple generators and transmission lines. One approach to mitigating disturbances is controlled islanding, in which a subset of edges is deliberately removed in order to partition the network into disjoint, internally stable and self-sufficient islands. In this paper, we present a submodular optimization approach to controlled islanding. We prove that computing optimal islands under three standard metrics, namely, generator coherence, load-generation imbalance, and power flow disruption, is equivalent to minimizing a supermodular function with a matroid basis constraint. Based on this result, we present the first polynomial-time islanding algorithms with constant-factor optimality bounds with respect to the three aforementioned metrics. We test the proposed approach on IEEE 30-bus, 57-bus, and 118-bus power systems. We demonstrate that our proposed algorithm converges and present the islanding strategies when different combinations of the metrics are considered.

关键词： Measurement Islanding Power transmission lines Coherence Power system stability Generators partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Provenance-aware Discovery of Functional Dependencies on Integrated Views 38

Provenance-aware Discovery of Functional Dependencies on Int...

引用

38th IEEE International Conference on Data Engineering (ICDE)

作者： Comignani, Ugo Berti-Equille, Laure Novelli, Noel Bonifati, Angela INRIA Grenoble INP Tyrex Team Le Chesnay Rocquencourt France IRD ESPACE DEV Montpellier France Aix Marseille Univ LIS CNRS Marseille France Lyon 1 Univ Lyon France

ISBN: (纸本)9781665408837

The automatic discovery of functional dependencies (FDs) has been widely studied as one of the hardest problems in data profiling. Existing approaches have focused on making the FD computation efficient while inspecting single relations at a time. In this paper, for the first time we address the problem of inferring FDs for multiple relations as they occur in integrated views by solely using the functional dependencies of the base relations of the view itself. To this purpose, we leverage logical inference and selective mining and show that we can discover most of the exact FDs from the base relations and avoid the full computation of the FDs for the integrated view itself, while at the same time preserving the lineage of FDs of base relations. We propose algorithms to speedup the inferred FD discovery process and mine FDs on-the-fly only from necessary data partitions. We present InFine (INferred FunctIoNal dEpendency), an end-to-end solution to discover inferred FDs on integrated views by leveraging provenance information of base relations. Our experiments on a range of real-world and synthetic datasets demonstrate the benefits of our method over existing FD discovery methods that need to rerun the discovery process on the view from scratch and cannot exploit lineage information on the FDs. We show that InFine outperforms traditional methods necessitating the full integrated view computation by one to two order of magnitude in terms of runtime. It is also the most memory efficient method while preserving FD provenance information using mainly inference from base table with negligible execution time.

关键词： Runtime Conferences Memory management Data engineering Inference algorithms partitioning algorithms Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：