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

19th International Conference on Neural Information Processing, ICONIP 2012

作者： Du, Ruo-Fei Liu, Ren-Jie Wu, Tian-Xiang Lu, Bao-Liang Center for Brain-like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China MOE-Microsoft Key Lab. for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China MOE Key Laboratory of Systems Biomedicine Shanghai Jiao Tong University 800 Dongchuan Road Shanghai 200240 China

ISBN: (纸本)9783642344992

In this paper, we propose a novel system to analyze vigilance level combining both video and Electrooculography (EOG) features. For one thing, the video features extracted from an infrared camera include percentage of closure (PERCLOS) and eye blinks, slow eye movement (SEM), rapid eye movement (REM) are also extracted from EOG signals. For another, other features like yawn frequency, body posture and face orientation are extracted from the video by using Active Shape Model (ASM). The results of our experiments indicate that our approach outperforms the existing approaches based on either video or EOG merely. In addition, the prediction offered by our model is in close proximity to the actual error rate of the subject. We firmly believe that this method can be widely applied to prevent accidents like fatigued driving in the future. © 2012 Springer-Verlag.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

Selective opening chosen ciphertext security directly from the DDH assumption

Selective opening chosen ciphertext security directly from t...

引用

6th International Conference on Network and System Security, NSS 2012

作者： Liu, Shengli Zhang, Fangguo Chen, Kefei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China School of Information Science and Technology Sun Yat-sen University Guangzhou 510006 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (纸本)9783642346002

Chosen-ciphertext security has been well-accepted as a standard security notion for public key encryption. But in a multi-user surrounding, it may not be sufficient, since the adversary may corrupt some users to get the random coins as well as the plaintexts used to generate ciphertexts. The attack is named "selective opening attack". We study how to achieve full-fledged chosen-ciphertext security in selective opening setting directly from the DDH assumption. Our construction is free of chameleon hashing, since tags are created for encryptions in a flexible way to serve the security proof. © 2012 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Isotropic Hashing 12

Isotropic Hashing

引用

Annual Conference on Neural Information Processing systems

作者： Weihao Kong Wu-Jun Li Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China

ISBN: (纸本)9781627480031

Most existing hashing methods adopt some projection functions to project the o-riginal data into several dimensions of real values, and then each of these projected dimensions is quantized into one bit (zero or one) by thresholding. Typically, the variances of different projected dimensions are different for existing projection functions such as principal component analysis (PCA). Using the same number of bits for different projected dimensions is unreasonable because larger-variance dimensions will carry more information. Although this viewpoint has been widely accepted by many researchers, it is still not verified by either theory or experiment because no methods have been proposed to find a projection with equal variances for different dimensions. In this paper, we propose a novel method, called isotropic hashing (IsoHash), to learn projection functions which can produce projected dimensions with isotropic variances (equal variances). Experimental results on real data sets show that IsoHash can outperform its counterpart with different variances for different dimensions, which verifies the viewpoint that projections with isotropic variances will be better than those with anisotropic variances.

关键词： dimensions VARIANCES hashing principal components analysis Comment Isotropic Dataset numerical invariant projection function Drill bits

来源：评论

学校读者我要写书评

暂无评论

Poster abstracts

引用

Sleep and Biological Rhythms 2016年第1期5卷 A1-A189页

作者： J. Ferrie M. Shipley F. Cappuccio E. Brunner M. Miller M. Kumari M. Marmot A. Coenen J. L. Castillo F. Araya G. Bustamante L. Montecino C. Torres S. Oporto J. Gronli E. Fiske R. Murison B. Bjorvatn E. Sorensen R. Ursin C. M. Portas S. Rajaraman A. Gribok N. Wesensten T. Balkin J. Reifman N. Dursunoglu S. Ozkurt S. Baser O. Delen S. Sarikaya P. Sadler P. Mitchell D. Françon M. Decobert B. Herve A. Richard G. Griebel P. Avenet B. Scatton G. L. Fur D. Eckert A. Jordan A. Wellman S. Smith A. Malhotra D. White D. Bruck I. Thomas A. Kritikos W. Oertel K. Stiasny-Kolster D. Garcia-Borreguero W. Poewe B. Hoegl R. Kohnen E. Schollmayer J. Keffel C. Trenkwalder A. Valle S. Roizenblatt F. Fregni P. Boggio S. Tufik K. Ward L. Robertson L. Palmer P. Eastwood D. Hillman J. Lee S. Mukherjee V. de Padova G. Barbato G. Ficca I. Zilli P. Salzarulo M. Veldi T. Hion V. Vasar M. Kull L. Nowak J. Davis Y. Latzer O. Tzischinsky S. Crowley M. Carskadon M. Anca-Herschkovitsch D. Frey J. Ortega C. Wiseman C. Farley K. Wright A. Campbell A. Neill K. Spiegel R. Leproult E. Tasali N. Scherberg E. van Cauter A. T. Noradina N. A. Karim I. Norlinah A. A. Raymond R. Sahathevan B. Hamidon E. Werth R. Poryazova R. Khatami C. Bassetti R. G. Beran L. Ainley G. Holand J. Duncan H. Kinney B. Davis B. Hood S. Frey C. Schmidt M. Hofstetter P. Peigneux C. Cajochen W.-P. Hu J.-D. Li C. Zhang L. Boehmer J. Siegel Q.-Y. Zhou Y. Sagawa H. Kondo T. Takemura H. Kanayama Y. Kaneko M. Sato T. Kanbayashi Y. Hishikawa T. Shimizu A. Viola L. James L. Schlangen D.-J. Dijk R. Andretic Y.-C. Kim K.-A. Han F. Jones R. Greenspan L. Sanford L. Yang X. Tang K. Dieter E. Uta H. Sven M. Richard N. Oyane S. Pallesen F. Holsten Y. Inoue M. Fujita N. Emura K. Kuroda N. Uchimura A. Johnston J. Astbury G. Kennedy K. Hoedlmoser M. Schabus T. Pecherstorfer S. Moser G. Gruber P. Anderer W. Klimesch N. Naidoo M. Ferber A. Pack D. Neu O. Mairesse G. Hoffmann A. Dris L. Lambrecht P. Linkowski P. Verbanck O. Le Bon N. Matsuura M. Yamao N. Adachi R. Aritomi Y. Komada H. Tanaka S. Shirak University College London London UK University College London London USA Warwick Medical School London UK Warwick Medical School Coventry USA Radboud University Nijmegen Nijmegen Netherlands Department of Neurology University of Chile Santiago Chile Neurology Service Hospital del Salvador Santiago Chile Family Health Center Juan Pablo II Santiago Chile Department of Biomedicine Section on Physiology Univeristy of Bergen Bergen Norway Department of Public Health and Primary Health Care Univeristy of Bergen Bergen Norway Department of Public Health and Primary Health Care University of Bergen Bergen Norway Norwegian Competence Center for Sleep Disorders Haukeland University Hospital Bergen Norway Department of Child and Adolescent Psychiatry Haukeland University Hospital Univeristy of Bergen Bergen Norway Department of Biomedicine University of Bergen Bergen Norway US Army Medical Research and Materiel Command Fort Detrick Frederick USA Walter Reed Army Institute of Research Silver Spring USA Department of Behavioral Biology Walter Reed Army Institute of Research Silver Spring USA Faculty Department of Pulmonology Pamukkale University Medical Denizli Turkey University of Ballarat Ballarat Australia Sanofi-Aventis Recherche et Developpement Paris France Brigham and Women’s Hospital Harvard Medical School Boston USA The University of Queensland Adelaide Australia School of Psychology University of Queensland Brisbane Australia The University of Queensland Brisbane Australia Victoria University Melbourne Australia Department of Psychology Victoria University Melbourne Australia School of Psychology Victoria University Melbourne Australia Philips-Universität Marburg Germany Philips-Universitaet-Marburg Marburg Germany Instituto de Investigaciones del Sueno Madrid Spain Universitätsklinik für Neurologie Innsbruck Austria Universitaetsklinik fuer Neurologie Innsbruck Austria IMEREM GmbH Nuernberg Germany Schwarz Pharma AG Monheim Germany

来源：评论

学校读者我要写书评

暂无评论

Hybrid rule-based algorithm for coreference resolution

Hybrid rule-based algorithm for coreference resolution

引用

2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, EMNLP-CoNLL 2012 - Shared Task: Modeling Multilingual Unrestricted Coreference in OntoNotes

作者： Shou, Heming Zhao, Hai Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781937284459

This paper describes our coreference resolution system for the CoNLL-2012 shared task. Our system is based on the Stanford's dcoref deterministic system which applies multiple sieves with the order from high precision to low precision to generate coreference chains. We introduce the newly added constraints and sieves and discuss the improvement on the original system. We evaluate the system using OntoNotes data set and report our results of average F-score 58.25 in the closed track. © 2012 Association for Computational Linguistics.

关键词： Sieves

来源：评论

学校读者我要写书评

暂无评论

On guaranteed detectability for surveillance sensor networks

引用

International Journal of Distributed Sensor Networks 2012年第7期2012卷 1-15页

作者： Zhu, Yanmin Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Shanghai Key Lab of Scalable Computing and Systems Shanghai 200240 China

Surveillance is an important class of applications for wireless senor networks (WSNs), whose central task is to detect events of interest. Existing approaches seriously suffer from blind spots and low energy efficiency. In this paper, we propose a fully distributed algorithm GAP for energy-efficient event detection for surveillance applications. Employing the probabilistic approach, GAP actively tunes the active probability and minimizes the energy consumption of each sensor. The unique features of GAP are threefold. First, it provides guaranteed detectability for any event occurring in the sensing field. Second, it exposes a convenient interface of the user to specify the desired detectability. Finally, it supports differentiated service to empower better surveillance for critical spots. Without relying on costly time synchronization, GAP is a lightweight distributed protocol and is truly scalable to network scale and sensor density. Theoretical analysis and comprehensive simulation experiments are conducted, which jointly demonstrate that GAP is able to provide guaranteed detectability while significantly prolonging the system lifetime compared with other schemes. Copyright © 2012 Yanmin Zhu.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Chinese coreference resolution via ordered filtering

Chinese coreference resolution via ordered filtering

引用

作者： Zhang, Xiaotian Wu, Chunyang Zhao, Hai Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781937284459

We in this paper present the model for our participation (BCMI) in the CoNLL-2012 Shared Task. This paper describes a pure rule-based method, which assembles different filters in a proper order. Different filters handle different situations and the filtering strategies are designed manually. These filters are assigned to different ordered tiers from general to special cases. We participated in the Chinese and English closed tracks, scored 51.83 and 59.24 respectively. © 2012 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Bargaining-Based Approach for Incentive-Compatible Message Forwarding in Opportunistic Networks

A Bargaining-Based Approach for Incentive-Compatible Message...

引用

IEEE International Conference on Communications

作者： Fan Wu Tingting Chen Sheng Zhong Chunming Qiao Guihai Chen Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Department of Computer Science Oklahoma State University Department of Computer Science and Engineering SUNY at Buffalo

ISBN: (纸本)9781457720529

Opportunistic networking is an important technique to enable users to communicate in an environment where contemporaneous end-to-end paths are unavailable or unstable. To support end-to-end messaging in opportunistic networks, a number of probabilistic routing protocols have been proposed. However, when nodes are selfish, they may not have incentives to participate in probabilistic routing, and the system performance will degrade significantly. In this paper, we present a novel incentive scheme for probabilistic routing that stimulates selfish nodes to participate. We not only rigorously prove the properties of our scheme, but also extensively evaluate our scheme using GloMoSim. Evaluation results show that there is an up to 75.8% gain in delivery ratio compared with a probabilistic routing protocol providing no incentive.

关键词： Routing protocols incentives end of message System performance end-to-end Ganglia Scheme COMMUNICATING Not Available Network routing sediment-delivery ratio

来源：评论

学校读者我要写书评

暂无评论

High Availability through Output Continuity

High Availability through Output Continuity

引用

IEEE International Conference on Cluster computing Workshops and Posters (CLUSTER WORKSHOPS)

作者： Wei Ye Yaozu Dong Ruhui Ma Alei Liang Haibing Guan Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China Intel China Software Center Shanghai China

Virtual machine (VM) based state machine approaches, i.e. VM replication, provide high availability without source code modifications, unfortunately, existing VM replication approaches suffer from excessive replication overheads. On the other hand, machine state replication is an overly strong (and therefore less efficient) requirement for high availability in the networked client-server system. In this paper, we propose a generic and highly efficient high availability solution through output continuity. Output continuity considers a backup server as a valid replica as long as the responses generated so far are the same between the backup and primary servers, the server state is propagated from the primary server to the backup server if and only if the previous outputs from the backup and primary servers are different.

关键词： Servers Availability Mathematical model Semantics Equations Hardware

来源：评论

学校读者我要写书评

暂无评论

Improving unsegmented network coding for opportunistic routing in wireless mesh network

Improving unsegmented network coding for opportunistic routi...

引用

IEEE Conference on Wireless Communications and Networking

作者： Chen Chen Chao Dong Fan Wu Hai Wang Laixian Peng Jingnan Nie Institute of Communications Engineering PLA University of Science and Technology China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University China

Unsegmented network coding was incorporated into opportunistic routing to improve inefficient schedule of segmented network coding due to delayed feedback. However, most unsegmented network coding schemes fail to constrain the size of decoding window. Large decoding window not only challenges limited computational ability and decoding memory in practical environments, but also introduces large decoding delay, which is undesirable in delay sensitive applications. In this paper, we prove that the possibility of unacceptably large decoding window is innegligible, and verify the necessity of handling decoding window. To solve the issue, we argue that the number of unknown packets injected into the network must be strictly constrained at the source. Based on the idea, we improve unsegmented network coding scheme for opportunistic routing. Simulation results shows that the solution is robust to losses. In addition, to achieve optimal throughput, the redundancy factor should be selected larger than the reciprocal of end-to-end delivery ratio.

关键词： Decoding Encoding Network coding Routing Redundancy Schedules Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：