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

20th ACM SIGPLAN Symposium on Principles and Practice of parallel Programming, PPoPP 2015

作者： Xie, Chenning Chen, Rong Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332057

Large-scale graph-structured computation usually exhibits iterative and convergence-oriented computing nature, where input data is computed iteratively until a convergence condition is reached. Such features have led to the development of two different computation modes for graph-structured programs, namely synchronous (Sync) and asynchronous (Async) modes. Unfortunately, there is currently no in-depth study on their execution properties and thus programmers have to manually choose a mode, either requiring a deep understanding of underlying graph engines, or suffering from suboptimal performance. This paper makes the first comprehensive characterization on the performance of the two modes on a set of typical graph-parallel applications. Our study shows that the performance of the two modes varies significantly with different graph algorithms, partitioning methods, execution stages, input graphs and cluster scales, and no single mode consistently outperforms the other. To this end, this paper proposes Hsync, a hybrid graph computation mode that adaptively switches a graph-parallel program between the two modes for optimal performance. Hsync constantly collects execution statistics on-the-fly and leverages a set of heuristics to predict future performance and determine when a mode switch could be profitable. We have built online sampling and offline profiling approaches combined with a set of heuristics to accurately predicting future performance in the two modes. A prototype called PowerSwitch has been built based on PowerGraph, a state-of-the-art distributed graph-parallel system, to support adaptive execution of graph algorithms. On a 48-node EC2-like cluster, PowerSwitch consistently outperforms the best of both modes, with a speedup ranging from 9% to 73% due to timely switch between two modes. Copyright 2015 ACM.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Tinman: Eliminating confidential mobile data exposure with security oriented offloading 15

Tinman: Eliminating confidential mobile data exposure with s...

引用

10th European Conference on Computer systems, EuroSys 2015

作者： Xia, Yubin Liu, Yutao Tan, Cheng Ma, Mingyang Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems China Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332385

The wide adoption of smart devices has stimulated a fast shift of security-critical data from desktop to mobile devices. However, recurrent device theft and loss expose mobile devices to various security threats and even physical attacks. This paper presents TinMan, a system that protects confidential data such as web site password and credit card number (we use the term cor to represent these data, which is short for Confidential Record) from being leaked or abused even under device theft. TinMan separates accesses of cor from the rest of the functionalities of an app, by introducing a trusted node to store cor and offloading any code from a mobile device to the trusted node to access cor. This completely eliminates the exposure of cor on the mobile devices. The key challenges to TinMan include deciding when and how to efficiently and transparently offload execution;Tin-Man addresses these challenges with security-oriented offloading with a low-overhead tainting scheme called asymmetric tainting to track accesses to cor to trigger offloading, as well as transparent SSL session injection and TCP payload replacement to offload accesses to cor. We have implemented a prototype of TinMan based on Android and demonstrated how TinMan protects the information of user's bank account and credit card number without modifying the apps. Evaluation results also show that TinMan incurs only a small amount of performance and power overhead. Copyright © 2015 ACM.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

VButton: Practical attestation of user-driven operations in mobile apps 18

VButton: Practical attestation of user-driven operations in ...

引用

16th ACM International Conference on Mobile systems, Applications, and Services,MobiSys 2018

作者： Li, Wenhao Luo, Shiyu Sun, Zhichuang Xia, Yubin Lu, Long Chen, Haibo Zang, Binyu Guan, Haibing Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China Northeastern University United States

ISBN: (纸本)9781450357203

More and more malicious apps and mobile rootkits are found to perform sensitive operations on behalf of legitimate users without their awareness. Malware does so by either forging user inputs or tricking users into making unintended requests to online service providers. Such malware is hard to detect and generates large revenues for cybercriminals, which is often used for committing ad/click frauds, faking reviews/ratings, promoting people or business on social networks, etc. We find that this class of malware is possible due to the lack of practical and robust means for service providers to verify the authenticity of user-driven operations (i.e., operations supposed to be performed, or explicitly confirmed, by a user). We design and build the VButton system to fill this void. Our system introduces a class of attestation-enabled app UI widgets (called VButton UI). Developers can easily integrate VButton UI in their apps to allow service providers to verify that a user-driven operation triggered by a VButton UI is indeed initiated and intended by a real user. Our system contains an on-device Manager, and a server-side Verifier. Leveraging ARM TrustZone, our system can attest operation authenticity even in the presence of a compromised OS. We have implemented the VButton system on an ARM development board as well as a commercial off-the-shelf smartphone. The evaluation results show that the system incurs negligible overhead. © 2018 Association for Computing Machinery.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

WS-PGRADE: Supporting parameter sweep applications in workflows

WS-PGRADE: Supporting parameter sweep applications in workfl...

引用

Workshop on Workflows in Support of Large-Scale Science, WORKS

作者： Peter Kacsuk Krisztian Karoczkai Gabor Hermann Gergely Sipos Jozsef Kovacs Parallel and Distributed Systems Laboratory MTA SZTAKI Budapest Hungary

Despite majority of production level grid applications are either parameter studies or workflows some of them cannot fit into these categories and implement more complex structures. Such an application class was found in the CancerGrid project, where several parameter study simulation must be connected together into a workflow and must be executed on various production grids. The paper introduces the structure of parameter study based grid applications and describes the WS-PGRADE system which provides support for the development and execution of this category of applications. The data generator, data collector and data processor components of WS-PGRADE provide easy to understand, flexible, though very powerful mechanisms to express involved grid application structures. The grid connector layer of WS-PGRADE can distribute application components to Desktop Grids, service grids, Web Service networks and local resources, thus can find the most efficient location to execute calculations. By using WS-PGRADE, the members of the CancerGrid consortium are able to create and execute grid applications that consist of millions of jobs.

关键词： Portals Engines Mesh generation Web services Feedback Laboratories Production systems Connectors Collaborative tools Collaborative work

来源：评论

学校读者我要写书评

暂无评论

Brokering Solution for Science Gateways Using Multiple distributed Computing Infrastructures

Brokering Solution for Science Gateways Using Multiple Distr...

引用

International Workshop on Science Gateways (IWSG)

作者： Krisztian Karoczkai Attila Kertesz Peter Kacsuk MTA SZTAKI Laboratory of Parallel and Distributed Systems Budapest Hungary

The ever growing number of computation-intensive applications calls for the interoperation of distributed infrastructures such as Clouds, Grids and private clusters. The European SHIWA and ER-flow projects have been initiated to enable the combination of heterogeneous scientific workflows, and to execute them in a large-scale system consisting of multiple distributed Computing Infrastructures including Grids and Clouds. One of the resource management challenges of these projects called parameter study job scheduling. A parameter study job of a workflow has a large number of input files to be consumed by independent job instances. In this paper we propose a meta-brokering solution for these workflows to be applied in science gateways. To cope with the high uncertainty and unpredictable load of the utilized infrastructures, we rely on resource priority services. These tools are capable of determining and dynamically updating priorities of the available infrastructures to be selected for job instances.

关键词： Logic gates Time measurement distributed computing Europe Concrete Resource management Workflow management software

来源：评论

学校读者我要写书评

暂无评论

Word-level BERT-CNN-RNN Model for Chinese Punctuation Restoration 6

Word-level BERT-CNN-RNN Model for Chinese Punctuation Restor...

引用

6th IEEE International Conference on Computer and Communications, ICCC 2020

作者： Zhang, Zhe Liu, Jie Chi, Lihua Chen, Xinhai Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China College of Computer Science and Electronic Engineering Hunan University Changsha China

ISBN: (纸本)9781728186351

Punctuation restoration in speech recognition has a wide range of application scenarios. Despite the widespread success of neural networks methods at performing punctuation restoration for English, there have been only limited attempts for Chinese punctuation restoration. Due to the differences between Chinese and English in terms of grammar and basic semantic units, existing methods for English is not suitable for Chinese punctuation restoration. To tackle this problem, we propose a hybrid model combining the kernel of Bidirectional Encoder Representations from Transformers (BERT), Convolution Neural Network (CNN) and Recurrent Neural Network (RNN). This model employs a flexible structure and special CNN design which can extract word-level features for Chinese language. We compared the performance of the hybrid model with five widely-used punctuation restoration models on the public dataset. Experimental results demonstrate that our hybrid model is simple and efficient. It outperforms other models and achieves an accuracy of 69.1%. © 2020 IEEE.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

A massively-parallel multicore acceleration of a point contact solid mechanics simulation

引用

Civil-Comp Proceedings 2017年 111卷

作者： Kolman, M. Kosec, G. Parallel and Distributed Systems Laboratory Joef Stefan Institute Ljubljana Slovenia

This paper deals with the numerical determination of the stress and displacement distribution in a solid body subjected to the applied external force. The tackled solid mechanics problem is governed by the Navier-Cauchy equation that describes the deformation within the solid body through the displacement vector field. To obtain the solution, a coupled system of non-linear Partial Differential Equations (PDE) of second order has to be solved. In this paper, the problem is approached by a strong form Moving Least Squares (MLS) based numerical discretization also referred to as a Meshless Local Strong Form Method (MLSM). A generic C++ implementation of a MLSM is used for demonstration of parallel solution of a Point Contact problem on Intel® Xeon Phi™ multicore accelerator. All tests are executed on either the host machine with two Intel® Xeon® E5-2620 v3 6 core processors or offloaded to its 60 core Intel® Xeon Phi™ SE10/7120 series. The shared memory parallelization is implemented through an OpenMP API. © Civil-Comp Press, 2017.

关键词： Point contacts Application programming interfaces (API) Least squares approximations Numerical methods Partial differential equations Displacement vector fields Meshless MLSM Nonlinear partial differential equations OpenMP parallel implementations Shared memory parallelization Stress and displacement distribution

来源：评论

学校读者我要写书评

暂无评论

Refined RBF-FD Solution of Linear Elasticity Problem

Refined RBF-FD Solution of Linear Elasticity Problem

引用

International Multidisciplinary Conference on Computer and Energy Science (SpliTech)

作者： Jure Slak Gregor Kosec “Jozef Stefan” Institute Parallel and Distributed Systems Laboratory Ljubljana Slovenia

ISBN: (纸本)9781538662960

Solving PDEs with Radial Basis Functions, especially using local approaches, has become a promising alternative to the Finite Element Method. This paper describes one such approach, a local RBF-FD method, analogous to Finite Difference Method, that can handle irregular geometries, varying discretization densities and is easy to implement. RBF - FD method is analysed by solving basic linear elasticity problems using uniform and refined discretizations. Finally, a linear elasticity problem arising from analysis of fretting fatigue is solved and RBF - FD solution is compared to existing solutions, obtained using commercial software.

关键词： Shape Stress Boundary conditions Elasticity Fatigue Structural beams Loading

来源：评论

学校读者我要写书评

暂无评论

Topology awareness algorithm for virtual network mapping

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2012年第3期13卷 178-186页

作者： Xiao-ling LI Huai-min WANG Chang-guo GUO Bo DING Xiao-yong LI Wen-qi BI Shuang TAN National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology.Changsha 410073China School of Computer National University of Defense TechnologyChangsha 410073China China Electronic Systems Engineering Corporation Beijing 100039China The Northern Institute of Electronic Equipment of China Beijing 100083China

Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).

关键词： Network virtualization Ossification Virtual network (VN) mapping Substrate network (SN) Topology awareness Acceptance ratio

来源：评论

学校读者我要写书评

暂无评论

Implicit-Explicit Error Indicator based on Approximation Order

Implicit-Explicit Error Indicator based on Approximation Ord...

引用

International Multidisciplinary Conference on Computer and Energy Science (SpliTech)

作者： Mitja Janč ič Filip Strniš a Gregor Kosec Parallel and Distributed Systems Laboratory Joief Stefan Institute Joief Stefan International Postgraduate School Ljubljana Slovenia Parallel and Distributed Systems Laboratory Joief Stefan Institute Ljubljana Slovenia

ISBN: (纸本)9781665488280

With the immense computing power at our disposal, the numerical solution of partial differential equations (PDEs) is becoming a day-to-day task for modern computational scientists. However, the complexity of real-life problems is such that tractable solutions do not exist. This makes it difficult to validate the numerically obtained solution, so good error estimation is crucial in such cases. It allows the user to identify problematic areas in the computational domain that may affect the stability and accuracy of the numerical method. Such areas can then be remedied by either h- or p-adaptive procedures. In this paper, we propose to estimate the error of the numerical solution by solving the same governing problem implicitly and explicitly, using a different approximation order in each case. We demonstrate the newly proposed error indicator on the solution of a synthetic two-dimensional Poisson problem with tractable solution for easier validation. We show that the proposed error indicator has good potential for locating areas of high error.

关键词： Poisson equations Error analysis Complexity theory Task analysis Numerical stability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：