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

10th Web Information System and Application Conference (WISA)

作者： Gan, Zaobin Li, Na Ma, Yao Lu, Hongwei Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9780769551340

As a formal description approach, the trust network can intuitively describe trust relationships among entities in virtual communities and attracts great attentions. The trust network visualization is a key to explore the mechanism of trust propagation and study the trust evaluation. Most existing network visualization approaches only take into account the undirected and unweighted graphs, which cannot illustrate the asymmetry and the discreteness of trust relationships. To solve this issue, we define the public influence weight, the trust strength and the trust distance in this paper and propose the force-directed visualization algorithm for trust network. In the visualization algorithm, the desirable length between two nodes is determined by the trust strength so as to cluster trusted entities, and the forces between two different nodes are determined by their public influence weights so as to center on the heavyweight entities. Finally, the visualization experiments are carried out on the Epinions data set and the performance of the proposed algorithm is compared with the classical force-directed layout algorithm. The experimental results show that it can reveal the nature of communities better.

关键词： Trust network force-directed algorithms layout techniques trust distance Nonprofit Organizations trust Trust Visualization placement algorithm

来源：评论

学校读者我要写书评

暂无评论

Service placement for Real-Time Applications: Rate-Adaptation and Load-Balancing at the Network Edge

Service Placement for Real-Time Applications: Rate-Adaptatio...

引用

IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)

作者： Saadallah Kassir Gustavo de Veciana Nannan Wang Xi Wang Paparao Palacharla Electrical and Computer Engineering Department The University of Texas at Austin TX USA Fujitsu Laboratories of America Richardson TX USA

ISBN: (数字)9781728165509

ISBN: (纸本)9781728165516

Mobile Edge Computing may become a prevalent platform to support applications where mobile devices have limited compute, storage, energy and/or data privacy concerns. In this paper, we study the efficient provisioning and management of compute resources in the Edge-to-Cloud continuum for different types of real-time applications with timeliness requirements depending on application-level update rates and communication/compute delays. We begin by introducing a highly stylized network model allowing us to study the salient features of this problem including its sensitivity to compute vs. communication costs, application requirements, and traffic load variability. We then propose an online decentralized service placement algorithm, based on estimating network delays and adapting application update rates, which achieves high service availability. Our results exhibit how placement can be optimized and how a load-balancing strategy can achieve near-optimal service availability in large networks.

关键词： Edge Computing Fog Network Dimensioning Rate Adaptation Service placement Real-Time Applications real-time application program rate adaptive Health Services Accessibility Load balancing network delay placement algorithm placement

来源：评论

学校读者我要写书评

暂无评论

A Graph-based I/O Pad Pre-placement Technique for use with Analytic FPGA placement Methods

A Graph-based I/O Pad Pre-placement Technique for use with A...

引用

International Conference on VLSI Design

作者： Ming Xu Gary Grewal School of Computer Science University of Guelph

ISBN: (纸本)9781424455416

Typical analytic placement methods seek to minimize total squared wirelength by solving a linear equation system. However, to avoid trivial solutions, certain blocks must be assigned locations on the Field Programmable Gate Array (FPGA) fabric prior to optimization. A simple way to achieve this is to assign blocks randomly. However, this does not always result in the best solution. In this paper, we present a novel algorithm, called ShrubPlace, for pre-assigning I/O blocks to I/O pads around the perimeter of the FPGA. To verify the efficacy of our pre-placement algorithm, we integrated the algorithm into the analytic placer in [1,2]. When tested with the 20 MCNC benchmarks [11], our results show a reduction in wirelength is possible, with very little additional execution time required to perform the pre-placement.

关键词： Field programmable gate arrays perimeter IO execution time placement algorithm placement

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-528

引用

2016年

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-528 by published by

关键词： algorithm block placement disk file file implementation file implementations file server file servers file system file systems files implementation implementations mit-lcs-tr-528 multiple multiple file parameters placement placement algorithm seek distance system

来源：评论

学校读者我要写书评

暂无评论

Interference Management for Distributed Parallel Applications in Consolidated Clusters

引用

ACM SIGPLAN NOTICES 2016年第4期51卷 443-456页

作者： Han, Jaeung Jeon, Seungheun Choi, Young-ri Huh, Jaehyuk Korea Adv Inst Sci & Technol Sch Comp Daejeon South Korea UNIST Sch Elect & Comp Engn Ulsan South Korea

Consolidating multiple applications on a system can improve the overall resource utilization of data center systems. However, such consolidation can adversely affect the performance of some applications due to interference caused by resource contention. Despite many prior studies on the interference effects in single-node systems, the interference behaviors of distributed parallel applications have not been investigated thoroughly. With distributed applications, a local interference in a node can affect the whole execution of an application spanning many nodes. This paper studies an interference modeling methodology for distributed applications to predict their performance under interference effects in consolidated clusters. This study first characterizes the effects of interference for various distributed applications over different interference settings, and analyzes how diverse interference intensities on multiple nodes affect the overall performance. Based on the characterization, this study proposes a static profiling-based model for interference propagation and heterogeneity behaviors. In addition, this paper presents use case studies of the modeling method, two interference-aware placement techniques for consolidated virtual clusters, which attempt to maximize the overall throughput or to guarantee the quality-of-service.

关键词： Resource contention consolidated system cloud computing distributed parallel application interference model placement algorithm

来源：评论

学校读者我要写书评

暂无评论

A DIVIDE-AND-CONQUER algorithm FOR THE AUTOMATIC LAYOUT OF LARGE DIRECTED-GRAPHS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1991年第1期21卷 1-12页

作者： MESSINGER, EB ROWE, LA HENRY, RR UNIV CALIF BERKELEY DEPT ELECT ENGN & COMP SCIDIV COMP SCIBERKELEYCA 94720 UNIV WASHINGTON DEPT COMP SCI & ENGNSEATTLEWA 98195

Pictures are a useful medium for communicating abstract information. Pictures exploit a person's natural abilities to recognize and understand visual patterns. However, the differences between an effective and a confusing presentation of the same data can be subtle, and often depend on the layout. Methods for automatic presentation of relational information in the form of directed graphs are discussed. An overview of the graph-layout problem is presented, along with a summary of several different layout algorithms. A new divide-and-conquer layout algorithm is described in detail. This algorithm produces especially good results on large graphs of several hundred vertices.

关键词： directed graphs placement algorithm algorithms layouts AUTOMATIC

来源：评论

学校读者我要写书评

暂无评论

Stairway compaction using corner block list and its applications with rectilinear blocks 02

Stairway compaction using corner block list and its applicat...

引用

IEL Citation

作者： Yuchun Ma Xianlong Hong Sheqin Dong Yici Cai Chung-Kuan Cheng Jun Gu Department of Computer Science and Technology Tsinghua University Beijing China Department of Computer Science and Engineering University of CaliforniaSan Diego Department of Computer Science Science & Technology University of HongKong

ISBN: (纸本)0769514413

The Corner Block List (CBL) was recently proposed as an efficient representation for MOSAIC packing of rectangles. Although the original method is innovative, there still remains room for improvement for our purpose. This paper proposes a compact algorithm for placement based on the corner block list. By introducing dummy blocks into CBL, our algorithm can employ dummy blocks in the packing to represent the placement, including empty rooms, which the CBL cannot represent. Our algorithm can obtain fast convergence to an optimal solution. Based on the compact approach, we propose a new way to handle arbitrary shaped rectilinear modules. The experimental results are demonstrated by some benchmark data and the performance shows the effectiveness of the proposed method.

关键词： VLSI integrated circuit layout circuit layout CAD convergence of numerical methods stairway compaction corner block list rectilinear blocks MOSAIC packing rectangles compact algorithm dummy blocks placement algorithm VLSI physical design fast convergence optimal solution arbitrary shaped rectilinear modules

来源：评论

学校读者我要写书评

暂无评论

Using spring algorithms to remove node overlapping 05

Using spring algorithms to remove node overlapping

引用

Asia-Pacific Symposium on Information Visualisation

作者： Wanchun Li Peter Eades Nikola Nikolov University of Sydney Australia

ISBN: (纸本)9781920682279

Cluttered drawings of graphs cannot effectively convey the information of graphs. Two issues might cause node overlapping when one draws a picture of a graph. The first issue occurs when applying a layout algorithm for an abstract graph to a practical application in which nodes are labeled. The second is the changing of a node's size in a dynamic drawing system. This paper presents two algorithms, DNLS and ODNLS, for removing the two kinds of overlapping. The algorithms are based on the well-known spring embedder model. The outputs of the algorithms provide the features of spring algorithms. Experiments are carried out to compare DNLS and ODNLS to the Force Scan(FS) algorithm and its variants. The results demonstrate the advantages of DNLS and ODNLS in terms of some aesthetic criteria.

关键词： spring algorithm placement algorithm algorithms Line of nodes springs Device Spring Spring season Ganglia drawing overlaps

来源：评论

学校读者我要写书评

暂无评论

A Global Identifiability Condition for Consensus Networks on Tree Graphs

A Global Identifiability Condition for Consensus Networks on...

引用

American Control Conference

作者： Seyedbehzad Nabavi Aranya Chakrabortty Pramod P. Khargonekar Department of Electrical and Computer Engineering North Carolina State University Raleigh NC Department of Electrical and Computer Engineering University of Florida Gainesville FL

ISBN: (纸本)9781479917730

In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure. Each edge of the underlying network graph G is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as the weighted linear combination of its difference with the states of its neighboring nodes. Following the classical definitions of identifiability and indistinguishability, we first derive a condition that ensures the identifiability of the edge weights of G in terms of the associated transfer function. Using this characterization, we propose a sensor placement algorithm that guarantees identifiability of the edge weights. We describe our results using illustrative examples.

关键词： Mathematic Identifiability Tree graphs TRANSFER FUNCTIONS placement algorithm Edge of a figure or solid Linear Combination

来源：评论

学校读者我要写书评

暂无评论

Puzzle generators and symmetric puzzle layout 05

Puzzle generators and symmetric puzzle layout

引用

Asia-Pacific Symposium on Information Visualisation

作者： Kozo Sugiyama Ryo Osawa Seok-Hee Hong School of Knowledge Science Tatsunokuchi Nomi Ishikawa Japan The University of Sydney Sydney Australia

We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modelled as puzzle graphs. Based on these models, we implement two puzzle generators and produce various layouts of the p... 详细信息

ISBN: (纸本)9781920682279

We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modelled as puzzle graphs. Based on these models, we implement two puzzle generators and produce various layouts of the puzzles using graph drawing algorithms. Using these puzzle generators we can create new puzzles. Further, we can create new user interfaces of a puzzle by applying different layout algorithms. We implement a method for constructing symmetric layouts of puzzles, as symmetry is the most important aesthetic criteria for the puzzle layout.

关键词： symmetric layout layouts dynamos User Interface Device Component placement algorithm CENTROSYMMETRIC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：