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

7th International Green and Sustainable Computing Conference, IGSC 2016

作者： Xue, Pei Li, Tao Dong, Han Liu, Chunbo Ma, Wenjing Pei, Songwen College of Computer and Control Engineering Nankai University Tianjin300071 China Information Security Evaluation Center Civil Aviation University of China Tianjin300300 China Laboratory of Parallel Software and Computational Science State Key Laboratory of Computing Science Institute of Software CAS Beijing China Shanghai Key Lab of Modern Optical Systems Department of Computer Science and Engineering University of Shanghai for Science and Technology Shanghai200093 China

ISBN: (纸本)9781509051175

Encryption algorithms are applied to a variety of fields and the security of encryption algorithms depends heavily on the computational infeasibility of exhaustive key-space search. RC4 algorithm has an extensive application for stream encryption, however, the disadvantages of traditional RC4 serial algorithm are large computational quantity and slow computation speed, which means a great challenge for throughput of computing system. Graphics processors recently have been widely used as accelerators for high throughput computing. In this paper, GPU is used to improve the efficiency and performance of attacking RC4 algorithm. First, we revised RC4 algorithm to make it easier to parallelize on a GPU. Then we take advantage of constant memory and shared memory in GPU to search the key space of RC4 algorithm efficiently. Besides, we solved the bank conflict problem in shared memory to further improve the performance. Our approach was evaluated in the whole key space of 40-bit, and the results show it can complete searching of the whole key space within 12.8 hours. © 2016 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

How AD can help solve differential-algebraic equations

arXiv

引用

arXiv 2017年

作者： Pryce, John D. Nedialkov, Nedialko S. Tan, Guangning Li, Xiao Cardiff University School of Mathematics Senghennydd Rd CardiffCF24 4AG United Kingdom McMaster University Department of Computing & Software HamiltonL8S 4K1 Canada Massachusetts Institute of Technology Process Systems Engineering Laboratory Boston United States McMaster University School of Computational Science and Engineering HamiltonL8S 4K1 Canada

A characteristic feature of differential-algebraic equations is that one needs to find derivatives of some of their equations with respect to time, as part of so called index reduction or regularisation, to prepare them for numerical solution. This is often done with the help of a computer algebra system. We show in two significant cases that it can be done efficiently by pure algorithmic differentiation. The first is the Dummy Derivatives method;here we give a mainly theoretical description, with tutorial examples. The second is the solution of a mechanical system directly from its Lagrangian formulation. Here we outline the theory and show several non-trivial examples of using the "Lagrangian facility" of the Nedialkov-Pryce initial-value solver DAETS, namely: a spring-mass-multipendulum system;a prescribed-trajectory control problem;and long-time integration of a model of the outer planets of the solar system, taken from the DETEST testing package for ODE solvers. Copyright © 2017, The Authors. All rights reserved.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

An Experimental Comparison of Some LLL-Type Lattice Basis Reduction Algorithms

引用

International Journal of Applied and computational Mathematics 2015年第3期1卷 327-342页

作者： Papachristoudis, Dimitris G. Halkidis, Spyros T. Stephanides, George Computational Systems and Software Engineering Laboratory Department of Applied Informatics University of Macedonia Egnatia 156 Thessaloniki 54006 Greece

In this paper we experimentally compare the performance of the L 2 lattice basis reduction algorithm, whose importance recently became evident, with our own Gram-based lattice basis reduction algorithm, which is a var... 详细信息

In this paper we experimentally compare the performance of the L ² lattice basis reduction algorithm, whose importance recently became evident, with our own Gram-based lattice basis reduction algorithm, which is a variant of the Schnorr–Euchner algorithm. We conclude with observations about the algorithms under investigation for lattice basis dimensions up to the theoretical limit. We also reexamine the notion of “buffered transformations” and its impact on performance of lattice basis reduction algorithms. We experimentally compare four different algorithms directly in the Sage Mathematics software: our own algorithm, the L ² algorithm and “buffered” versions of them resulting in a total of four algorithms. © 2015, Springer India Pvt. Ltd.

关键词： Buffered transformations L 2 Lattice basis reduction LLL

来源：评论

学校读者我要写书评

暂无评论

Online Machine Learning for Big Data Analytics by Cognitive Robots

Online Machine Learning for Big Data Analytics by Cognitive ...

引用

2016 IEEE International Conference of Online Analysis and Computing Science(ICOACS 2016)

作者： Yingxu Wang FICIC FWIF Information Systems Lab Stanford University Laboratory for Computational Intelligence Denotational Mathematicsand Software Science Dept.of Electrical and Computer EngineeringSchulich School of Engineering and Hotchkiss Brain InstituteUniversity of Calgary

It is recognized that both sources of and solutions to the big data challenges are human collective *** are an abstract representation of the quantity of realistic entities and perceived *** data play an indispensable role not only in a wide range of engineering applications,but also in the cognitive mechanisms of both humans and cognitive robots such as sensation,quantification,qualification,estimation,memory,and *** keynote lecture presents online big data analytic theories by machine learning as well as knowledge extraction by cognitive ***,information,knowledge,and intelligence are the four hierarchical layers of cognitive objects in the brain and cognitive systems from the bottom *** is discovered by the author that,although the cognitive unit of data is bit,that of knowledge is bir,i.e.,a binary relation.A resent finding towards big data science is that big data systems in nature are a recursive ndimensional typed hyperstructure(RNDTHS).This topological property of big data reveals that the mathematical foundation of big data science is underpinned by big data algebra(BDA),which is a denotational mathematical structure for efficiently dealing with the inherited complexities and unprecedented challenges in big data *** leads to a coherent theory for big data modeling,analyses,mining,information elicitation,knowledge extraction,and intelligent generation for cognitive *** experiments demonstrate that cognitive robots may autonomously transform big data in vast linguistic databases(corpuses) into sophistic knowledge bases by cognitive machine learning.

关键词： Big data big data science denotational mathematics mathematical models recursively hierarchical hyperstructures big data algebra cogniitve machine learning formal concepts knowledge extraction knowledge generation cognitive informatics cognitive computing computational intelligence applications

来源：评论

学校读者我要写书评

暂无评论

Experiments on the supervised learning algorithm for formal concept elicitation by cognitive robots

Experiments on the supervised learning algorithm for formal ...

引用

IEEE International Conference on Cognitive Informatics

作者： Omar A. Zatarain Yingxu Wang Laboratory for Computational Intelligence Denotational Mathematics and Software Science International Institute of Cognitive Informatics and Cognitive Computing (ICIC) Schulich School of Engineering and Hotchkiss Brain Institute University of Calgary Calgary Alberta Canada Information Systems Lab Stanford University Stanford CA USA

ISBN: (纸本)9781509038473

Concept elicitation is a fundamental methodology for knowledge extraction and representation in cognitive robot learning. Traditional machine learning technologies deal with object identification, cluster classification, functional regression, and behavior acquisition. This paper presents a supervised machine knowledge learning methodology for concept elicitation from sample dictionaries in natural languages. Formal concepts are autonomously generated based on collective intention of attributes and collective extension of objects elicited from informal definitions in dictionaries. A system of formal concept generation for a cognitive robot is implemented by the Algorithm of Machine Concept Elicitation (AMCE) in MATLAB. Experiments on machine learning for creating a set of twenty formal concepts reveal that the cognitive robot is able to learn synergized concepts in human knowledge in order to build its own cognitive knowledge base. The results of machine-generated concepts demonstrate that the AMCE algorithm can over perform human knowledge expressions in dictionaries in terms of relevance, accuracy, quantitativeness, and cohesiveness.

关键词： Algebra Handheld computers Writing Instruments Animals Semantics

来源：评论

学校读者我要写书评

暂无评论

A separability-entanglement classifier via machine learning

arXiv

引用

arXiv 2017年

作者： Lu, Sirui Huang, Shilin Li, Keren Li, Jun Chen, Jianxin Lu, Dawei Ji, Zhengfeng Shen, Yi Zhou, Duanlu Zeng, Bei Department of Physics Tsinghua University Beijing100084 China Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Institute for Interdisciplinary Information Sciences Tsinghua University Beijing100084 China Beijing Computational Science Research Center Beijing100193 China Department of Mathematics & Statistics University of Guelph GuelphONN1G 2W1 Canada Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD United States Department of Physics Southern University of Science and Technology Shenzhen518055 China Centre for Quantum Computation & Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Department of Statistics and Actuarial Science University of Waterloo WaterlooONN2L 3G1 Canada Institute of Physics Chinese Academy of Sciences Beijing100190 China

The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial transpose (PPT) criterion and the k-symmetric extendibility criterion to tackle this problem in practice, none of them enables a general, effective solution to the problem even for small dimensions. Explicitly, separable states form a high-dimensional convex set, which exhibits a vastly complicated structure. In this work, we build a new separability-entanglement classifier underpinned by machine learning techniques. Our method outperforms the existing methods in generic cases in terms of both speed and accuracy, opening up the avenues to explore quantum entanglement via the machine learning approach. Copyright © 2017, The Authors. All rights reserved.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

A fully implicit method for lattice boltzmann equations

A fully implicit method for lattice boltzmann equations

引用

作者： Huang, Jizu Yang, Chao Cai, Xiao-Chuan Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Institute of Software Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Computer Science Beijing100190 China Department of Computer Science University of Colorado Boulder BoulderCO80309 United States

Existing approaches for solving the lattice Boltzmann equations with finite difference methods are explicit and semi-implicit;both have certain stability constraints on the time step size. In this work, a fully implicit second-order finite difference scheme is developed. We focus on a parallel, highly scalable, Newton-Krylov-RAS algorithm for the solution of a large sparse nonlinear system of equations arising at each time step. Here, RAS is a restricted additive Schwarz preconditioner based on a first-order spatial discretization. We show numerically that by using the fully implicit method the time step size is no longer constrained by the CFL condition, and the Newton-Krylov- RAS algorithm is scalable on a supercomputer with more than ten thousand processors. Moreover, to calculate the steady state solution we investigate an adaptive time stepping strategy. The total compute time required by the implicit method with adaptive time stepping is much smaller than that of an explicit method for several test cases. © 2015 Society for Industrial and Applied Mathematics.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

26th Annual computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

Latest Advances in Theories and Applications of Cognitive Robotics and Brain-Inspired systems

Latest Advances in Theories and Applications of Cognitive Ro...

引用

2015 IEEE Advanced Information Technology,Electronic and Automation Control Conference(IAEAC 2015)

作者： YingXU Wang International Institute of Cognitive Informatics and Cognitive Computing(ICIC) Laboratory for Computational Intelligence Cognitive Systemsand Software Science Dept.of Electrical and Computer Engineering Schulich School of Engineering and Hotchkiss Brain Institute University of Calgary

In the new era of intelligence revolution beyond information and computing revolutions,a brain-like intelligent system is emerging known as cognitive robots.A cognitive robot is an autonomous system that is capable of perception,learning,and inference mimicking the cognitive mechanisms of the brain by computational *** robotics is a discipline that studies theories,mathematical means,implementations,and engineering applications of cognitive *** theoretical foundations of cognitive robotics are underpinned in brain science,cognitive science,abstract intelligence,knowledge science,intelligence science,cognitive linguistics,and denotational *** keynote lecture presents the latest advances in theories and applications of cognitive robotics and brain-inspired *** theoretical framework of cognitive robotics and its denotational mathematical means such as concept algebra,semantic algebra,behavioral process algebra,and inference algebra are *** challenges in cognitive robotics are formally studied on what the necessary and sufficient intelligent behaviors of cognitive robots are,and what distinguish the intelligent capabilities of cognitive robots from their imperative *** structural and functional models of cognitive robots are explored at the intelligent layers of imperative,autonomic,and cognitive *** progress in cognitive robotics has led to the development of cognitive systems,nextgeneration computers,and cognitive machine learning engines,as well as the growth of contemporary knowledge-based industries.

关键词： Cognitive robotics cognitive informatics cognitive computing abstract intelligence computational intelligence denotational mathematics concept algebra semantic algebra brain science neuroinformatics cognitive machine learning cognitive knowledge base artificial intelligence and cognitive systems

来源：评论

学校读者我要写书评

暂无评论

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

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：