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

Assured data deletion with fine-grained access control for fog-based industrial applications

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Yu, Yong Xue, Liang Li, Yannan Du, Xiaojiang Guizani, Mohsen Yang, Bo School of Computer Science Shaanxi Normal University Xi'an710062 China Shanghai KOAL Software Co. Ltd Shanghai200436 China Dept. of Computer and Information Sciences Temple University United States Department of Electrical and Computer Engineering University of Idaho United States

The advances of cloud computing, fog computing and Internet of Things (IoT) make the industries more prosperous than ever. A wide range of industrial systems such as transportation systems and manufacturing systems have been developed by integrating cloud computing, fog computing and IoT successfully. Security and privacy issues are a major concern that hinders the wide adoptions of these novel techniques. In this paper, we focus on assured data deletion, an issue which is important but received less attention in academia and industry. We firstly propose a framework to integrate the cloud, the fog and the things together to manage the stored data from industries or individuals. We then focus on secure data deletion in this framework by proposing an assured data deletion scheme which fulfills fine-grained access control over sensitive data and verifiable data deletion. Only the data owners and the fog devices are involved when deleting a data key and validating the data deletion, which makes the protocol practical due to the features of low latency and real-time interaction of fog computing. The proposed protocol takes advantage of attributebased encryption and is provably secure under the standard model. The theoretical analysis shows the good performance and functionality requirements while the implementation results demonstrate the feasibility of our proposal. Copyright © 2018, The Authors. All rights reserved.

关键词： Fog computing

Efficient rate adaptation algorithm in high-dense vehicular ad hoc network 13

学校读者我要写书评

暂无评论

Efficient rate adaptation algorithm in high-dense vehicular ...

13th IEEE Malaysia International Conference on Communications, MICC 2017

作者： Chaab, Wafaa Al Ismail, Mahamod Altahrawi, Mohammed A. Mahdi, Hussain Ramli, Nordin Dept. of Electrical Electronic and System Engineering Universiti Kebangsaan Malaysia Bangi Selangor43600 Malaysia Computer and Software Engineering Dept. University of Diyala Iraq MIMOS Berhad Technology Park Malaysia Kuala Lumpur57000 Malaysia

ISBN: (纸本)9781538631324

In the Vehicular Ad hoc NETwork (VANET) communications, the presence of intersections, vehicles, and obstacles such as buildings may obstruct signal propagation especially in urban areas. Moreover, the vehicle's mobility and density also cause intermittent in inter-vehicle connection due to unpredictable and diverse channel conditions. Rate adaptation is the key method in VANET to predict the prevailing channel conditions and decide appropriate transmission rate quickly based on channel status. Although various rate adaptation algorithms using closed and open loop exist, it is difficult to select the best rate adaptation method due to unpredictable nature of the vehicular environment, while inappropriate data selection leads poor network performance as well. This paper aims to evaluate the performance of different data rate adaptation algorithms in VANET, using closed-loop and open-loop based approaches. The two-targeted open loops are Atsushi Onoe Algorithm and Minstrel, while Collision-Aware Rate Adaptation (CARA) and Robust Rate Adaptation Algorithm (RRAA) are closed-loop based approaches. The mentioned algorithms are simulated under high-density VANET scenario with a number of nodes starts from 40 up to a hundred using the discrete event network simulator NS-3. Moreover, the distance between the nodes is investigated also over the selected approaches. Simulation results, in general, show that the close-looped outperform the open-looped approach, with RRAA better than others by at least 9.4% and nearby reach to 62% in the average throughput over the different node density as the distance varied. The packet delivery ratio is slightly diverse over the node density. However, an end-end delay is 233.39 ms which is the worst among others, but still adequate for the high critical demand applications. © 2017 IEEE.

关键词： Vehicular ad hoc networks

Performance study of a 3 × 1 × 1 m3 dual phase liquid Argon Time Projection Chamber exposed to cosmic rays

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Aimard, B. Aizawa, L. Alt, C. Asaadi, J. Auger, M. Aushev, V. Autiero, D. Balaceanu, A. Balik, G. Balleyguier, L. Bechetoille, E. Belver, D. Blebea-Apostu, A.M. Bolognesi, S. Bordoni, S. Bourgeois, N. Bourguille, B. Bremer, J. Brown, G. Brunetti, L. Brunetti, G. Caiulo, D. Calin, M. Calvo, E. Campanelli, Mario Cankocak, K. Cantini, C. Carlus, B. Cautisanu, B.M. Chalifour, M. Chappuis, A. Charitonidis, N. Chatterjee, A. Chiriacescuf, A. Chiu, P. Coan, T. Conforti, S. Cotte, P. Crivelli, P. Cuesta, C. Dawson, J. de Bonis, I. de la Taille, C. Delbart, A. Di Luise, S. Doizon, F. Drancourt, C. Duchesneau, D. Dulucq, F. Duval, F. Emery, S. Ereditato, A. Falcone, A. Fusshoeller, K. Gallego-Ros, A. Galymov, V. Geffroy, N. Gendotti, A. Gherghel-Lascu, A. Gil-Botella, I. Girerd, C. Gomoiu, M.C. Gorodetzky, P. Hamada, E. Hanni, R. Hasegawa, T. Holin, A. Horikawa, S. Ikeno, M. Jiménez, S. Jipa, A. Karolak, M. Karyotakis, Y. Kasai, S. Kasami, K. Kishishita, T. Konari, H. Kreslo, I. Kryn, D. Kunzé, P. Kurokawa, M. Kuromori, Y. Lastoria, C. Lazanu, I. Lehmann-Miotto, G. Leyton, M. Lira, N. Liubarska, M. Loo, K. Lorca, D. Lutz, P. Lux, T. Maalampi, J. Maire, G. Maki, M. Manenti, L. Margineanu, R.M. Marteau, J. Martin-Chassard, G. Mathez, H. Mazzucato, E. Misitano, G. Mladenov, D. Molina Bueno, L. Mosu, T.S. Mu, W. Murphy, S. Nakayoshi, K. Narita, S. Navas-Nicolás, D. Negishi, K. Nessi, M. Niculescu-Oglinzanu, M. Noto, F. Noury, A. Onishchuk, Y. Palomares, C. Parvu, M. Patzak, T. Penichot, Y. Pennacchio, E. Periale, L. Pessard, H. Pietropaolo, F. Pugnere, D. Radics, B. Redondo, D. Regenfus, C. Remoto, A. Resnati, F. Ristea, O. Rubbia, A. Saftoiu, A. Sakashita, K. Sanchez, F. Santos, C. Scarpelli, A. Schloesser, C. Sendai, K. Sergiampietri, F. Shahsavarani, S. Shoji, M. Sinclair, J. Soto-Oton, J. Stanca, D.I. Stefan, D. Sulej, R. Tanaka, M. Toboaru, V. Tonazzo, A. Tromeur, W. Trzaska, W.H. Uchida, T. Urda, L. Vannucci, F. Vasseur, G. Verdugo, A. Viant, T. Vihonen, S. Vilalte, S. Weber, M. Wu, S. Yu, J. Zambelli, L. Zito, M. LAPP Université Savoie Mont Blanc CNRS/IN2P3 Annecy France University of Texas Arlington Arlington United States 08193 Spain Fermilab BataviaIL United States Bern Switzerland University of Bucharest Faculty of Physics Bucharest Romania Horia Hulubei National Institute for R&D in Physics and Nuclear Engineering - IFIN-HH Bucharest - Magurele Romania Southern Methodist University DallasTX United States CERN Geneva Switzerland IRFU CEA Saclay Gif-sur-Yvette France University of Granada Faculty of Sciences Granada Spain University of Jyväskylä Department of Physics Jyväskylä Finland National Institute of Technology Kure College KureHiroshima Japan Kyiv National University Kyiv Ukraine University College London Dept. of Physics and Astronomy London United Kingdom Madrid Spain Iwate University Department of Electrical Engineering and Computer Science MoriokaIwate Japan OMEGA Ecole Polytechnique CNRS/IN2P3 Palaiseau France Université Paris Diderot CNRS/IN2P3 CEA/Irfu Observatoire de Paris Sorbonne Paris Cité Paris France TsukubaIbaraki Japan CNRS/IN2P3 Université de Lyon Université Claude Bernard Lyon 1 Villeurbanne France Warsaw Poland ETH Zurich Institute for Particle Physics Zurich Switzerland

We report the results of the analyses of the cosmic ray data collected with a 4 tonne (3×1×1 m3) active mass (volume) Liquid Argon Time-Projection Chamber (TPC) operated in a dual-phase mode. We present a detailed study of the TPC’s response, its main detector parameters and performance. The results are important for the understanding and further developments of the dual-phase technology, thanks to the verification of key aspects, such as the extraction of electrons from liquid to gas and their amplification through the entire one square metre readout plain, gain stability, purity and charge sharing between readout views. © 2021, CC BY.

关键词： Liquefied gases

N-gram and Neural Language Models for Discriminating Similar Languages

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Cianflone, Andre Kosseim, Leila Dept. of Computer Science & Software Engineering Concordia University

This paper describes our submission (named clac) to the 2016 Discriminating Similar Languages (DSL) shared task. We participated in the closed Sub-task 1 (Set A) with two separate machine learning techniques. The first approach is a character based Convolution Neural Network with a bidirectional long short term memory (BiLSTM) layer (CLSTM), which achieved an accuracy of 78.45% with minimal tuning. The second approach is a character-based n-gram model. This last approach achieved an accuracy of 88.45% which is close to the accuracy of 89.38% achieved by the best submission, and allowed us to rank #7 overall. Copyright © 2017, The Authors. All rights reserved.

关键词： Multilayer neural networks

MPIgnite: An MPI-Like Language and prototype implementation for apache spark

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Morris, Brandon L. Skjellum, Anthony Auburn University Dept. of Computer Science and Software Engineering

Scale-out parallel processing based on MPI is a 25-year-old standard with at least another decade of preceding history of enabling technologies in the High Performance Comput-ing community. Newer frameworks such as MapReduce, Hadoop, and Spark represent industrial scalable comput-ing solutions that have received broad adoption because of their comparative simplicity of use, applicability to relevant problems, and ability to harness scalable, distributed re-sources. While MPI provides performance and portability, it lacks in productivity and fault tolerance. Likewise, Spark is a specific example of a current-generation MapReduce and data-parallel computing infrastructure that addresses those goals but in turn lacks peer communication support to al-low featherweight, highly scalable peer-to-peer data-parallel code sections. The key contribution of this paper is to demonstrate how to introduce the collective and point-to-point peer communica-tion concepts of MPI into a Spark environment. This is done in order to produce performance-portable, peer-oriented and group-oriented communication services while retaining the essential, desirable properties of Spark. Additional concepts of fault tolerance and productivity are considered. This ap-proach is offered in contrast to adding MapReduce frame-work as upper-middleware based on a traditional MPI im-plementation as baseline infrastructure. Copyright © 2017, The Authors. All rights reserved.

关键词： Fault tolerance

Bag-of-visual-words for signature-based multi-script document retrieval

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Mandal, Ranju Roy, Partha Pratim Pal, Umapada Blumenstein, Michael School of Information and Communication Technology Griffith University QLD Australia Dept. of Computer Science & Engineering Indian Institute of Technology Roorkee India Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India School of Software University of Technology Sydney Australia

An end-to-end architecture for multi-script document retrieval using handwritten signatures is proposed in this paper. The user supplies a query signature sample and the system exclusively returns a set of documents that contain the query signature. In the first stage, a component-wise classification technique separates the potential signature components from all other components. A bag-of-visual-words powered by SIFT descriptors in a patch-based framework is proposed to compute the features and a Support Vector Machine (SVM)-based classifier was used to separate signatures from the documents. In the second stage, features from the foreground (i.e. signature strokes) and the background spatial information (i.e. background loops, reservoirs etc.) were combined to characterize the signature object to match with the query signature. Finally, three distance measures were used to match a query signature with the signature present in target documents for retrieval. The 'Tobacco' [1] document database and an Indian script database containing 560 documents of Devanagari (Hindi) and Bangla scripts were used for the performance evaluation. The proposed system was also tested on noisy documents and promising results were obtained. A comparative study shows that the proposed method outperforms the state-of-the-art approaches. Copyright © 2018, The Authors. All rights reserved.

关键词： Support vector machines

Analysis of SEU propagation in sequential circuits at RTL using Satisfiability Modulo Theories 15

学校读者我要写书评

暂无评论

Analysis of SEU propagation in sequential circuits at RTL us...

15th IEEE International New Circuits and Systems Conference, NEWCAS 2017

作者： Kazma, Ghaith Bany Hamad, Ghaith Ait Mohamed, Otmane Savaria, Yvon Dept. of Electrical and Computer Engineering Concordia University MontrealQC Canada Groupe de Recherche en Microélectronique et Microsystèmes Polytechnique Montréal MontrealQC Canada

ISBN: (纸本)9781509049905

Ultra-deep sub-micron technologies are more vulnerable to different types of uncertainties, parametric variations, and interference. In this paper, we introduce a new methodology to estimate the vulnerability of sequential circuits to soft errors at Register Transfer Level (RTL). A modeling approach using Satisfiability Modulo Theories (SMTs) combined with circuit unrolling is proposed to model the propagation of Single Event Upsets (SEUs) at RTL. In order to efficiently estimate SEU propagation, an approximate model counting approach was used. In the reported experimental results, using sequential circuits from the ITC99 benchmarks, we investigate the tradeoffs in computation time versus accuracy of an exhaustive and approximate approach to compute the Soft Error Rate (SER). Significant speed-up in computation time of up to 37 times faster can be achieved with a minimal percentage loss in accuracy of as low as 0.1%. © 2017 IEEE.

关键词： Timing circuits

Online Cloud-Based Battery Lifetime Estimation Framework for Smartphone Devices

学校读者我要写书评

暂无评论

Procedia computer Science 2017年 110卷 70-77页

作者： Raja Wasim Ahmad Raja Sehrab Bashir Sharjil Saeed Yangsun Lee Kwangman Ko Yunsik Son COMSATS Institute of Information Technology Pakistan Department of Software Engineering University Malaya Malaysia Department of Computer Science and IT University of AJK Dept. of Computer Engineering Sekyungongguk University South Korea Dept. of Computer Engineering Sanji University South Korea Dept. of Computer Engineering Dongguk University South Korea

Smartphones are resource constrained external battery operated devices. The resources of smartphone devices such as a battery, CPU, and RAM are very low compared to the desktop server. However, the requirements of smartphone users are growing tremendously. As a result, smartphone applications perform rich functionality to enrich user experience. However, due to increase in the execution capacity of smartphone applications, smartphone battery lifetime minimizes. This study proposes a cloud-based framework that estimates battery lifetime of a smartphone device. Moreover, it overviews the theoretical design of computational offloading framework to present an application area for the proposed work. Finally, it presents preliminary results to evaluate the proposed framework.

关键词： Mobile Computing Cloud Computing Computation Offloading Battery Lifetime Estimation Energy Optimization

Transforming blocking MPI collectives to non-blocking and persistent operations 17

学校读者我要写书评

暂无评论

Transforming blocking MPI collectives to non-blocking and pe...

24th European MPI Users" Group Meeting, EuroMPI 2017

作者： Ahmed, Hadia Skjellum, Anthony Bangalore, Purushotham Pirkelbauer, Peter Dept. of Computer Science University of Alabama Birmingham United States Dept. of Computer Science and Software Engineering Auburn University United States Lawrence Berkeley National Laboratory 1 Cyclotron Rd BerkeleyCA94720 United States University of Tennessee ChaanoogaTN United States

ISBN: (纸本)9781450348492

is paper describes Petal, a prototype tool that uses compiler-analysis techniques to automate code transformations to hide communication costs behind computation by replacing blocking MPI functions with corresponding nonblocking and persistent collective operations while maintaining legacy applications’ correctness. In earlier work, we have already demonstrated Petal’s ability to transform point-to-point MPI operations in complement to the results shown here. e contributions of this paper include the approach to collective operation transformations, a description of achieved functionality, examples of transformations, and demonstration of performance improvements obtained thus far on representative sample MPI programs. Depending on system scale and problem size, the transformations yield a speedup of up to a factor of two. is tool can be used to transform useful classes of new and legacy MPI programs to use the newest variants of MPI functions to improve performance without manual intervention for forthcoming HPC systems and updated versions of the MPI standard. © 2017 ACM.

关键词： Program compilers