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

International Conference on computing, Networking and Communications

作者： Zaid Ameen Abduljabbar Hai Jin Ali A. Yassin Zaid Alaa Hussien Mohammed Abdulridha Hussain Salah H. Abbdal Deqing Zou Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology University of Basrah

ISBN: (纸本)9781467385800

A number of image/message document authentication and integrity schemes have been conducted to recognize any modification in the exchange of documents between two entities (sender and receiver) within a cloud environment. Existing solutions are based on combining key-based hash function with traditional factors (steganography, smart-card, timestamp). However, none of the proposed schemes appear to be sufficiently designed as a secure scheme to prevent common forms of attack such as replay, forgery, stolen verifier, brute force, and insider attacks. In this paper, we propose a scheme to ensure message/image document integrity for each user's login by providing one-time biometric message/image authentication code called MACLESS, which is a summation of combining the key-based hash function (MAC-SHA-1) of a message/image document and the one-time bio-key. Thereafter, MACLESS is hidden in a cover image based steganography anonymity. The proposed scheme has several important security attributes, such as phase key agreement, users' one-time bio-key, and one-time authentication code is valid only for one user's login session. Finally, security analysis and experimental results demonstrate and prove the invulnerability and efficiency of the proposed scheme.

关键词： Cloud computing MACLESS One-Time Bio-key One-Time Message/Image Document Authentication Code

来源：评论

学校读者我要写书评

暂无评论

A Novel Metadata Extraction Method for Surveillance Video

A Novel Metadata Extraction Method for Surveillance Video

引用

International Conference on computing, Networking and Communications

作者： Ran Zheng Long Chen Hai Jin Lei Zhu Qin Zhang Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9781467385800

Surveillance videos are increasing massively with monitoring cameras widely deployed in cities. Metadata of moving objects in videos can reduce video storage and be utilized in many video analysis applications. The whole metadata extraction is too time-consuming to be fulfilled quickly. Therefore, it is urgent to parallelize and accelerate the extraction process. However, iterative execution of traditional metadata extraction methods makes the parallelization quite challenging. In this paper, we propose a novel Parallel Metadata Extraction (PME) method for surveillance video. A novel video segmentation algorithm is designed to segment whole video into independent video segments. The metadata of each video segment is extracted independently and simultaneously on computer nodes, which will be integrated later to guarantee the completeness of the metadata. Performance evaluations demonstrate that PME can accelerate extraction process greatly almost without metadata loss.

关键词： Surveillance Videos Video Segmentation Metadata Extraction Iterative Execution MapReduce

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for single top-quark production via flavour-changing neutral currents at 8 TeV with the ATLAS detector

引用

The European Physical Journal C 2022年第1期82卷 1-15页

作者： Aad, G. Abbott, B. Abdallah, J. Abdinov, O. Aben, R. Abolins, M. AbouZeid, O. S. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B. S. Adamczyk, L. Adams, D. L. Adelman, J. Adomeit, S. Adye, T. Affolder, A. A. Agatonovic-Jovin, T. Agricola, J. Aguilar-Saavedra, J. A. Ahlen, S. P. Ahmadov, F. Aielli, G. Akerstedt, H. Åkesson, T. P. A. Akimov, A. V. Alberghi, G. L. Albert, J. Albrand, S. Alconada Verzini, M. J. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexander, G. Alexopoulos, T. Alhroob, M. Alimonti, G. Alio, L. Alison, J. Alkire, S. P. Allbrooke, B. M. M. Allport, P. P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Altheimer, A. Alvarez Gonzalez, B. Álvarez Piqueras, D. Alviggi, M. G. Amadio, B. T. Amako, K. Amaral Coutinho, Y. Amelung, C. Amidei, D. Amor Dos Santos, S. P. Amorim, A. Amoroso, S. Amram, N. Amundsen, G. Anastopoulos, C. Ancu, L. S. Andari, N. Andeen, T. Anders, C. F. Anders, G. Anders, J. K. Anderson, K. J. Andreazza, A. Andrei, V. Angelidakis, S. Angelozzi, I. Anger, P. Angerami, A. Anghinolfi, F. Anisenkov, A. V. Anjos, N. Annovi, A. Antonelli, M. Antonov, A. Antos, J. Anulli, F. Aoki, M. Aperio Bella, L. Arabidze, G. Arai, Y. Araque, J. P. Arce, A. T. H. Arduh, F. A. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A. J. Arnaez, O. Arnal, V. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Asai, S. Asbah, N. Ashkenazi, A. Åsman, B. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N. B. Augsten, K. Aurousseau, M. Avolio, G. Axen, B. Ayoub, M. K. Azuelos, G. Baak, M. A. Baas, A. E. Baca, M. J. Bacci, C. Bachacou, H. Bachas, K. Backes, M. Backhaus, M. Bagiacchi, P. Bagnaia, P. Bai, Y. Bain, T. Baines, J. T. Baker, O. K. Baldin, E. M. Balek, P. Balestri, T. Balli, F. Banas, E. Banerjee, Sw. Bannoura, A. A. E. Bansil, H. S. Barak, L. Barberio, E. L. Barberis, D. Barbero, M. Barillari, T. Barisonzi, M. Barklow, T. Barlow, N. Barnes, S. L. Barnett, B. M. Barnett, R. M. Barnovska, Z. Baroncelli, A. Barone, G. Barr, A. J. Barreiro, F. Barreiro Guimarães da Costa, J. Bartol CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman USA Institute of Physics Academia Sinica Taipei Taiwan Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam The Netherlands Department of Physics and Astronomy Michigan State University East Lansing USA Department of Physics University of Toronto Toronto Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene USA Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics King’s College London London UK AGH University of Science and Technology Faculty of Physics and Applied Computer Science Kraków Poland Physics Department Brookhaven National Laboratory Upton USA Department of Physics Northern Illinois University De Kalb USA Fakultät für Physik Ludwig-Maximilians-Universität München Munich Germany Particle Physics Department Rutherford Appleton Laboratory Didcot UK Oliver Lodge Laboratory University of Liverpool Liverpool UK Institute of Physics University of Belgrade Belgrade Serbia II Physikalisches Institut Georg-August-Universität Göttingen Germany Laboratório de Instrumentação e Física Experimental de Partículas-LIP Lisbon Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Department of Physics Boston University Boston USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Rome Italy Dipartimento di Fisica Università di Roma Tor Vergata Rome Italy Fysiska institutionen Lunds uni

来源：评论

学校读者我要写书评

暂无评论

Unified quantum no-go theorems and transforming of quantum states in a restricted set

arXiv

引用

arXiv 2017年

作者： Luo, Ming-Xing Li, Hui-Ran Lai, Hong Wang, Xiaojun Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu610031 China Department of Physics University of Michigan Ann ArborMI48109 United States School of Computer and Information Science Southwest University Chongqing400715 China School of Electronic Engineering Dublin City University Dublin 9 Ireland

The linear superposition principle in quantum mechanics is essential for several no-go theorems such as the no-cloning theorem, the no-deleting theorem and the no-superposing theorem. It remains an open problem of finding general forbidden principles to unify these results. In this paper, we investigate general quantum transformations forbidden or permitted by the superposition principle for various goals. First, we prove a no-encoding theorem that forbids linearly superposing of an unknown pure state and a fixed state in Hilbert space of a finite dimension. Two general forms include the no-cloning theorem, the no-deleting theorem, and the no-superposing theorem as special cases. Second, we provide a unified scheme for presenting perfect and imperfect quantum tasks (cloning and deleting) in a one-shot manner. This scheme may lead to fruitful results that are completely characterized with the linear independence of the input pure states. The generalized upper bounds for the success probability are proved. Third, we generalize a recent superposing of unknown states with fixed overlaps when multiple copies of the input states are available. Copyright © 2017, The Authors. All rights reserved.

关键词： Cloning

来源：评论

学校读者我要写书评

暂无评论

vProbe: Scheduling Virtual Machines on NUMA Systems

vProbe: Scheduling Virtual Machines on NUMA Systems

引用

IEEE International Conference on cluster computing

作者： Song Wu Huahua Sun Like Zhou Qingtian Gan Hai Jin Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781509036547

With the development of multi-core platforms andcloud computing, Non-Uniform Memory Access (NUMA) architecturehas been dominant in cloud data centers in recentyears. However, NUMA architecture is not well supported invirtualized environments. Because of the semantic gap introducedby the virtualization layer, hypervisors know little aboutthe characteristics of applications running in virtual machines (VMs). More importantly, in order to guarantee hypervisors' applicability, load balance strategies of virtual CPU (VCPU) schedulers do not consider the memory access characteristicsof applications running in VMs, which probably introducessignificant shared resource contention and unnecessary remotememory accesses. In this paper, we propose a NUMA-aware VCPU schedulerbased on Xen, named vProbe, to improve the performanceof memory-intensive applications while maintaining the transparencyof the virtualization layer in NUMA-based servers. It collects performance monitoring units (PMU) data for eachVCPU and analyzes their memory access characteristics. Then, according to the memory access characteristics of each VCPU, it periodically reassigns all memory-intensive VCPUs to eachNUMA node evenly while preferentially allocating them to theirlocal nodes, which aims to alleviate shared resource contentionand reduce unnecessary remote memory accesses. Moreover, when a physical CPU (PCPU) becomes idle, it preferentiallysteals a VCPU from the run queues of PCPUs in the local nodeto this PCPU, which helps to maintain balanced last-level cache (LLC) contention and reduce extra remote memory accesses. Our evaluation shows that vProbe can significantly improve theperformance of memory-intensive applications (e.g., up to 45.2% performance improvement compared with the Credit scheduler) while introducing negligible overheads.

关键词： Servers Phasor measurement units Virtualization Virtual machine monitors Resource management Bandwidth Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Resource Allocation in C-RAN with Mobile Cloud

Cost-Effective Resource Allocation in C-RAN with Mobile Clou...

引用

Ad-Hoc and Sensor Networks Symposium

作者： Kezhi Wang Kun Yang Xinhou Wang Chathura Sarathchandra Magurawalage School of Computer Sciences and Electrical Engineering University of Essex Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9781479966653

Taking full advantages of two cloud-based techniques, i.e., cloud radio access network (C-RAN) and mobile cloud computing (MCC), mobile operators will be able to provide the good service to the mobile user as well as increasing their revenue. This paper aims to minimize the mobile operator's cost while at the same time, meet the task time constraints of the mobile users. In particular, we assume that the mobile cloud first completes the tasks for the mobile user and then transmits the results back to the users through C-RAN. Joint cost-effective resource allocation is proposed between MCC and C-RAN and simulation results confirm that the proposed cost minimization and resource allocation solution outperforms non-optimal solutions.

关键词： C-RAN Cost-Effective Resource Allocation MCC

来源：评论

学校读者我要写书评

暂无评论

DTI changes of thalamic subregions in genetic frontotemporal dementia: findings from the GENFI cohort

引用

Alzheimer's & Dementia 2023年第S24期19卷

作者： Sonja Soskic Henry F. J. Tregidgo Emily G. Todd Arabella Bouzigues David M Cash Lucy L. Russell David L Thomas Ian B Malone John C. van Swieten Lize C. Jiskoot Harro Seelaar Barbara Borroni Daniela Galimberti Raquel Sanchez-Valle Robert Laforce Jr. Fermin Moreno Matthis Synofzik Caroline Graff Mario Masellis Carmela Tartaglia James B. Rowe Rik Vandenberghe Elizabeth Finger Fabrizio Tagliavini Alexandre Mendonca Isabel Santana Christopher R. Butler Simon Ducharme Alexander Gerhard Johannes Levin Markus Otto Sandro Sorbi Isabelle Le Ber Florence Pasquier Daniel C Alexander Juan Eugenio Iglesias Jonathan D. Rohrer Martina Bocchetta the GENetic Frontotemporal dementia Initiative (GENFI) Centre for Medical Image Computing University College London London United Kingdom SonjaSoskic Centre for Medical Image Computing University College London London United Kingdom. Dementia Research Centre Department of Neurodegenerative Disease UCL Queen Square Institute of Neurology University College London London United Kingdom UCL Centre for Medical Image Computing London United Kingdom Neuroradiological Academic Unit Department of Brain Repair and Rehabilitation UCL Queen Square Institute of Neurology University College London London United Kingdom Department of Neurology and Alzheimer Center Erasmus Medical Center Rotterdam Netherlands Centre for Neurodegenerative Disorders Neurology Unit Department of Clinical and Experimental Sciences University of Brescia Brescia Italy Department of Biomedical Surgical and Dental Sciences University of Milan Milan Italy Fondazione IRCCS Ca’ Granda Ospedale Maggiore Policlinico Milan Italy Neurology Department Hospital Clinic Institut d'Investigacions Biomediques Barcelona Spain Clinique Interdisciplinaire de Mémoire Département des Sciences Neurologiques CHU de Québec and Faculté de Médecine Université Laval Quebec City QC Canada Hospital Universitario Donostia San Sebastian Spain Division Translational Genomics of Neurodegenerative Diseases Hertie Institute for Clinical Brain Research (HIH) University of Tübingen Tübingen Germany German Center for Neurodegenerative Diseases (DZNE) Tübingen Germany Karolinska Institutet Department NVS Division of Neurogeriatrics Stockholm Sweden Unit for Hereditary Dementia Theme Inflammation and Aging Karolinska University Hospital-Solna Stockholm Sweden Campbell Cognitive Neurology Research Unit Sunnybrook Research Institute Toronto ON Canada Toronto Western Hospital Tanz Centre for Research in Neurodegenerative Disease Toronto ON Canada Department of Clinical Neurosciences and Cambridge University Hospitals NHS Trust and Medical Research Council Cognition and Brain Sci

Background Atrophy of thalamic subregions has been observed across the spectrum of frontotemporal dementia (FTD). To gain better insight into underlying tissue changes, we investigated how thalamic subregional fractional anisotropy (FA) and mean diffusivity (MD) derived from diffusion tensor imaging (DTI) are altered in genetic FTD. Method We used our newly developed thalamus segmentation tool, which jointly combines structural and diffusion input MRI data, to segment thalami and extract thalamic subregional FA and MD values for 163 genetic mutation carriers and 126 non-carriers with suitable 3T MRI data from the GENetic FTD Initiative (GENFI). Mutation carriers were divided according to their genetic diagnosis and CDR®+NACC FTLD global scores into presymptomatic/prodromal (≤0.5: 41 C9orf72 , 59 GRN , 34 MAPT ) and symptomatic (≥1: 8 C9orf72 , 11 GRN , 10 MAPT ) groups. Mean FA and MD values for thalamic subregions were obtained using diffusion tensors interpolated in the log domain and weighted by segmentation posterior probabilities. Thalamic subregional FA and MD values for presymptomatic and symptomatic mutation carriers within each genetic group were compared with non-carriers using analysis of covariance with bootstrapping, where age, scanner type, and sex were covariates. We corrected for multiple comparisons and calculated percentage changes in adjusted FA and MD mean values for mutation carriers relative to non-carriers. Result The only significant change at the presymptomatic stage was found for C9orf72 expansion carriers, who showed FA reduction in the intralaminar subregion (5%) (Figure 1, Table 1). In symptomatic C9orf72 expansion carriers, FA was reduced in the laterodorsal (21%), lateral posterior (13%), anteroventral (13%) and intralaminar (11%) subregions. Symptomatic MAPT mutation carriers also showed FA reduction in the laterodorsal (15%) and anteroventral (11%) subregions. No significant FA reductions were found for GRN mutation carriers and no s

关键词：

来源：评论

学校读者我要写书评

暂无评论

Conch: A Cyclic MapReduce Model for Iterative Applications

Conch: A Cyclic MapReduce Model for Iterative Applications

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Ran Zheng Genmao Yu Hai Jin Xuanhua Shi Qin Zhang Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

MapReduce programming model is a popular model to simplify but speed up data parallel applications. However, it is not efficient for iterative applications because of its repeated data transmission with HDFS (Hadoop Distributed File System). Conch, a cyclic MapReduce model, is designed for efficient processing of iterative applications. In order to minimize network overhead, shared data is cached locally and a "map-shuffle" phase is presented with a combined transmission mechanism. Meanwhile, a prediction scheduler for iterative applications is brought out to achieve better data locality in terms of runtime information. The experiments show that Conch can support iterative applications transparently and efficiently. Compared with Hadoop and HaLoop in single-job environment, Conch can achieve 13%-17% improvements on K-Means and fuzzy C-Means. Especially in multi-job environment, 63.6% and 28.6% improvements can be obtained compared with Hadoop and HaLoop.

关键词： Delays Iterative methods Computational modeling Prediction algorithms Heart beat Data transfer Data models

来源：评论

学校读者我要写书评

暂无评论

Improving the memory efficiency of in-memory mapreduce based HPC systems 1

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Pei, Cheng Shi, Xuanhua Jin, Hai Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In-memory cluster computing systems based MapReduce, such as Spark, have made a great impact in addressing all kinds of big data problems. Given the overuse of memory speed, which stems from avoiding the latency caused by disk I/O operations, some process designs may cause resource inefficiency in traditional high performance computing (HPC) systems. Hash-based shuffle, particularly large-scale shuffle, can significantly affect job performance through excessive file operations and unreasonable use of memory. Some intermediate data unnecessarily overflow to the disk when memory usage is unevenly distributed or when memory runs out. Thus, in this study, Write Handle Reusing is proposed to fully utilize memory in shuffle file writing and reading. Load Balancing Optimizer is introduced to ensure the even distribution of data processing across all worker nodes, and Memory-Aware Task Scheduler that coordinates concurrency level and memory usage is also developed to prevent memory spilling. Experimental results on representative workloads demonstrate that the proposed approaches can decrease the overall job execution time and improve memory efficiency. © Springer International Publishing Switzerland 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Communication Cost Efficient Virtualized Network Function Placement for Big Data Processing

Communication Cost Efficient Virtualized Network Function Pl...

引用

IEEE Conference on computer Communications Workshops

作者： Lin Gu Sheng Tao Deze Zeng Hai Jin Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science China University of Geosciences Wuhan Hubei China

ISBN: (纸本)9781467399562

The data explosion in the emerging big data era imposes a big burden on the network infrastructure. This vision has urged the evolution of computer networks. By softwarizing traditional dedicated hardware based functions to virtualized network function (VNF) that can run on standard commodity servers, network function virtualization (NFV) technology promises increased networking efficiency, flexibility and scalability. From the perspective of network service providers, with the consideration of big data traffic volume, one primary concern is on the communication cost, which is highly influenced by the VNF placement strategy. In this paper, we are motivated to investigate the issue on communication cost efficient VNF placement problem for big data processing, with joint consideration of network flow balancing and the predetermined network service semantics. We formulate this problem into a mixed-integer linear programming (MILP) form and then propose a low-complexity relaxation-based heuristic algorithm accordingly. The high efficiency of our proposal is validated by extensive simulation studies.

关键词： Noise measurement Big data Distributed databases Algorithm design and analysis Servers Heuristic algorithms Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：