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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8787卷 336-350页

作者： Han, Tao Fei, Jinlong Liu, Shengli Chen, Xi Yuefei, Zhu Zhengzhou Information Science and Technology Institute Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Image steganography has been widely used in the domain of privacy protection, such as the storage and transmission of the secret images. This paper presents a novel image-hiding scheme to embed the secret image into an innocent cover image. We use a block matching procedure to search for the best-matching block for each secret image block. Then the k-means clustering method is used to select k representative blocks for the not-well-matched secret image blocks. Moreover, the bases and indexes of the well-matched blocks together with the representative blocks are compressed by the Huffman coding. Finally, we use multi-layered syndrome-trellis codes (STC) to embed all the relevant data into multiple least significant bit (LSB) planes of the cover image. The results of experiments show that the proposed method outperforms some previous image-hiding methods. © Springer International Publishing Switzerland 2014.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

25th Annual Computational Neuroscience Meeting CNS-2016, Seogwipo City, South Korea, July 2-7, 2016 Abstracts

引用

BMC NEUROSCIENCE 2016年第1期17卷 1-112页

作者： [Anonymous] Computational Neurobiology Laboratory The Salk Institute for Biological Studies San Diego USA UNIC CNRS Gif sur Yvette France The European Institute for Theoretical Neuroscience (EITN) Paris France ATR Computational Neuroscience Laboratories Kyoto Japan Krembil Research Institute University Health Network Toronto Canada Department of Physiology University of Toronto Toronto Canada Department of Medicine (Neurology) University of Toronto Toronto Canada Department of Physics University of New Hampshire Durham USA Department of Neurophysiology Nencki Institute of Experimental Biology Warsaw Poland Department of Theory Wigner Research Centre for Physics of the Hungarian Academy of Sciences Budapest Hungary Department of Mathematical Sciences KAIST Daejoen Republic of Korea Department of Mathematics University of Houston Houston USA Department of Biochemistry & Cell Biology and Institute of Biosciences and Bioengineering Rice University Houston USA Department of Biology and Biochemistry University of Houston Houston USA Grupo de Neurocomputación Biológica Dpto. de Ingeniería Informática Escuela Politécnica Superior Universidad Autónoma de Madrid Madrid Spain Department of Biological Sciences University of Southern California Los Angeles USA Center for Neuroscience Korea Institute of Science and Technology Seoul South Korea Department of Neurology Albert Einstein College of Medicine Bronx USA Center for Neuroscience KIST Seoul South Korea Department of Neuroscience University of Science and Technology Daejon South Korea Systems Neuroscience Group QIMR Berghofer Medical Research Institute Herston Australia Department of Psychology Yonsei University Seoul South Korea Department of Psychiatry Kyung Hee University Hospital at Gangdong Seoul South Korea Department of Psychiatry Veterans Administration Boston Healthcare System and Harvard Medical School Brockton USA Department of Electrical and Electronic Engineering The University of Melbourne Parkvil

A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mitsuo Kawato F1 Precise recruitment of spiking output at theta frequencies requires dendritic h-channels in multi-compartment models of oriens-lacunosum/moleculare hippocampal interneurons Vladislav Sekulić, Frances K. Skinner F2 Kernel methods in reconstruction of current sources from extracellular potentials for single cells and the whole brains Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári F3 The synchronized periods depend on intracellular transcriptional repression mechanisms in circadian clocks. Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett, Kresimir Josić O1 Assessing irregularity and coordination of spiking-bursting rhythms in central pattern generators Irene Elices, David Arroyo, Rafael Levi, Francisco B. Rodriguez, Pablo Varona O2 Regulation of top-down processing by cortically-projecting parvalbumin positive neurons in basal forebrain Eunjin Hwang, Bowon Kim, Hio-Been Han, Tae Kim, James T. McKenna, Ritchie E. Brown, Robert W. McCarley, Jee Hyun Choi O3 Modeling auditory stream segregation, build-up and bistability James Rankin, Pamela Osborn Popp, John Rinzel O4 Strong competition between tonotopic neural ensembles explains pitch-related dynamics of auditory cortex evoked fields Alejandro Tabas, André Rupp, Emili Balaguer-Ballester O5 A simple model of retinal response to multi-electrode stimulation Matias I. Maturana, David B. Grayden, Shaun L. Cloherty, Tatiana Kameneva, Michael R. Ibbotson, Hamish Meffin O6 Noise correlations in V4 area correlate with behavioral performance in visual discrimination task Veronika Koren, Timm Lochmann, Valentin Dragoi, Klaus Obermayer O7 Input-location dependent gain modulation in cerebellar nucleus neurons Maria Psarrou, Maria Schilstra, Neil Davey, Benjamin Torben-Ni

关键词：

来源：评论

学校读者我要写书评

暂无评论

Search for heavy resonances decaying to a Z boson and a photon in pp collisions at s=13 TeV with the ATLAS detector

引用

Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy Physics 2017年 764卷 11-30页

作者： Aaboud, M. Aad, G. Abbott, B. Abdallah, J. Abdinov, O. Abeloos, B. Aben, R. AbouZeid, O.S. Abraham, N.L. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B.S. Adachi, 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. Ali, B. Aliev, M. Alimonti, G. Alison, J. Alkire, S.P. Allbrooke, B.M.M. Allen, B.W. Allport, P.P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Alshehri, A.A. Alstaty, M. 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. 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. Antel, C. Antonelli, M. Antonov, A. 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. Armitage, L.J. Arnaez, O. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Artz, S. Asai, S. Asbah, N. Ashkenazi, A. Åsman, B. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N.B. Augsten, K. Avolio, G. Axen, B. Ayoub, M.K. Azuelos, G. Baak, M.A. Baas, A.E. Baca, M.J. Bachacou, H. Bachas, K. Backes, M. Backhaus, M. Bagiacchi, P. Bagnaia, P. Bai, Y. Baines, J.T. Baker, O.K. Baldin, E.M. Balek, P. Balestri, T. Balli, F. Balunas, W.K. Banas, E. Banerjee, Sw. Bannoura, A.A.E. Barak, L. Barberio, E.L. Barberis, D. Barbero, M. Barillari, T. Barisits, M-S Barklow, T. Barlow, N. Barnes, S.L. Barnett, B.M. Barnett, R.M. Barnovska-Blenessy, Z. Baroncelli, A. Barone, G. Barr, A.J. Barranco Navarro, L. Barreiro, F. Barreiro Gui Department of Physics University of Adelaide Adelaide Australia Physics Department SUNY Albany Albany NY United States Department of Physics University of Alberta Edmonton AB Canada Department of Physics Ankara University Ankara Turkey Istanbul Aydin University Istanbul Turkey Division of Physics TOBB University of Economics and Technology Ankara Turkey LAPP CNRS/IN2P3 Université Savoie Mont Blanc Annecy-le-Vieux France High Energy Physics Division Argonne National Laboratory Argonne IL United States Department of Physics University of Arizona Tucson AZ United States Department of Physics The University of Texas at Arlington Arlington TX United States Physics Department University of Athens Athens Greece Physics Department National Technical University of Athens Zografou Greece Department of Physics The University of Texas at Austin Austin TX United States Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Institut de Física d'Altes Energies (IFAE) The Barcelona Institute of Science and Technology Barcelona Spain Institute of Physics University of Belgrade Belgrade Serbia Department for Physics and Technology University of Bergen Bergen Norway Physics Division Lawrence Berkeley National Laboratory University of California Berkeley CA United States Department of Physics Humboldt University Berlin Germany Albert Einstein Center for Fundamental Physics Laboratory for High Energy Physics University of Bern Bern Switzerland School of Physics and Astronomy University of Birmingham Birmingham United Kingdom Department of Physics Bogazici University Istanbul Turkey Department of Physics Engineering Gaziantep University Gaziantep Turkey Istanbul Bilgi University Faculty of Engineering and Natural Sciences Istanbul Turkey Bahcesehir University Faculty of Engineering and Natural Sciences Istanbul Turkey Centro de Investigaciones Universidad Antonio Narino Bogota Colombia INFN Sezione di Bologna Italy Dipartimento di Fis

This Letter presents a search for new resonances with mass larger than 250 GeV, decaying to a Z boson and a photon. The dataset consists of an integrated luminosity of 3.2 fb−1 of pp collisions collected at s=13 TeV w... 详细信息

This Letter presents a search for new resonances with mass larger than 250 GeV, decaying to a Z boson and a photon. The dataset consists of an integrated luminosity of 3.2 fb⁻¹ of pp collisions collected at s=13 TeV with the ATLAS detector at the Large Hadron Collider. The Z bosons are identified through their decays either to charged, light, lepton pairs (e⁺e⁻, μ⁺μ⁻) or to hadrons. The data are found to be consistent with the expected background in the whole mass range investigated and upper limits are set on the production cross section times decay branching ratio to Zγ of a narrow scalar boson with mass between 250 GeV and 2.75 TeV. © 2016 The Author(s)

关键词： Z bosons CROSS sections (Nuclear physics) PHOTON-photon interactions LARGE Hadron Collider (France & Switzerland) DILEPTON production NUCLEAR counters

来源：评论

学校读者我要写书评

暂无评论

A Method of Multiple Encryption and Sectional Encryption Protocol Reverse engineering

A Method of Multiple Encryption and Sectional Encryption Pro...

引用

International Conference on Computational Intelligence and Security

作者： Wei Lin Jinlong Fei Yuefei Zhu Xiaolong Shi State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan P.R. China

ISBN: (纸本)9781479974351

Research on unknown network protocol reverse engineering is of great significance in many network security applications. Currently most of methods are limited in analyzing plain-text protocols, and a few of method can partly analyze the encryption protocol which is powerless for multiple encryption protocol or sectional encryption protocol. This paper proposes a method of encrypted protocol reverse engineering based on dynamic taint analysis. The method uses Pin to record executed instructions, and then conducts off-line analysis of the data dependencies to build two taint propagation graphs on instruction and function level, then recover the decryption process. The decrypted plaintext can be located due to the decryption process feature. And then, the format of protocol can be parsed. Experiments show that the method can accurately locate the decrypted protocol data of the multiple encryption and sectional encryption protocol, and restore the original format.

关键词： Protocols Encryption Flow graphs Memory management Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

A parallel target-directed analysis method for malware behaviors

A parallel target-directed analysis method for malware behav...

引用

International Conference on Cyberspace Technology (CCT 2014)

作者： Yanfeng Qin Qingxian Wang Yongjun Zeng Qi Xi Luoyang University of Foreign Languages China State Key Laboratory of Mathematical Engineering and Advanced Computing China

ISBN: (纸本)9781510802704

To improve the efficiency of analyzing malware behaviors and increase the validity of the test data, this paper proposes a parallel target-directed analysis method for malware behaviors, which combines static analysis with concolic testing techniques. It first uses static analysis techniques to identify and locate those interactive or input points and sensitive behavior functions. Then based on the distributed platform, by combining symbolic execution and concrete dynamic execution together and taking malware sensitive behaviors as the leading target, the parallel target-directed algorithm of searching sensitive paths and the method of leading and approaching sensitive behaviors are designed. It leads to traverse the sensitive functions, obtain the sensitive paths which can reach the sensitive behavior areas by path backtracking, and generate the corresponding test data. Finally, it finishes the analysis and test of malware behaviors. Experiments show that, compared with fuzz and full paths covering and traversing technique, this method can generate test data more efficiently, reduce the number of paths to be analyzed, and improve the analysis speed and efficiency of malware behaviors.

关键词： malware parallel analysis sensitive behavior function sensitive path symbolic execution target-directed Spyware observational data Paths

来源：评论

学校读者我要写书评

暂无评论

The optimization of IF-conversion in whole function vectorization

引用

Research Journal of Applied Sciences, engineering and Technology 2014年第1期8卷 64-68页

作者： Pang, Jianmin Yue, Feng Shan, Zheng Dai, Chao Jin, Jiuzhen State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001 China

In order to get better performance, lots of optimization methods are used in code transformation. When migrating SPMD to multi-core platform, vectorization is one key optimization to improve performance. Control flow is the main challenge for vectorization and IF-conversion is usually used to transform control flow into data flow. In most researches, after IF-conversion both the two branch vector codes have to be executed even the predications in scalar lane for one branch are all false. This study proposes code bypass technology to improve this situation in whole function vectorization of SSA from. The region of consecutive instructions guarded by the same predicate is first identified. Then detecting operation is added to identify if predications in scalar lane are all false and a jump operation followed to bypass the consecutive instructions region. For loop structure, we add loop mask to indicate which lane is not alive in loop which could help to treat iteration in loop. The experiment shows our method could improve performance by 6.8%. © Maxwell Scientific Organization, 2014.

关键词： Branch IF-conversion Loop Optimization Vectorization

来源：评论

学校读者我要写书评

暂无评论

Data Dependence Constraints on SIMD Extensions

Data Dependence Constraints on SIMD Extensions

引用

2014 International Conference on Computer,Network Security and Communication engineering(CNSCE 2014)

作者： Yong-sheng HOU Rong-cai ZHAO Shi-jie YAN Xuan LI State Key Laboratory of Mathematical Engineering and Advanced Computing School of Automation and Electrical Engineering Beijing University of Science and Technology

Exploiting fine-grained data-level parallelism via SIMD(Single Instruction Multiple Data) extension instructions is a universal approach in recent decades. A parallelizing compiler with SIMD vectorization is a widespread admitted tool to utilize SIMD extensions, but it cannot exploit the inherent parallelisms of a serial program completely. In this paper, we analyze the data dependence constraints on SIMD extensions, and propose a Tarjan algorithm based SIMD vectorization detection prototype. This proposed detection prototype can recognize more inherent parallelisms of applications in practice. The experimental results show that the ability of the proposed prototype is prior to that of the ICC v10.0 compiler with respect to complicated data dependence constraints on SIMD extensions.

关键词： SIMD dependence analysis Tarjan

来源：评论

学校读者我要写书评

暂无评论

Certificateless non-interactive key exchange protocol without pairings

Certificateless non-interactive key exchange protocol withou...

引用

International Conference on Security and Cryptography (SECRYPT)

作者： Yun Wei Fushan Wei Chuangui Ma State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute Zhengzhou China

Non-interactive key exchange (NIKE) allows two parties to establish a shared key without communications. In ID-based non-interactive key exchange (ID-NIKE) protocols, private key generator (PKG) knows user's private key, so it can calculate the shared key between two participants, and most constructions of ID-NIKE need expensive pairing operation. To overcome these disadvantages, a security model of certificateless non-interactive key exchange (CL-NIKE) is proposed in this paper. And a scheme without pairings is also given. The proposed protocol is proved secure in the Random Oracle Model (ROM) based on the gap Diffie-Hellman (GDH) and computational Diffie-Hellman (CDH) problem. In the new protocol, key generation center (KGC) only knows user's partial key and is not able to calculate the shared key. Moreover, the new protocol is more efficient than the existing ID-NIKE schemes because it is pairing-free.

关键词： Protocols Games Computational modeling Public key cryptography Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

An efficient quantum meet-in-the-middle attack against NTRU-2005

引用

Chinese Science Bulletin 2013年第28期58卷 3514-3518页

作者： WANG Hong MA Zhi MA ChuanGui State Key Laboratory of Mathematical Engineering and Advanced Computing

NTRU is one of the most widely used public-key cryptosystems and its security has been an active research *** paper proposes a new way to find NTRU-2005 private *** algorithm is based on meet-in-the-middle attack and a quantum algorithm for searching the fixed weight *** with the current classical and quantum meet-in-the-middle attacks,our algorithm has lower time and space ***,this attack can also be applied against different versions of *** result can help to understand the security of NTRU better.

关键词：中间人攻击量子算法 NTRU 空间复杂度公钥密码安全性私钥搜索

来源：评论

学校读者我要写书评

暂无评论

Dynamic evolution of collective emotions in social networks: a case study of Sina weibo

引用

Science China(Information Sciences) 2013年第7期56卷 150-167页

作者： XIONG XiaoBing ZHOU Gang HUANG YongZhong CHEN HaiYong XU Ke State Key Laboratory of Mathematical Engineering and Advanced Computing State Key Laboratory of Software Development Environment Beihang University

Emotion is a fundamental object of human existence and determined by a complex set of factors. With the rapid development of online social networks (OSNs), more and more people would like to express their emotion in OSNs, which provides wonderful opportunities to gain insight into how and why individual emotion is evolved in social network. In this paper, we focus on emotion dynamics in OSNs, and try to recognize the evolving process of collective emotions. As a basis of this research, we first construct a corpus and build an emotion classifier based on Bayes theory, and some effective strategies (entropy and salience) are introduced to improve the performance of our classifier, with which we can classify any Chinese tweet into a particular emotion with an accuracy as high as 82%. By analyzing the collective emotions in our sample networks in detail, we get some interesting findings, including a phenomenon of emotion synchronization between friends in OSNs, which offers good evidence for that human emotion can be spread from one person to another. Furthermore, we find that the number of friends has strong correlation with individual emotion. Based on those useful findings, we present a dynamic evolution model of collective emotions, in which both self-evolving process and mutual-evolving process are considered. To this end, extensive simulations on both real and artificial networks have been done to estimate the parameters of our emotion dynamic model, and we find that mutual-evolution plays a more important role than self-evolution in the distribution of collective emotions. As an application of our emotion dynamic model, we design an efficient strategy to control the collective emotions of the whole network by selecting seed users according to k-core rather than degree.

关键词： online social network emotion classifier emotion spread emotion dynamic model emotion controlling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：