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

Information Processing (ICINPRO), International Conference on

作者： C M Geeta Usharani R G Shreyas Raju S Raghavendra Rajkumar Buyya K R Venugopal S S Iyengar L M Patnaik Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore University Cloud Computing and Distributed Systems (CLOUDS) Lab The University of Melbourne Australia Bangalore University Bengaluru India Department of Computer Science and Engineering Florida International University USA INSA National Institute of Advanced Studies Indian Institute of Science Campus Bangalore India

ISBN: (数字)9781538677964

ISBN: (纸本)9781538677971

The demand of deploying information has enormously increased within the last decade. Numerous distributed computing service suppliers have emerged (for eg., Microsoft Azure, Dropbox) in order to satisfy the requirements for information repository and high performance computation. The customers using the cloud repository services can conveniently arrange as a cluster and distribute information among themselves. Information proprietor computes the signatures for every chunk and deploys in the distributed server in order to allow the public verifier to perform public integrity verification on the information stored on the cloud server. In Panda scheme [1], by using the proxy re-signatures, Cloud Service Provider (CSP) verifies and re-signs the revoked customer chunks in favor of the existing customers. The malicious CSP might use the Resign key deliberately to transform the signature of one customer to another. Apart from this, conspiracy amidst the mischievous cloud server and the repudiated customer reveals the private key information of the customers present in the cluster. We propose Secure Auditing and Re-signing of Revoked Customer Chunks by Cloud Using Regression Method. Re-key computed by the information proprietor using regression method is highly secure and the mischievious cloud cannot detect the private information of the customers in the cluster. Our mechanism is collusion resistant, reduces computation cost of re-sign key by information proprietor and in addition CSP securely performs auditing and re-signing of repudiated customer chunks.

关键词： Servers Cloud computing Transforms Resistance computer science Authentication

来源：评论

学校读者我要写书评

暂无评论

Interoperability and security challenges of Industrie 4.0 47

Interoperability and security challenges of Industrie 4.0

引用

47. Jahrestagung der Gesellschaft fur Informatik, Informatik 2017 - 47th Annual Meeting of the German Informatics Society (GI), Informatics 2017

作者： Watson, Venesa Tellabi, Asmaa Sassmannshausen, Jochen Lou, Xinxin University of Siegen Faculty of Science and Engineering Chair for Data Communication Systems Hölderlinstraße 3 Siegen57068 Germany Bielefeld University Department of Computer Networks and Distributed Systems Universitätsstraße 25 Bielefeld33615 Germany

ISBN: (纸本)9783885796695

Industrie 4.0 (I4.0) is the fourth industrial revolution, which will see the digital transformation of manufacturing, through the integration on Industrial Internet of Things (IIoT), Data and Services, and the convergence of Information Technology (IT) and Operational Technology (OT). With any such transformation, there exists challenges that must first be addressed for a successful outcome. For I4.0, these are interoperability and security, which respectively arise from the interconnection of devices from different manufacturers and/or with different communication protocols;and the interconnection of networks with competing critical and non-critical traffic, and the increased access to initially isolated networks. This paper presents an overview of standards, such as IEC 62443, the ISO 27000 series, IEC 62541 Open Connectivity Unified Architecture (OPC UA) and Time Sensitive Networks (TSN) (IEEE 1722-2016), which addresses these challenges. © 2017 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off

FPGA-Accelerated Dense Linear Machine Learning: A Precision-...

引用

Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Kaan Kara Dan Alistarh Gustavo Alonso Onur Mutlu Ce Zhang Department of Computer Science Systems Group ETH Zurich Switzerland Distributed Algorithms and Systems IST Austria

Stochastic gradient descent (SGD) is a commonly used algorithm for training linear machine learning models. Based on vector algebra, it benefits from the inherent parallelism available in an FPGA. In this paper, we first present a single-precision floating-point SGD implementation on an FPGA that provides similar performance as a 10-core CPU. We then adapt the design to make it capable of processing low-precision data. The low-precision data is obtained from a novel compression scheme-called stochastic quantization, specifically designed for machine learning applications. We test both full-precision and low-precision designs on various regression and classification data sets. We achieve up to an order of magnitude training speedup when using low-precision data compared to a full-precision SGD on the same FPGA and a state-of-the-art multi-core solution, while maintaining the quality of training. We open source the designs presented in this paper.

关键词： Field programmable gate arrays Quantization (signal) Training Stochastic processes Hardware Machine learning algorithms Data models

来源：评论

学校读者我要写书评

暂无评论

ABAC rule reduction via similarity computation 5th

ABAC rule reduction via similarity computation

引用

5th International Conference on Networked systems, NETYS 2017

作者： El Hadj, Maryem Ait Benkaouz, Yahya Freisleben, Bernd Erradi, Mohammed Networking and Distributed Systems Research Group TIES SIME Lab ENSIAS Mohammed V University in Rabat Rabat Morocco Conception and Systems Laboratory FSR Mohammed V University in Rabat Rabat Morocco Department of Mathematics and Computer Science Philipps-Universität Marburg Marburg Germany

ISBN: (纸本)9783319596464

Attribute-based access control (ABAC) represents a generic model of access control that provides a high level of flexibility and promotes information and security sharing. Since ABAC considers a large set of attributes for access decisions, using it might get very complicated for large systems. Hence, it is interesting to offer techniques to reduce the number of rules in ABAC policies without affecting the final decision. In this paper, we present an approach based on K-nearest neighbors algorithms for clustering ABAC policies. To the best of our knowledge, it is the first approach that aims to reduce the number of policy rules based on similarity computations. Our evaluation results demonstrate the efficiency of the suggested approach. For instance, the reduction rate can reach up to 10% for an ABAC policy with more than 9000 rules. © Springer International Publishing AG 2017.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

An End-to-End Toolchain: From Automated Cost Modeling to Static WCET and WCEC Analysis

An End-to-End Toolchain: From Automated Cost Modeling to Sta...

引用

International Symposium on Object-Oriented Real-Time distributed Computing

作者： Volkmar Sieh Robert Burlacu Timo Hönig Heiko Janker Phillip Raffeck Peter Wägemann Wolfgang Schröder-Preikschat Department of Computer Science Distributed Systems and Operating Systems Friedrich-Alexander University Erlangen-Nürnberg (FAU) Department of Mathematics Economics · Discrete Optimization · Mathematics Friedrich-Alexander University Erlangen-Nürnberg (FAU)

Reliable and fine-grained cost-models are fundamental for real-time systems to statically predict worst-case execution time (WCET) estimates of program code in order to guarantee timeliness. Analogous considerations hold for energy-constrained systems where worst-case energy consumption (WCEC) values are mandatory to ensure meeting predefined energy budgets. These cost models are generally unavailable for commercial off-the-shelf (COTS) hardware platforms, although static worst-case analysis tools require those models in order to predict the WCET as well as the WCEC of program code. To solve this problem, we present NEO, an end-to-end toolchain to automate cost-model generation for both WCET and WCEC analyses. NEO exploits automatically generated benchmarks, which are input for 1) an instruction-level emulation and 2) automatically conducted execution-time and energy-consumption measurements on the target platform. The gathered values (i.e., occurrences per instruction, execution-time and energyconsumption per benchmark) are combined as mathematical optimization problems. The solutions to the formulated problems, which are designed to reveal the worst-case behavior, yield the respective cost models. To statically determine upper bounds of benchmarks, we integrated the cost models into the stateof-the-art WCET analyzer PLATIN. Our evaluations on COTS hardware reveal that our open-source, end-to-end toolchain NEO yields accurate worst-case bounds.

关键词： Benchmark testing Mathematical model Integrated circuits Analytical models Energy measurement Energy consumption Time measurement

来源：评论

学校读者我要写书评

暂无评论

An environment for sustainable research software in Germany and beyond: Current state, open challenges, and call for action

arXiv

引用

arXiv 2020年

作者： Anzt, Hartwig Bach, Felix Druskat, Stephan Löffler, Frank Loewe, Axel Renard, Bernhard Y. Seemann, Gunnar Struck, Alexander Achhammer, Elke Aggarwal, Piush Appel, Franziska Bader, Michael Brusch, Lutz Busse, Christian Chourdakis, Gerasimos Dabrowski, Piotr W. Ebert, Peter Flemisch, Bernd Friedl, Sven Fritzsch, Bernadette Funk, Maximilian D. Gast, Volker Goth, Florian Grad, Jean-Noël Hermann, Sibylle Hohmann, Florian Janosch, Stephan Kutra, Dominik Linxweiler, Jan Muth, Thilo Peters-Kottig, Wolfgang Rack, Fabian Raters, Fabian H.C. Rave, Stephan Reina, Guido Reißig, Malte Ropinski, Timo Schaarschmidt, Joerg Seibold, Heidi Thiele, Jan P. Uekerman, Benjamin Unger, Stefan Weeber, Rudolf Germany Innovative Computing Lab University of Tennessee KnoxvilleTN United States Department of English Studies Friedrich Schiller University Jena Germany Germany Department of Computer Science Humboldt-Universität zu Berlin Germany Heinz Nixdorf Chair for Distributed Information Systems Friedrich Schiller University Jena Germany Michael Stifel Center Jena Germany Center for Computation and Technology Louisiana State University Baton Rouge United States Germany Robert Koch Institute Berlin Germany Hasso Plattner Institute Faculty of Digital Engineering University of Potsdam Germany Institute for Experimental Cardiovascular Medicine University Heart Centre Freiburg Bad Krozingen Germany Faculty of Medicine University of Freiburg Freiburg Germany Matters of Activity. Image Space Material. Cluster of Excellence at Humboldt-Universität zu Berlin Germany Technische Universität München Germany Language Technology Lab Universität Duisburg-Essen Germany Germany Department of Informatics Technical University of Munich Germany Technische Universität Dresden Germany Deutsches Krebsforschungszentrum Heidelberg Germany Scientific Computing in Computer Science Technical University Munich Germany School of Computing Communication and Business Hochschule für Technik und Wirtschaft Berlin Germany Center for Bioinformatics Saar Saarland Informatics Campus Germany Institute for Modelling Hydraulic and Environmental Systems University of Stuttgart Germany Berlin Institute of Health Germany Scientific Computing Alfred Wegener Institute Helmholtz Center for Polar and Marine Research Bremerhaven Germany Max-Planck-Gesellschaft e.V. Institut für Theoretische Physik und Astrophysik Universität Würzburg Germany Institut für Computerphysik University of Stuttgart Germany University Library University of Stuttgart Germany Universität Bremen Germany Max Planck Institute of Molecular Cell Biology and Genetics Dresden Germany European Molecular Biology Laboratory Heidelb

Research software has become a central asset in academic research. It optimizes existing and enables new research methods, implements and embeds research knowledge, and constitutes an essential research product in itself. Research software must be sustainable in order to understand, replicate, reproduce, and build upon existing research or conduct new research effectively. In other words, software must be available, discoverable, usable, and adaptable to new needs, both now and in the future. Research software therefore requires an environment that supports sustainability. Hence, a change is needed in the way research software development and maintenance are currently motivated, incentivized, funded, structurally and infrastructurally supported, and legally treated. Failing to do so will threaten the quality and validity of research. In this paper, we identify challenges for research software sustainability in Germany and beyond, in terms of motivation, selection, research software engineering personnel, funding, infrastructure, and legal aspects. Besides researchers, we specifically address political and academic decision-makers to increase awareness of the importance and needs of sustainable research software practices. In particular, we recommend strategies and measures to create an environment for sustainable research software, with the ultimate goal to ensure that software-driven research is valid, reproducible and sustainable, and that software is recognized as a first class citizen in research. This paper is the outcome of two workshops run in Germany in 2019, at deRSE19 - the first International Conference of Research Software Engineers in Germany - and a dedicated DFG-supported follow-up workshop in Berlin. Copyright © 2020, The Authors. All rights reserved.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

SPECTRE: Supporting consumption policies in window-based parallel complex event processing

arXiv

引用

arXiv 2017年

作者： Mayer, Ruben Slo, Ahmad Tariq, Muhammad Adnan Rothermel, Kurt Gräber, Manuel Ramachandran, Umakishore Institute of Parallel and Distributed Systems University of Stuttgart Department of Computer Science Fast - National University of Computer and Emerging Sciences Islamabad Pakistan College of Computing Georgia Institute of Technology United States

distributed Complex Event Processing (DCEP) is a paradigm to infer the occurrence of complex situations in the surrounding world from basic events like sensor readings. In doing so, DCEP operators detect event patterns on their incoming event streams. To yield high operator throughput, data parallelization frameworks divide the incoming event streams of an operator into overlapping windows that are processed in parallel by a number of operator instances. In doing so, the basic assumption is that the different windows can be processed independently from each other. However, consumption policies enforce that events can only be part of one pattern instance;then, they are consumed, i.e., removed from further pattern detection. That implies that the constituent events of a pattern instance detected in one window are excluded from all other windows as well, which breaks the data parallelism between different windows. In this paper, we tackle this problem by means of speculation: Based on the likelihood of an event's consumption in a window, subsequent windows may speculatively suppress that event. We propose the SPECTRE framework for speculative processing of multiple dependent windows in parallel. Our evaluations show an up to linear scalability of SPECTRE with the number of CPU cores. Copyright © 2017, The Authors. All rights reserved.

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

Eunomia: Scaling Concurrent Search Trees under Contention Using HTM

引用

ACM SIGPLAN Notices 2017年第8期52卷 385-399页

作者： Wang, Xin Zhang, Weihua Wang, Zhaoguo Wei, Ziyun Chen, Haibo Zhao, Wenyun Software School Fudan University China Shanghai Key Laboratory of Data Science Fudan University School of Computer Science Fudan University China Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Computer Science Department New York University United States

While hardware transactional memory (HTM) has recently been adopted to construct efficient concurrent search tree structures, such designs fail to deliver scalable performance under contention. In this paper, we first conduct a detailed analysis on an HTM-based concurrent B+Tree, which uncovers several reasons for excessive HTM aborts induced by both false and true conflicts under contention. Based on the analysis, we advocate Eunomia, a design pattern for search trees which contains several principles to reduce HTM aborts, including splitting HTM regions with version-based concurrency control to reduce HTM working sets, partitioned data layout to reduce false conflicts, proactively detecting and avoiding true conflicts, and adaptive concurrency control. To validate their effectiveness, we apply such designs to construct a scalable concurrent B+Tree using HTM. Evaluation using key-value store benchmarks on a 20-core HTM-capable multi-core machine shows that Eunomia leads to 5X-11X speedup under high contention, while incurring small overhead under low contention. © 2017 ACM.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

A Reactive Path Planning Approach for a Four-Wheel Robot by the Decomposition Coordination Method 4

A Reactive Path Planning Approach for a Four-Wheel Robot by ...

引用

International Conference on Electrical Engineering, computer science and Informatics

作者： Hala El Ouarrak Mostafa Rachik Ibrahim Sanou Fatiha Akef Mohammed Mestari Department of mathematics Computer Sciences Faculty of Science Ben M'Sik Av Driss El Harti B.P 7955 Sidi Othmane Casablanca Morocco Laboratory of Signals Distributed Systems and Artificial Intelligence (SSDIA) ENSET Mohammedia Av Hassan II Mohammedia Morocco

ISBN: (纸本)9781538605509;9781538605493

In this paper, we discuss the problem of safe navigation by solving a non-linear model for a four-wheel robot while avoiding the upcoming obstacles that may cross its path using the Decomposition Coordination Method (DC). The method consists of first, choosing a non-linear system with the associated objective functions to optimize. Then we carry on the resolution of the model using the Decomposition Coordination Method, which allows the non-linearity of the model to be handled locally and ensures coordination through the use of the Lagrange multipliers. An obstacle-avoidance algorithm is presented thus offering a collision-free solution. A numerical application is given to concert the efficiency of the method employed herein along with the simulation results.

关键词： coordination efficiency employed

来源：评论

学校读者我要写书评

暂无评论

Using English as pivot to extract Persian-Italian parallel sentences from non-parallel corpora

arXiv

引用

arXiv 2017年

作者： Ansari, Ebrahim Sadreddini, M.H. Sheikhalishahi, Mostafa Wallace, Richard Alimardani, Fatemeh Zanjan Iran Department of Computer Science and Engineering Shiraz University Shiraz Iran Department of Mathematics and Informatics University of Calabria Rende Italy Distributed Systems Architecture Research Group Complutense University Madrid Spain

The effectiveness of a statistical machine translation system (SMT) is very dependent upon the amount of parallel corpus used in the training phase. For low-resource language pairs there are not enough parallel corpora to build an accurate SMT. In this paper, a novel approach is presented to extract bilingual Persian-Italian parallel sentences from a non-parallel (comparable) corpus. In this study, English is used as the pivot language to compute the matching scores between source and target sentences and candidate selection phase. Additionally, a new monolingual sentence similarity metric, Normalized Google Distance (NGD) is proposed to improve the matching process. Moreover, some extensions of the baseline system are applied to improve the quality of extracted sentences measured with BLEU. Experimental results show that using the new pivot based extraction can increase the quality of bilingual corpus significantly and consequently improves the performance of the Persian-Italian SMT system. Copyright © 2017, The Authors. All rights reserved.

关键词： computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：