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

An efficient load balancing mechanism in distributed virtual environments

ETRI JOURNAL 2008年第4期30卷 618-620页

作者： Jang, Su Min Yoo, Jae Soo Chungbuk Natl Univ Dept Comp & Commun Engn Cheongju South Korea

A distributed virtual environment (DVE) allows multiple geographically distributed objects to interact concurrently in a shared virtual space. Most DVE applications use a non-replicated server architecture, which dynamically partitions a virtual space. An important issue in this system is effective scalability as the number of users increases. However it is hard to provide suitable load balancing because of the unpredictable movements of users and hot-spot locations. Therefore, we propose a mechanism for sharing roles and separating service regions. The proposed mechanism reduces unnecessary partitions of short duration and supports efficient load balancing.

关键词： distributed virtual environments load balancing partitioning algorithm scalability issue

来源：评论

学校读者我要写书评

暂无评论

The refinement-tree partition for parallel solution of partial differential equations

引用

JOURNAL OF RESEARCH OF THE NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY 1998年第4期103卷 405-414页

作者： Mitchell, WF Natl Inst Stand & Technol Gaithersburg MD 20899 USA

Dynamic load balancing is considered in the context of adaptive multilevel methods for partial differential equations on distributed memory multiprocessors. An approach that periodically repartitions the grid is taken. The important properties of a partitioning algorithm are presented and discussed in this context. A partitioning algorithm based on the refinement tree of the adaptive grid is presented and analyzed in terms of these properties. Theoretical and numerical results are given.

关键词： partitioning algorithm partial differential equations refinement tree partitions

来源：评论

学校读者我要写书评

暂无评论

Architectural Leakage Power Minimization of Scratchpad Memories by Application-Driven Subbanking

引用

IEEE TRANSACTIONS ON COMPUTERS 2010年第7期59卷 891-904页

作者： Loghi, Mirko Golubeva, Olga Macii, Enrico Poncino, Massimo Politecn Torino Dipartimento Automat & Informat I-10129 Turin Italy

partitioning a memory into multiple blocks that can be independently accessed is a widely used technique to reduce its dynamic power. For embedded systems, its benefits can be even pushed further by properly matching the partition to the memory access patterns. When leakage energy comes into play, however, idle memory blocks must be put into a proper low-leakage sleep state to actually save energy when not accessed. In this case, the matching becomes an instance of the power management problem, because moving to and from this sleep state requires additional energy. In this work, we propose an effective solution to the problem of the leakage-aware partitioning of a memory into disjoint subblocks;in particular, we target scratchpad memories, which are commonly used in some embedded systems as a replacement for caches. We show that, although the solution space is extremely large (for a N-block partition, all the combinations of N - 1 address boundaries) and nonconvex, it is possible to prove a nontrivial property that considerably reduces the number of partition boundaries to be enumerated, therefore, making exhaustive exploration feasible. We are thus able to provide an optimal solution to the leakage-aware partitioning problem. Experiments on a different sets of embedded applications have shown that total energy savings larger than 60 percent on average can be obtained, with a marginal overhead in execution time, thanks to an effective implementation of the low-leakage sleep state.

关键词： Power optimization leakage power embedded design memory hierarchy scratchpad memory partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

Influence Propagation Model for Clique-Based Community Detection in Social Networks

引用

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2018年第2期5卷 563-575页

作者： Alduaiji, Noha Datta, Amitava Li, Jianxin Univ Western Australia Dept Comp Sci & Software Engn Perth WA 6009 Australia Majmaah Univ Coll Sci & Humanities Rumaah Al Majmaah 11952 Saudi Arabia

Social media community detection is a fundamental challenge in social data analytics, in order to understand user relationships and improve social recommendations. Although the problem has been extensively investigated, the majority of research has been based on social networks with static structures. Our findings within large social networks, such as Twitter, show that only a few users have interactions or communications at fixed time intervals. Finding active communities that demonstrate constant interactions between its members comprises a reasonable perspective. Communities examined from this perspective will provide time-variant social relationships, which may greatly improve the applicability of social data analytics. In this paper, we address the problem of temporal interaction-biased community detection using a four-step process. First, we develop a partition approach using an objective function based on clique structure, to enhance the time efficiency of our methodology. Second, we develop an influence propagation model that gives greatest weight to active edges or to inactive edges in close proximity to active edges. Third, we develop expansiondriven algorithms to efficiently find the activity-biased densest community. Finally, we verify the effectiveness of the extended community metric and the efficiency of the algorithms using three real data sets and a case study conducted on Twitter dynamic data set.

关键词： Community detection influence propagation model partitioning algorithm social network analysis temporal interactions

来源：评论

学校读者我要写书评

暂无评论

EXAMPLE COMPUTER LOGIC GRAPH AND ITS PARTITIONS AND MAPPINGS

引用

IEEE TRANSACTIONS ON COMPUTERS 1974年第11期C 23卷 1198-1204页

作者： MENNONE, A RUSSO, RL IBM THOMAS J WATSON RES CTRYORKTOWN HEIGHTSNY 10598

The purpose of this correspondence is to provide an example computer logic graph and data concerning various partitions and mappings of this graph. This information should be of particular interest to those workers who are developing partitioning and mapping algorithms, since it provides a means to test and compare alternative methods. It should also be of use to those interested in other algorithms (e.g., placement, diagramming, grouping, etc.) for logic graphs.

关键词： Computer Aided Design Computer Based Design Computer Logic Graph Design Automation Heuristic algorithm Logic Mapping Logic partitioning Logic Segmentation Mapping algorithm partitioning algorithm Segmentation algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal FPGA memory allocation for image processing

引用

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2023年第4期23卷 1801-1814页

作者： Bao, Bengang Liang, Xiaoling Hunan Univ Sci & Engn Coll Intelligent Mfg Yongzhou 425199 Hunan Peoples R China

In the field of computer vision, Field Programmable Gate Array (FGPA) limited de on-chip memory is difficult to meet the power, size and other requirements. To address this phenomenon, the study constructs a partitioning algorithm to achieve a balance between energy consumption and resource utilisation based on the analysis of memory resource allocation, overall power consumption and resource utilisation from the perspective of image processing technology. The power consumption of the balancing algorithm is lower compared to the optimised utilisation algorithm HLS tool, with both Block Ramdom Access Memory (BRAM) power consumption taking the value of 0.005;the dynamic power consumption takes the value range of 0.014-0.082. Compared to the High Level Synthesis (HLS) tool, the overall power consumption of the balancing algorithm and the optimised utilisation algorithm is significantly lower, with the values of 0.251 and 0.252 respectively, both with a reduction rate of approximately 30%. The accuracy rate of the proposed memory optimisation allocation algorithm is the highest among the four memory optimisation allocation algorithms and strategies on all three types of target scales. FPGA memory optimisation allocation strategy can guarantee to have lower power consumption while satisfying the same resource occupancy, and the model has in-depth application value in visual image vision technology.

关键词： FPGA CLAHE image CAMShift partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimized Rate Control algorithm in Versatile Video Coding for 360° Videos

引用

IEEE SIGNAL PROCESSING LETTERS 2022年 29卷 2303-2307页

作者： Zhao, Zeming He, Xiaohai Xiong, Shuhua He, Liqiang Sheriff, Raymond Edward Sichuan Univ Coll Elect & Informat Engn Chengdu 610065 Peoples R China Edge Hill Univ Dept Comp Sci Ormskirk Lancs England

Today, 360 degrees video has become an integral part of people's lives. Despite the fact that the latest generation standard Versatile Video Coding (VVC) demonstrates a significant gain in encoding capacity over High Efficiency Video Coding (HEVC), it still has room for 360 degrees video encoding improvements. To further enhance the applicability of 360 degrees video coding, an optimized rate control (RC) algorithm in VVC for 360 degrees video is proposed in this paper. We present an efficient extraction algorithm for obtaining the video's saliency feature. Furthermore, for the characteristics of 360 degrees video, a partitioning algorithm is also proposed to divide a frame into demand and non-demand regions. Additionally, to achieve precise and rational RC, a Coding Tree Unit (CTU)-level bit allocation strategy is proposed based on the saliency feature for the above-mentioned regions. The experimental results show that the proposed RC algorithm can achieve 11.77% bitrate savings and more accurate allocation compared with the default algorithm of VVC. Also, performance enhancement has been observed in comparison to the most advanced algorithm.

关键词： 360 degrees video partitioning algorithm rate control saliency feature versatile video coding

来源：评论

学校读者我要写书评

暂无评论

MULTIpartitioning OF POWER-SYSTEM STATE ESTIMATION NETWORKS USING SIMULATED ANNEALING

引用

ELECTRIC POWER SYSTEMS RESEARCH 1995年第2期34卷 117-120页

作者： HABIBALLAH, IO IRVING, MR [a] King Fahd University of Petroleum and Minerals Dhahran 31261 Saudi Arabia [b] Brunel University Uxbridge Middx. UB8 3PH UK

This paper presents the development of an algorithm to multipartition an observable power system state estimation (PSSE) network into two or more observable subnetworks. The partitioning algorithm is based on using the simulated annealing principle which has a theoretical basis in combinatorial optimization, rather than a heuristic derivation. Computational examples, using several power networks, are given to illustrate the properties of the proposed algorithm.

关键词： STATE ESTIMATION NETWORKS partitioning algorithm SIMULATED ANNEALING

来源：评论

学校读者我要写书评

暂无评论

From honeybees to robots and back: division of labour based on partitioning social inhibition

引用

BIOINSPIRATION & BIOMIMETICS 2015年第6期10卷 066005-066005页

作者： Zahadat, Payam Hahshold, Sibylle Thenius, Ronald Crailsheim, Karl Schmickl, Thomas Karl Franzens Univ Graz Dept Zool Artificial Life Lab A-8010 Graz Austria

In this paper, a distributed adaptive partitioning algorithm inspired by division of labor in honeybees is investigated for its applicability in a swarm of underwater robots in one hand and is qualitatively compared with the behavior of honeybee colonies on the other hand. The algorithm, partitioning social inhibition (PSI), is based on local interactions and uses a simple logic inspired from age-polyethism and task allocation in honeybee colonies. The algorithm is analyzed in simulation and is successfully applied here to partition a swarm of underwater robots into groups demonstrating its adaptivity to changes and applicability in real world systems. In a turn towards the inspiration origins of the algorithm, three honeybee colonies are then studied for age-polyethism behaviors and the results are contrasted with a simulated swarm running the PSI algorithm. Similar effects are detected in both the biological and simulated swarms suggesting biological plausibility of the mechanisms employed by the artificial system.

关键词： swarm intelligence bio-inspired algorithm division of labour partitioning algorithm swarm robotics honeybees

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of a moving target tracking method based on computer vision 8

Performance analysis of a moving target tracking method base...

引用

8th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)

作者： Zheng, Ying Xiao, Su Huaibei Normal Univ Sch Comp Sci & Technol Huaibei 235000 Anhui Peoples R China

ISBN: (纸本)9781509023134

With the rapid development of computer technology, image processing technology is significantly improved. In this paper, a method of moving target tracking based on computer vison is studied. By combining with the results of the Marr image research, we first introduce the framework of computer vision theory via a bottom-up visual tracking processing method. To be specific, we take the rocket as an example. Consecutively applying the segmentation algorithm and the tracking algorithm, we find that the accuracy of separation and the instantaneity of image can be enhanced, which makes a significant contribution to the target tracking technology.

关键词： Computer vision partitioning algorithm Tracking algorithm Accuracy of separation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：