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

3rd ACM Information Hiding and Multimedia Security Workshop, IH and MMSec 2015

作者： Song, Xiaofeng Liu, Fenlin Yang, Chunfang Luo, Xiangyang Zhang, Yi State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China Zhengzhou Information Science and Technology Institute Zhengzhou450001 China Zhengzhou Information Science and Technology Institute China State Key Laboratory of Information Assurance Beijing100072 China

ISBN: (纸本)9781450335874

Adaptive JPEG steganographic schemes are difficult to preserve the image texture features in all scales and orientations when the embedding changes are constrained to the complicated texture regions, then a steganalysis feature extraction method is proposed based on 2 dimensional (2D) Gabor filters. The 2D Gabor filters have certain optimal joint localization properties in the spatial domain and in the spatial frequency domain. They can describe the image texture features from different scales and orientations, therefore the changes of image statistical characteristics caused by steganography embedding can be captured more effectively. For the proposed feature extraction method, the decompressed JPEG image is filtered by 2D Gabor filters with different scales and orientations firstly. Then, the histogram features are extracted from all the filtered ***, the ensemble classifier is used to assemble the proposed steganalysis feature as well as the final steganalyzer. The experimental results show that the proposed steganalysis feature can achieve a competitive performance by comparing with the other steganalysis features when they are used for the detection performance of adaptive JPEG steganography such as UED, JUNIWARD and SI-UNIWARD. © 2015 ACM.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

All-sky search for short gravitational-wave bursts in the third advanced LIGO and advanced Virgo run

引用

Physical Review D 2021年第12期104卷 122004-122004页

作者： R. Abbott T. D. Abbott F. Acernese K. Ackley C. Adams N. Adhikari R. X. Adhikari V. B. Adya C. Affeldt D. Agarwal M. Agathos K. Agatsuma N. Aggarwal O. D. Aguiar L. Aiello A. Ain P. Ajith T. Akutsu S. Albanesi A. Allocca P. A. Altin A. Amato C. Anand S. Anand A. Ananyeva S. B. Anderson W. G. Anderson M. Ando T. Andrade N. Andres T. Andrić S. V. Angelova S. Ansoldi J. M. Antelis S. Antier S. Appert Koji Arai Koya Arai Y. Arai S. Araki A. Araya M. C. Araya J. S. Areeda M. Arène N. Aritomi N. Arnaud S. M. Aronson K. G. Arun H. Asada Y. Asali G. Ashton Y. Aso M. Assiduo S. M. Aston P. Astone F. Aubin C. Austin S. Babak F. Badaracco M. K. M. Bader C. Badger S. Bae Y. Bae A. M. Baer S. Bagnasco Y. Bai L. Baiotti J. Baird R. Bajpai M. Ball G. Ballardin S. W. Ballmer A. Balsamo G. Baltus S. Banagiri D. Bankar J. C. Barayoga C. Barbieri B. C. Barish D. Barker P. Barneo F. Barone B. Barr L. Barsotti M. Barsuglia D. Barta J. Bartlett M. A. Barton I. Bartos R. Bassiri A. Basti M. Bawaj J. C. Bayley A. C. Baylor M. Bazzan B. Bécsy V. M. Bedakihale M. Bejger I. Belahcene V. Benedetto D. Beniwal T. F. Bennett J. D. Bentley M. BenYaala F. Bergamin B. K. Berger S. Bernuzzi C. P. L. Berry D. Bersanetti A. Bertolini J. Betzwieser D. Beveridge R. Bhandare U. Bhardwaj D. Bhattacharjee S. Bhaumik I. A. Bilenko G. Billingsley S. Bini R. Birney O. Birnholtz S. Biscans M. Bischi S. Biscoveanu A. Bisht B. Biswas M. Bitossi M.-A. Bizouard J. K. Blackburn C. D. Blair D. G. Blair R. M. Blair F. Bobba N. Bode M. Boer G. Bogaert M. Boldrini L. D. Bonavena F. Bondu E. Bonilla R. Bonnand P. Booker B. A. Boom R. Bork V. Boschi N. Bose S. Bose V. Bossilkov V. Boudart Y. Bouffanais A. Bozzi C. Bradaschia P. R. Brady A. Bramley A. Branch M. Branchesi J. E. Brau M. Breschi T. Briant J. H. Briggs A. Brillet M. Brinkmann P. Brockill A. F. Brooks J. Brooks D. D. Brown S. Brunett G. Bruno R. Bruntz J. Bryant T. Bulik H. J. Bulten A. Buonanno R. Buscicchio D. Buskulic C. Buy R. L. Byer L. Cadonati G. Cagnoli C. Cahillane J. Calderón Bustillo J. D. Callagh LIGO Laboratory California Institute of Technology Pasadena California 91125 USA Louisiana State University Baton Rouge Louisiana 70803 USA Dipartimento di Farmacia Università di Salerno I-84084 Fisciano Salerno Italy INFN Sezione di Napoli Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy OzGrav School of Physics and Astronomy Monash University Clayton 3800 Victoria Australia LIGO Livingston Observatory Livingston Louisiana 70754 USA University of Wisconsin-Milwaukee Milwaukee Wisconsin 53201 USA OzGrav Australian National University Canberra Australian Capital Territory 0200 Australia Max Planck Institute for Gravitational Physics (Albert Einstein Institute) D-30167 Hannover Germany Leibniz Universität Hannover D-30167 Hannover Germany Inter-University Centre for Astronomy and Astrophysics Pune 411007 India University of Cambridge Cambridge CB2 1TN United Kingdom Theoretisch-Physikalisches Institut Friedrich-Schiller-Universität Jena D-07743 Jena Germany University of Birmingham Birmingham B15 2TT United Kingdom Center for Interdisciplinary Exploration and Research in Astrophysics (CIERA) Northwestern University Evanston Illinois 60208 USA Instituto Nacional de Pesquisas Espaciais 12227-010 São José dos Campos São Paulo Brazil Gravity Exploration Institute Cardiff University Cardiff CF24 3AA United Kingdom INFN Sezione di Pisa I-56127 Pisa Italy International Centre for Theoretical Sciences Tata Institute of Fundamental Research Bengaluru 560089 India Gravitational Wave Science Project National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan INFN Sezione di Torino I-10125 Torino Italy Università di Napoli “Federico II ” Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy Université de Lyon Université Claude Bernard Lyon 1 CNRS Institut Lumière Matière F-69622 Villeurbanne Franc

This paper presents the results of a search for generic short-duration gravitational-wave transients in data from the third observing run of advanced LIGO and advanced Virgo. Transients with durations of milliseconds to a few seconds in the 24–4096 Hz frequency band are targeted by the search, with no assumptions made regarding the incoming signal direction, polarization, or morphology. Gravitational waves from compact binary coalescences that have been identified by other targeted analyses are detected, but no statistically significant evidence for other gravitational wave bursts is found. Sensitivities to a variety of signals are presented. These include updated upper limits on the source rate density as a function of the characteristic frequency of the signal, which are roughly an order of magnitude better than previous upper limits. This search is sensitive to sources radiating as little as ∼10−10 M⊙c2 in gravitational waves at ∼70 Hz from a distance of 10 kpc, with 50% detection efficiency at a false alarm rate of one per century. The sensitivity of this search to two plausible astrophysical sources is estimated: neutron star f modes, which may be excited by pulsar glitches, as well as selected core-collapse supernova models.

关键词： Gravitational wave sources Gravitational waves

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Open-access quantitative MRI data of the spinal cord and reproducibility across participants, sites and manufacturers

引用

Scientific data 2021年第1期8卷 242页

作者： Julien Cohen-Adad Eva Alonso-Ortiz Mihael Abramovic Carina Arneitz Nicole Atcheson Laura Barlow Robert L Barry Markus Barth Marco Battiston Christian Büchel Matthew Budde Virginie Callot Anna J E Combes Benjamin De Leener Maxime Descoteaux Paulo Loureiro de Sousa Marek Dostál Julien Doyon Adam Dvorak Falk Eippert Karla R Epperson Kevin S Epperson Patrick Freund Jürgen Finsterbusch Alexandru Foias Michela Fratini Issei Fukunaga Claudia A M Gandini Wheeler-Kingshott Giancarlo Germani Guillaume Gilbert Federico Giove Charley Gros Francesco Grussu Akifumi Hagiwara Pierre-Gilles Henry Tomáš Horák Masaaki Hori James Joers Kouhei Kamiya Haleh Karbasforoushan Miloš Keřkovský Ali Khatibi Joo-Won Kim Nawal Kinany Hagen H Kitzler Shannon Kolind Yazhuo Kong Petr Kudlička Paul Kuntke Nyoman D Kurniawan Slawomir Kusmia René Labounek Maria Marcella Laganà Cornelia Laule Christine S Law Christophe Lenglet Tobias Leutritz Yaou Liu Sara Llufriu Sean Mackey Eloy Martinez-Heras Loan Mattera Igor Nestrasil Kristin P O'Grady Nico Papinutto Daniel Papp Deborah Pareto Todd B Parrish Anna Pichiecchio Ferran Prados Àlex Rovira Marc J Ruitenberg Rebecca S Samson Giovanni Savini Maryam Seif Alan C Seifert Alex K Smith Seth A Smith Zachary A Smith Elisabeth Solana Y Suzuki George Tackley Alexandra Tinnermann Jan Valošek Dimitri Van De Ville Marios C Yiannakas Kenneth A Weber Ii Nikolaus Weiskopf Richard G Wise Patrik O Wyss Junqian Xu NeuroPoly Lab Institute of Biomedical Engineering Polytechnique Montreal Montreal QC Canada. jcohen@polymtl.ca. Functional Neuroimaging Unit CRIUGM Université de Montréal Montreal QC Canada. jcohen@polymtl.ca. Mila - Quebec AI Institute Montreal QC Canada. jcohen@polymtl.ca. NeuroPoly Lab Institute of Biomedical Engineering Polytechnique Montreal Montreal QC Canada. Department of Radiology Swiss Paraplegic Centre Nottwil Switzerland. Centre for Advanced Imaging The University of Queensland Brisbane Australia. Department of Radiology University of British Columbia Vancouver BC Canada. Athinoula A. Martinos Center for Biomedical Imaging Department of Radiology Massachusetts General Hospital Charlestown MA USA. Department of Radiology Harvard Medical School Boston MA USA. Harvard-Massachusetts Institute of Technology Health Sciences & Technology Cambridge MA USA. School of Information Technology and Electrical Engineering The University of Queensland Brisbane Australia. NMR Research Unit Queen Square MS Centre UCL Queen Square Institute of Neurology Faculty of Brain Sciences University College London London UK. Department of Systems Neuroscience University Medical Center Hamburg-Eppendorf Hamburg Germany. Department of Neurosurgery Medical College of Wisconsin Milwaukee WI USA. Aix-Marseille Univ CNRS CRMBM Marseille France. APHM Hopital Universitaire Timone CEMEREM Marseille France. Vanderbilt University Institute of Imaging Science Vanderbilt University Medical Center Nashville TN USA. Department of Computer and Software Engineering Polytechnique Montreal Montreal Canada. CHU Sainte-Justine Research Centre Montreal QC Canada. Centre de Recherche CHUS CIMS Sherbrooke Canada. Sherbrooke Connectivity Imaging Lab (SCIL) Computer Science department Université de Sherbrooke Sherbrooke Canada. Université de Strasbourg CNRS ICube Strasbourg France. UHB - University Hospital Brno and Masaryk University Department of Radiology and Nuclear

来源：评论

学校读者我要写书评

暂无评论

An Automatic Reassembly Model and Algorithm of Log File Fragments Based on Graph Theory

An Automatic Reassembly Model and Algorithm of Log File Frag...

引用

2015 6th IEEE International Conference on Software engineering and Service Science(ICSESS 2015)

作者： Shuai Yi Xueli Hu Hao Wu Information Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing

Automatic reassembly of log file fragments from a collection of mixed fragments is one of the most important process during log file carving. In this paper we propose a general process model and design an algorithm based on graph theory for automatic reassembly of log file fragments. Finally, an experiment is designed and explored and results demonstrated the validity of the proposed model and algorithm.

关键词： file carve log file reassembly file recovery graph theory

来源：评论

学校读者我要写书评

暂无评论

Data layout transformation for structure vectorization on SIMD architectures

Data layout transformation for structure vectorization on SI...

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Peng-yuan Li Qing-hua Zhang Rong-cai Zhao Hai-ning Yu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Structure references are commonly-used at the core of applications in a multitude of domains such as image processing, signal processing, especially the scientific and engineering applications. SIMD instruction sets, as SSE, AVX, AltiVec and 3DNow, provide a promising and widely available avenue for enhancing performance on modern processors. However existing memory accessing shackles limit the achieved performance for structure reference on modern SIMD architectures. In this paper, we propose a novel data layout transformation technology that addresses the accessing obstacles, along with a static analysis technique for detecting the legal loops in where this transformation is suitable. And this approach is implemented in the Optimizing Compiler Open64. The experimental results show that the proposed method can translate application with structure access into vectorizable codes, thereby advancing the execution efficiency adequately.

关键词： Decision support systems Arrays Layout Switches Indexes Transforms Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

SIMD vectorization of nested loop based on strip mining

SIMD vectorization of nested loop based on strip mining

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Jinlong Xu Huihui Sun Rongcai Zhao State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

The difference between vector machine and SIMD extension is analyzed at the very start. The multilevel loop vector code generation algorithm termed Codegen put forward by Kennedy and other fellows can't be directly applied to SIMD extension as it is oriented to vector machine. The vectorization algorithm in state-of-the-art compilers can only process one level of nested loop. In order to vectorize the entire nested loop, a vectorization algorithm based on strip mining called simdcodegen is proposed. Firstly, the formation reason of dependence circles is analyzed and the role of strip mining played in elimination of dependence circles is discussed. Then on the basis of codegen, strip mining is applied on each level of the loop recursively to explore the SIMD parallelism in the nested loop. Although strip mining is always legitimate, the executing cost increases after strip mining. To assure that strip mining is beneficial, that is to say, strip mining can break some dependence circles, cycle broken test is applied before implementation of strip mining. Effectiveness of this method is verified by the experimental results.

关键词： Strips Support vector machines Parallel processing Data mining Fellows Registers Data processing

来源：评论

学校读者我要写书评

暂无评论

Distributed key revocation scheme based on shared binary tree

Distributed key revocation scheme based on shared binary tre...

引用

IEEE International Conference on Progress in Informatics and computing (PIC)

作者： Shaoren Wang Xuehui Du Zhi Yang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Concerning the identity-based binary tree key revocation scheme, the storage and use of binary tree can not be guaranteed in open cloud environment. This paper proposes a distributed key revocation scheme based on shared binary tree. The scheme splits the binary key tree into branches and distributes them to multiple nodes to save. Then multiple nodes work together to rebuild the key. At the same time, this paper optimizes the lookup algorithm during rebuilding. It solves the issues on distributed storage, safe use and fast reconstruction of the binary tree in the open environment. Experiments and analysis show that the scheme has higher efficiency and makes identity-based key revocation scheme run safely in the open environment.

关键词： Peer-to-peer computing Cryptography

来源：评论

学校读者我要写书评

暂无评论

Improving Steganalysis by Fusing SVM Classifiers for JPEG Images

Improving Steganalysis by Fusing SVM Classifiers for JPEG Im...

引用

International Conference on Computer Science and Mechanical Automation (CSMA)

作者： Peiqing Liu Fenlin Liu Chunfang Yang Xiaofeng Song State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781467391672

As the present fusing strategies cannot utilize the correlation of different detection results for image steganography effectively, a steganalysis method is proposed based on fusing SVM classifiers. Firstly, different feature subsets are used for the training of SVM classifiers. Secondly, the detection results of multi-classifiers are utilized to train a fusing classifier, the fusing classifier can learn the correlation and diversity of detection results of sub-classifiers. From the experimental result, it can be seen that the proposed steganalysis method can achieve better detection performance for J-UNIWARD steganography compared with voting and Bayesian methods.

关键词： Feature extraction Discrete cosine transforms Support vector machines Training Correlation Transform coding Bayes methods

来源：评论

学校读者我要写书评

暂无评论

Web Service QoS Prediction with Adaptive Calibration

Web Service QoS Prediction with Adaptive Calibration

引用

International Conference on Computer Sciences and Applications (CSA)

作者： Guo-Sheng Li Na Wang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479999620

Web services QoS (Quality of Service) prediction in dynamic environment is a critical method to support service selection and service composition. The existing QoS prediction methods focus on the user-side QoS but not the server-side. However, the prediction accuracy of QoS prediction methods for user-side QoS are restricted by the subjectivity of user's feedback, while the server-side QoS prediction methods could get higher prediction accuracy with relying on objective QoS measured value. To this end, we purposed a server-side QoS prediction method for Web service dubbed QoSPAC. Based on Kalman Filter, QoSPAC generates the QoS predicted value and uses the QoS measured value to calibrate it. Furthermore, QoSPAC measures the prediction accuracy, which is also used to calibrate and optimize the prediction period. Experimental results demonstrate that QoSPAC can adapt to the noteworthy measurement error, and can significantly improve the prediction accuracy compared with the conventional technology.

关键词： Quality of service Web services Noise measurement Covariance matrices Time measurement Calibration Q measurement

来源：评论

学校读者我要写书评

暂无评论

Discussion on heuristic teaching method for arithmetic unit design

Discussion on heuristic teaching method for arithmetic unit ...

引用

International Conference on Computer Science & Education (ICCSE)

作者： Qingbao Li Ping Zhang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479966011

Arithmetic unit design has been one of the important and difficult parts in teaching of principles of computer organization course and is hard for students to understand and master. Because teaching of arithmetic unit design is usually began with examining the process of computer arithmetic, many students are apt to think it as numerical calculation and don't really understand the main idea in computer design of simplification, normalization and rapid processing. In this paper, we reveal the basic idea of computer arithmetic unit design by the analysis of data representation and the process of calculation, taking addition, subtraction and multiplication as example. Based on the background of our many years' teaching and research, we discuss some effective heuristic methods in teaching of arithmetic unit design.

关键词： Computer science Education

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：