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

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

关键词：

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of the centralized channel allocation strategy in cognitive radio networks

引用

ICIC Express Letters 2013年第7期7卷 2189-2196页

作者： Dai, Yu Jin, Shunfu Meng, Chao College of Information Science and Engineering Yanshan University No. 438 Hebei Ave Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao 066004 China

Based on the centralized channel allocation strategy in the Cognitive Radio networks, considering the opportunistic channel access for Secondary Users, a discretetime queueing model with a general transmission time and possible transmission interruption is established. By using the method of an embedded Markov chain, the system model is analyzed in steady state, and the performance metrics in terms of the average latency, the throughput for the Secondary User, the channel switching ratio and the channel utilization are given accordingly. Analysis results and simulation experiments are provided to investigate the influence of the traffic load for the Secondary User and the arrival rate for the Primary User packets on the system performance. © 2013 ICIC International.

关键词： Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

A Centrality Estimation Method Based on Hidden Markov Model in Social Delay Tolerant networks

A Centrality Estimation Method Based on Hidden Markov Model ...

引用

2013 22nd Wireless and Optical Communication Conference

作者： Yongfeng Huang Yongqiang Dong Sanfeng Zhang Guoxin Wu School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education

ISBN: (纸本)9781467356985

Complex network analysis method has recently been proposed to solve the problem of contact prediction in Delay Tolerant networks(DTNs).Centrality Estimation remains as an important issue in such *** schemes such as single window and cumulative window centrality estimation,however,can not predict the node contact capability accurately due to the fact that the messages always have a specific lifetime associated with *** this paper we proposes a new centrality estimation method based on simplified Hidden Markov Model(HMM) to address this *** historical and current centrality information is used to compute the comparative centrality of two encountering nodes before the expiration of a *** results based on real traces show that our approach outperforms the existing schemes in terms of estimation accuracy,leading to significant improvement on delivery efficiency.

关键词： Centrality,Hidden Markov Model,Delay Tolerant networks,Routing,Complex network analysis

来源：评论

学校读者我要写书评

暂无评论

Research on the degeneration problem of key sequence based on chaos

Research on the degeneration problem of key sequence based o...

引用

5th IEEE International Conference on Intelligent networking and Collaborative Systems, INCoS 2013

作者： Wang, Jing-Jing Wei, Ping Chen, Jia-Yong Key Laboratory of Network and Information Security of APF Department of Electronic Technology Engineering University of APF Xi'an 710086 China Laboratory-Center of Computer Department of Information Engineering Engineering University of APF Xi'an 710086 China Laboratory of Information and Network of APF Department of Information Engineering Engineering University of APF Xi'an 710086 China

ISBN: (纸本)9780769549880

In view of the degeneration problem of chaos characteristics of the secret-key sequences, a new key sequence generation system was designed, combining chaos and cryptography. The simulation results shows that, not only can the system generate its own parameters randomly, but also it can generate chaos secret-key sequences, which have the merits of long periodicity, great complexity and strong security, etc. © 2013 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for outlier mining in the internet of things

引用

ICIC Express Letters 2013年第1期7卷 215-219页

作者： Chen, Wei Liu, Yongshan Zhang, Yang College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province No. 438 Hebei Ave. Qinhuangdao 066004 China

Most of the traditional outlier mining algorithms are not suitable for high dimensional datasets. However, the dimensionality of the dataset in the field of the Internet of Things is high. Therefore, Hypergraph-based Outlier Mining (HOM) algorithm is proposed to solve the problem. Two different hypergraph models are constructed in the HOM algorithm. One is itemset hypergraph. One-itemset in transaction database is itemset hypergraph's vertices, and the transactions are itemset hypergraph's hyperedges. The other one is transaction hypergraph. The transactions are its vertices, and frequent itemsets are the hyperedges. The outliers are found by hypergraph partitioning. Experiments show that HOM algorithm can effectively find the outliers in high dimensional space. ©2013 ICIC International.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

An improved Wu-Huberman community discovery algorithm based on edge points

引用

ICIC Express Letters 2013年第11期7卷 2949-2955页

作者： Guo, Jingfeng Wang, Xiaolin Zuo, Mengfei Lv, Jiaguo College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

There are two critical questions in the Wu-Huberman algorithm: one is picking two poles and the other is setting the threshold. By further studying the two questions, we present a method that makes the discovery of communities more precise and the scope of application of the algorithm wider. The method picks the edge nodes of two communities as two poles and finds the largest gap using the core nodes of communities, which can discover communities of arbitrary size instead of roughly the same size. © 2013 ISSN 1881-803X.

关键词： Poles

来源：评论

学校读者我要写书评

暂无评论

Real-time detection and recognition of landmarks for mobile robot in indoor scenes

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous Engineering 2013年第4期8卷 329-341页

作者： Xue, Yanbing Zhang, Hua Ju, Yucui Wang, Jin Key Laboratory of Computer Vision and System Tianjin University of Technology Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China

This paper proposes a robust real-time artificial landmarks detection and recognition system for indoor mobile robot. Landmarks detection and recognition for indoor robots faces two major difficulties, one is the illumination changes and the other is processing speed. In this paper, first, histograms of oriented gradient (HOG) features are extracted to resolve the problem of illumination changes. Second, AdaBoost based algorithm is used in detection phase to increase the processing speed. Finally, RBF-SVM classifier is used for recognition. Experimental results show a high detection and recognition accuracy and the processing speed is about 10 frames per second.

关键词： Adaptive boosting

来源：评论

学校读者我要写书评

暂无评论

LoBa-Min-Min-SPA: Grid load balance using SPA

引用

Open Automation and Control Systems Journal 2013年第1期5卷 87-95页

作者： Zhang, Zhongping Wen, Lijuan Wang, Zhiping College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao Hebei 066004 China Foreign Language College of Dalian Jiaotong University Dalian Liaoning 116052 China

In the grid environment, there are a large number of grid resources scheduling algorithms. According to the existing Min-Min scheduling algorithm in uneven load, and low resource utilization rate, we put forward LoBa-Min-Min algorithm, which is based on load balance. This algorithm first used Min-Min algorithm preliminary scheduling, then according to the standard of reducing Makespan, the tasks on heavy-loaded resources would be assigned to resources that need less time to load balance, raise resource utilization rate, and achieve lesser completion time. We used benchmark of instance proposed by Braun et al. to prove feasibility and effectiveness of the algorithm. At Last, We introduced the SPA and gave the experimental results of Min-Min-SPA and LoBa-Min-Min-SPA. © Zhang et al.;Licensee Bentham Open.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Make Your Webpage Carry Abundant Secret information Unawarely

Make Your Webpage Carry Abundant Secret Information Unawarel...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Xiaojun Guo Guang Cheng Chengang Zhu Aiping Zhou Wubin Pan Dinhtu Truong Southeast University Nanjing Jiangsu CN Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China

How to embed more secret message into Web page with keeping good imperceptibility simultaneously is a trade-off problem for information hiding schemes. This paper presents a novel Web page information hiding method based on three inherent features of current Web page's HTML Code matrix. This method firstly exploits chaotic transform to deal with secret message, then embeds each bit of secret message into cover Web page according to the random odevity of character amount contained by each row(column) in cover Web page's HTML code matrix. Its process is very simple to understand and easy to implement. It can improve the largest embedded capacity (LEC) of cover Web page greatly with keeping good imperceptibility at the same time. We test our approach on two test data sets which include 1000 Web pages in total. The experiment results show that the max LECs for these two data sets are up to 11291 bits and 13545 bits respectively. The average LECs for two data sets has improvement of 80.2% and 24% more than that of other Web page information hiding method .

关键词： HTML Transforms Internet Browsers Matrix converters Conferences Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A systematic approach to capturing and analysing botnets

引用

information Technology Journal 2013年第23期12卷 7152-7159页

作者： Wei, Jiang Tian, Zhihong College of Computer Science Beijing University of Technology Beijing 100124 China School of Computer National University of Defense Technology Changsha 410073 China Key Laboratory of Information and Network Security Ministry of Public Security Shanghai 201204 China School of Computer Science and Technology Harbin Institute of Technology Haerbin 150001 China

In this study, a systematic approach to Capturing and Analysing botnets is presented. Our framework is a scalable and robust infrastructure and consists of four modules. Honeynet-based capture system is proposed that is the first step towards our framework, which can automatically and dynamically collect and analyze malware traffic over the Internet without supervision. Furthermore, a multidimensional analysis system is designed to analyze binaries captured in the capture system. In addition, we discuss our preliminary results and lessons learned from this work. © 2013 Asian network for Scientific information/.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：