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

Remote Three-Factor Authentication Protocol with Strong Robustness for Multi-Server Environment

China Communications 2017年第6期14卷 126-136页

作者： Min Zhang Jiashu Zhang Wenrong Tan Sichuan Province Key Lab of Signal and Information Processing Southwest JiaoTong University Sichuan 610031 China School of Foreign Languages Southwest Minzu University Sichuan 610041 China School of Computer Science and Technology Southwest Minzu University Sichuan 610041 China

If a user wants to acquire different network services from various application servers in a traditional single server environment,the user must register these servers separately and remember different usernames and passwords for different *** solve these problems,a lot of authentication schemes for multi-server environment have been ***,Odelu and Das et *** a secure multi-server authentication protocol based on smart card,biometric and elliptic curve cryptography(ECC) .We firstly analyze Odelu et al.'s scheme and find some flaws as follows:1) the scheme may suffer Denial of Service(Dos) attack and insider attack;2) The scheme doesn't have strong robustness because improper work of the register center(RC) may lead to the collapse of the whole system;3) There are some design flaws in this *** example,the user cannot choose his/her identity randomly and the register center needs to maintain a data *** order to solve these problems,this paper proposes a new secure three-factor authentication protocol for multi-server environment based on Chebyshev chaotic map and secure sketch *** verify the security of the proposed scheme,we simulate our scheme using BAN logic and Pro Verif *** a thorough analysis,we can see that the proposed schemenot only has stronger security but also has less computation cost than Odelu et al.'s protocol.

关键词：多服务器认证协议环境认证鲁棒性椭圆曲线密码体制 Chebyshev 远程协议安全

来源：评论

学校读者我要写书评

暂无评论

OPTIMUM ENCODING APPROACHES ON VIDEO RESOLUTION CHANGES: A COMPARATIVE STUDY

OPTIMUM ENCODING APPROACHES ON VIDEO RESOLUTION CHANGES: A C...

引用

IEEE International Conference on Image processing

作者： Avsar Asan Werner Robitza Is-haka Mkwawa Lingfen Sun Ali C. Begen Signal Processing and Multimedia Communications Lab Plymouth University Plymouth U.K. Audiovisual Technology Group Technische Universitat Ilmenau Germany Department of Computer Science Ozyegin University Istanbul Turkey

Video resolution changes in an HTTP adaptive streaming session may negatively affect the viewer's quality of experience. Our goal is, through encoding, to make such resolution changes less noticeable for the viewers. This can be achieved by taking video complexity features into account during the encoding process. In this paper, we compare Constant Bitrate (CBR) versus Constrained Constant Rate Factor (CRF) coding approaches and their effects on the noticeability of video resolution changes. To this end, we conducted a dedicated subjective study with 20 subjects in a quasi-lab.environment. Our results suggest that choices for fixed-bitrate encoding have to be improved by deeper analysis of video complexity and resolution change patterns.

关键词： Bit rate Encoding Streaming media Quality of experience Complexity theory Bandwidth Spatiotemporal phenomena

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Remote Authentication Scheme for Multi-Server Environment Based on Biometrics with Access Control 9

Remote Authentication Scheme for Multi-Server Environment Ba...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Min Zhang Wen-rong Tan School of Foreign Languages Southwest Minzu University Sichuan Province Key Lab of Signal and Information Processing Southwest Jiao Tong University School of Computer Science and Technology Southwest Minzu University

ISBN: (纸本)9781509038237;9781509038220

Compared with single-server authentication scheme, the authentication scheme for multi-server environment has a lot of advantages. Such as users needn’t to remember various passwords or register for every application server. In 2016, Irshad et al. proposed a three-factor scheme based on chaotic map for multi-server environment. Irshad’s scheme has high efficiency and strong robustness. However, after careful analysis, this paper shows that Irshad’s scheme still has many disadvantages. In order to solve these problems, a new three-factor authentication scheme based on secure sketch and Chebyshev chaotic map has been proposed in this paper. From the analysis, we can see that the proposed scheme has higher security level and deals with biometric more appropriately in spite of slight higher computation cost than Irshad’s scheme. What’s more, an access control method has been introduced for the purpose of making different users enjoy different access privileges with regard to the data. At the same time, the proposed scheme can achieve key agreement.

关键词： multi-server authentication secure sketch access control biometrics

来源：评论

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Why is the Winner the Best?

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Realization of remote sensing image segmentation based on K-means clustering

引用

IOP Conference Series: Materials Science and Engineering 2019年第7期490卷

作者： Yanhong Wang Denghui Li Yuying Wang Guangxi Key Lab of Wireless Wideband Communication & Signal Processing Guilin China Institute Of Information Technology of Guilin University of Electronic Technology Key Laboratory of Cognitive Radio and Information Processing Ministry of Education (Guilin University of Electronic Technology) GUET Guilin China School of Computer Science and Information Security of GUET

Segmentation of remote sensing image is the key technology of positioning system. Firstly, we transform the remote sensing image from RGB pace to lab.space. Then, three centres are iterated by using K- means algorithm. Finally, in order to eliminate the influence, the closed operation of mathematical morphology is used to correct the segmented image. The results show that it can segment the road from the remote sensing image in lab.mode, by using K-means clustering algorithm. Moreover, lab.mode is more suitable for k-mean than other modes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Fast Proportionate RLS Adaptive Equalization for Underwater Acoustic Communications

A Fast Proportionate RLS Adaptive Equalization for Underwate...

引用

OCEANS - Europe

作者： Zhen Qin Jun Tao Feng Tong Hongtao Zhang Fengzhong Qu Xiao Han Key Laboratory of Underwater Acoustic Signal Processing of the Ministry of Education School of Information Science and Engineering Southeast University Nanjing China State Key Lab. of Acoustics Institute of Acoustics Chinese Academy of Sciences Beijing China College of Ocean and Earth Sciences Xiamen University Xiamen China Hangzhou Appiled Acoustics Research Institute Hangzhou China Key Laboratory of Ocean Observation-Imaging Testbed of Zhejiang Province Zhejiang University Zhoushan China Acoustic Science and Technology Laboratory Harbin Engineering University Harbin China

In this paper, a low-complexity recursive least squares (RLS) type sparse direct adaptive equalizer (DAE) is proposed for multiple-input multiple-output (MIMO) underwater acoustic (UWA) communications. The underlying proportionate RLS (PRLS) adaptive filter algorithm is motivated by the idea of proportionate updating (PU) originated in the improved proportionate normalized least mean squares (IPNLMS) adaptive filter scheme. To overcome the high complexity of the PRLS that is quadratic in the filter size, a fast implementation is developed in a way similar to the design of the stable fast transversal filter (SFTF) as a low-complexity approximation of the standard RLS adaptive filter algorithm. The resulting fast version of the PRLS is named the proportionate SFTF (PSFTF). The PSFTF is then adopted to update coefficients of a linear equalizer (LE), which was tested by experimental data collected in at-sea UWA communication trials. Experimental results showed the PSFTFDAE achieves faster convergence and better performance than existing SFTF-DAE and RLS-DAE.

关键词： Complexity theory MIMO communication Standards Equalizers Channel estimation Underwater acoustics signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Part-based visual tracking via structural support correlation filter

arXiv

引用

arXiv 2018年

作者： Ji, Zhangjian Feng, Kai Qian, Yuhua School of Computer and Information Technology Shanxi University Taiyuan China Key Lab. of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Taiyuan China Institute of Big Data Science and Industry Shanxi University Taiyuan China

Recently, part-based and support vector machines (SVM) based trackers have shown favorable performance. Nonetheless, the time-consuming online training and updating process limit their real-time applications. In order to better deal with the partial occlusion issue and improve their efficiency, we propose a novel part-based structural support correlation filter tracking method, which absorbs the strong discriminative ability from SVM and the excellent property of part-based tracking methods which is less sensitive to partial occlusion. Then, our proposed model can learn the support correlation filter of each part jointly by a star structure model, which preserves the spatial layout structure among parts and tolerates outliers of parts. In addition, to mitigate the issue of drift away from object further, we introduce inter-frame consistencies of local parts into our model. Finally, in our model, we accurately estimate the scale changes of object by the relative distance change among reliable parts. The extensive empirical evaluations on three benchmark datasets: OTB2015, TempleColor128 and VOT2015 demonstrate that the proposed method performs superiorly against several state-of-the-art trackers in terms of tracking accuracy, speed and robustness. Copyright © 2018, The Authors. All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A Network Lifetime Enhancement Algorithm Based on Path Planning of Mobile Sink in Wireless Sensor Networks

A Network Lifetime Enhancement Algorithm Based on Path Plann...

引用

Workshop 3 2017

作者： Wenjie Mo Guangxi Key Lab. Wireless Wideband Communication and Signal Processing Guilin University of Electronic Technology

In wireless sensor networks(WSN), the uneven distribution of nodes and the different amount of perception data lead to the imbalance of energy consumption and hotspot problem, which reduces the network lifetime. To solve this problem, a data gathering algorithm of mobile sink(MSDG) is proposed to travel shorter route and balance energy cost in wireless sensor networks. By defining the grids in the network area, several candidate sites of mobile sink are distributed in each grid, and then sink node select a site in each grid for collecting sensed data for nodes with lowest energy cost. The dynamic programming is introduced to choose the parking sites and planning the path for mobile sink. Simulation results show that algorithm can effectively extend network life in network than general hierarchical routing in WSN and hierarchical routing for mobile sink.

关键词： Sensor A Network Lifetime Enhancement Algorithm Based on Path Planning of Mobile Sink in Wireless Sensor Networks Mobile

来源：评论

学校读者我要写书评

暂无评论

Harmonized-Multinational qEEG norms (HarMNqEEG)

引用

NEUROIMAGE 2022年 256卷 119190-119190页

作者： Li, Min Wang, Ying Lopez-Naranjo, Carlos Hu, Shiang Reyes, Ronaldo Cesar Garcia Paz-Linares, Deirel Areces-Gonzalez, Ariosky Hamid, Aini Ismafairus Abd Evans, Alan C. Savostyanov, Alexander N. Calzada-Reyes, Ana Villringer, Arno Tobon-Quintero, Carlos A. Garcia-Agustin, Daysi Yao, Dezhong Dong, Li Aubert-Vazquez, Eduardo Reza, Faruque Razzaq, Fuleah Abdul Omar, Hazim Abdullah, Jafri Malin Galler, Janina R. Ochoa-Gomez, John F. Prichep, Leslie S. Galan-Garcia, Lidice Morales-Chacon, Lilia Valdes-Sosa, Mitchell J. Trondle, Marius Zulkifly, Mohd Faizal Mohd Rahman, Muhammad Riddha Bin Abdul Milakhina, Natalya S. Langer, Nicolas Rudych, Pavel Koenig, Thomas Virues-Alba, Trinidad A. Lei, Xu Bringas-Vega, Maria L. Bosch-Bayard, Jorge F. Valdes-Sosa, Pedro Antonio [a]The Clinical Hospital of Chengdu Brain Science Institute MOE Key Lab for Neuroinformation School of Life Science and Technology University of Electronic Science and Technology of China Chengdu China [b]Cuban Center for Neurocience La Habana Cuba [c]McGill Centre for Integrative Neuroscience Ludmer Centre for Neuroinformatics and Mental Health Montreal Neurological Institute Canada [d]Department of Neurosciences School of Medical Sciences Universiti Sains Malaysia Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [e]Brain and Behaviour Cluster School of Medical Sciences Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [f]Hospital Universiti Sains Malaysia Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [g]Humanitarian Institute Novosibirsk State University Novosibirsk 630090 Russia [h]Laboratory of Psychophysiology of Individual Differences Federal State Budgetary Scientific Institution Scientific Research Institute of Neurosciences and Medicine Novosibirsk 630117 Russia [i]Laboratory of Psychological Genetics at the Institute of Cytology and Genetics Siberian Branch of the Russian Academy of Sciences Novosibirsk 630090 Russia [j]University of Pinar del Río “Hermanos Saiz Montes de Oca” Pinar del Río Cuba [k]Department of Neurology Max Planck Institute for Human Cognitive and Brain Sciences Leipzig Germany [l]Department of Cognitive Neurology University Hospital Leipzig Leipzig Germany [m]Center for Stroke Research Charité-Universitätsmedizin Berlin Berlin Germany [n]Grupo Neuropsicología y Conducta - GRUNECO Faculty of Medicine Universidad de Antioquia Colombia [o]Research Department Institución Prestadora de Servicios de Salud IPS Universitaria Colombia [p]The Cuban center aging longevity and health Havana Cuba [q]Research Unit of NeuroInformation Chinese Academy of Medical Sciences Chengdu 2019RU035 China [r]School of Electrical Engineering Zhengzhou University Zhengzhou 4500

This paper extends frequency domain quantitative electroencephalography (qEEG) methods pursuing higher sensitivity to detect Brain Developmental Disorders. Prior qEEG work lacked integration of cross-spectral information omitting important functional connectivity descriptors. Lack of geographical diversity precluded accounting for site-specific variance, increasing qEEG nuisance variance. We ameliorate these weaknesses. (i) Create lifespan Riemannian multinational qEEG norms for cross-spectral tensors. These norms result from the HarMNqEEG project fostered by the Global Brain Consortium. We calculate the norms with data from 9 countries, 12 devices, and 14 studies, including 1564 subjects. Instead of raw data, only anonymized metadata and EEG cross spectral tensors were shared. After visual and automatic quality control, developmental equations for the mean and standard deviation of qEEG traditional and Riemannian DPs were calculated using additive mixed-effects models. We demonstrate qEEG "batch effects " and provide methods to calculate harmonized z-scores. (ii) We also show that harmonized Riemannian norms produce z-scores with increased diagnostic accuracy predicting brain dysfunction produced by malnutrition in the first year of life and detecting COVID induced brain dysfunction. (iii) We offer open code and data to calculate different individual z-scores from the HarMNqEEG dataset. These results contribute to developing bias-free, low-cost neuroimaging technologies applicable in various health settings.

关键词： Quantitative EEG EEG cross-spectrum Riemannian geometry Batch effects Z-score Harmonization Malnutrition Covid induced brain dysfunction Developmental Brain Chart

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：