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

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Laisen Nie Huizhi Wang Shimin Gong Zhaolong Ning Mohammad S. Obaidat Kuei-Fang Hsiao School of Electronics and Information Northwestern Polytechnical University Xi'an P.R.China Qingdao Research Institute of Northwestern Polytechnical University Qingdao P.R.China School of Intelligent Systems Engineering Sun Yat-sen University China State Key Laboratory for Novel Software Technology Nanjing University China ECE Department Nazarbayev University Astana Kazakhstan College of Computing and Informatics University of Sharjah UAE The King Abdullah II School of Information Technology The University of Jordan Amman Jordan University of Science and Technology Beijing China Department of Information Management Ming Chuan University Taiwan

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

Vehicular Ad-Hoc Networks (VANETs) have received a great attention recently due to their potential and various applications. However, the initial phase of the VANET has many research challenges that need to be addressed, such as the issues of security and privacy protection caused by the openness of wireless communication networks among the city-wide applied regions. Specially, anomaly detection for a VANET has become a challenging problem, due to the changes in the scenario of VANETs comparing with traditional wireless networks. Motivated by this issue, we focus on the problem of anomaly detection in VANETs, and propose an effective anomaly detection approach based on the convolutional neural network in this paper. The proposed approach takes into account the spatio-temporal and sparse features of VANET traffic, and it uses a convolutional neural network architecture and a loss function based on Mahalanobis distance for anomaly detection. Furthermore, a comprehensive assessment is provided to validate the proposed approach, which illustrates the effectiveness of this approach.

关键词： Anomaly detection Feature extraction Vehicular ad hoc networks Kernel Estimation Security Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Visual Homing via Guided Locality Preserving Matching

Visual Homing via Guided Locality Preserving Matching

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Jiayi Ma Ji Zhao Junjun Jiang Huabing Zhou Yu Zhou Zheng Wang Xiaojie Guo Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing China ReadSense Ltd. China School of Computer Science China University of Geosciences Wuhan China Hubei Key Lab of Intelligent Robot Wuhan Institute of Technology Wuhan China Institute of Sensing Technology and Business Beijing University of Posts and Telecommunications Beijing China National Institute of Informatics Tokyo Japan School of Computer Software Tianjin University Tianjin China

This study proposes a simple yet surprisingly effective feature matching approach, termed as guided locality preserving matching (GLPM), for visual homing of panoramic images. The key idea of our approach is merely to preserve the neighborhood structures of potential true matches between two panoramic images. We formulate it into a mathematical model, and derive a simple closed-form solution with linearithmic time and linear space complexities. This enables our method to accomplish the mismatch removal from hundreds of putative correspondences in only a few milliseconds. To handle extremely large proportions of outliers, we further design a guided matching strategy based on the proposed method, using the matching result on a small putative set with a high inlier ratio to guide the matching on a large putative set. This strategy can also significantly boost true matches without sacrifice in accuracy. To apply our GLPM to the visual homing problem, we develop a method for dense motion flow estimation from sparse feature matches based on Tikhonov regularization. Moreover, the focus-of-contraction/focus-of-expansion is derived to determine homing directions. The effectiveness of our method is demonstrated on a panoramic database in both feature matching and visual homing.

关键词： Visualization Feature extraction Electronic mail Cost function Measurement Closed-form solutions intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Implicit consensus: Blockchain with unbounded throughput

arXiv

引用

arXiv 2017年

作者： Ren, Zhijie Cong, Kelong Pouwelse, Johan Erkin, Zekeriya Cyber Security Group Dept. of Intelligent Systems Delft University of Technology Mekelweg 4 Delft Netherlands Distributed Systems Group Dept. of Software Engineering Delft University of Technology Mekelweg 4 Delft Netherlands

Recently, the blockchain technique was put in the spotlight as it introduced a systematic approach for multiple parties to reach consensus without needing trust. However, the application of this technique in practice is severely restricted due to its limitations in throughput. In this paper, we propose a novel consensus model, namely the implicit consensus, with a distinctive blockchain-based distributed ledger in which each node holds its individual blockchain. In our system, the consensus is not on the transactions, but on a special type of blocks called Check Points that are used to validate individual transactions. Our system exploits the ideas of self-interest and spontaneous sharding and achieves unbounded throughput with the transaction reliability that equivalent to traditional Byzantine fault tolerance schemes. Copyright © 2017, The Authors. All rights reserved.

关键词： distributed ledger

来源：评论

学校读者我要写书评

暂无评论

Joint product numerical range and geometry of reduced density matrices

引用

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 9-17页

作者： Jianxin Chen Cheng Guo Zhengfeng Ji Yiu-Tung Poon Nengkun YU Bei Zeng Jie Zhou Joint Center for Quantum Information and Computer Science University of Maryland College Park 20740 USA Institute for Advanced Study Tsinghua University Beijing 100084 China Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science.Institute of Software Chinese Academy of Sciences Beijing 100084 China Department of Mathematics Iowa State University Ames 50011-2140 USA Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2 W1 Canada Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection is convex in R3. The boundary of may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces： symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti＇s theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range II of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that a ruled surface emerges naturally when taking a convex hull of ∏. We show that, a ruled surface on sitting in ∏ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of , with two boundary pieces of symmetry breaking origin separated by two gapless lines.

关键词： reduced density matrices quantum tomography numerical range quantum information oloid ruled surface

来源：评论

学校读者我要写书评

暂无评论

Physical origins of ruled surfaces on the reduced density matrices geometry

引用

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 1-8页

作者： Ji-Yao Chen Zhengfeng Ji Zheng-Xin Liu Xiaofei Qi Nengkun Yu Bei Zeng Duanlu Zhou State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing 100084 China Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China Department of Physics Renmin University of China Beijing 100872 China Department of Mathematics Shanxi University Taiyuan 030000 China Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2W1 Canada Institute of Physics Chinese Academy of Sciences Beijing 100190 China

The reduced density matrices （RDMs） of many-body quantum states form a convex set. The boundary of low dimensional projections of this convex set may exhibit nontrivial geometry such as ruled surfaces. In this paper, we study the physical origins of these ruled surfaces for bosonic systems. The emergence of ruled surfaces was recently proposed as signatures of symmetry- breaking phase. We show that, apart from being signatures of symmetry-brealdng, ruled surfaces can also be the consequence of gapless quantum systems by demonstrating an explicit example in terms of a two-mode Ising model. Our analysis was largely simplified by the quantum de Finetti＇s theorem--in the limit of large system size, these RDMs are the convex set of all the symmetric separable states. To distinguish ruled surfaces originated from gapless systems from those caused by symmetry- breaking, we propose to use the finite size scaling method for the corresponding geometry. This method is then applied to the two-mode XY model, successfully identifying a ruled surface as the consequence of gapless systems.

关键词： ruled surfaces reduced density matrices bosonic system geometry

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Optimally Resilient Controllers

arXiv

引用

arXiv 2017年

作者： Neider, Daniel Weinert, Alexander Zimmermann, Martin Max Planck Institute for Software Systems Kaiserslautern67663 Germany Intelligent and Distributed Systems Linder Höhe Köln51147 Germany University of Liverpool LiverpoolL69 3BX United Kingdom

Recently, Dallal, Neider, and Tabuada studied a generalization of the classical game-theoretic model used in program synthesis, which additionally accounts for unmodeled intermittent disturbances. In this extended framework, one is interested in computing optimally resilient strategies, i.e., strategies that are resilient against as many disturbances as possible. Dallal, Neider, and Tabuada showed how to compute such strategies for safety specifications. In this work, we compute optimally resilient strategies for a much wider range of winning conditions and show that they do not require more memory than winning strategies in the classical model. Our algorithms only have a polynomial overhead in comparison to the ones computing winning strategies. In particular, for parity conditions, optimally resilient strategies are positional and can be computed in quasipolynomial time. Copyright © 2017, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Advancing tabu and restart in local search for maximum weight cliques

arXiv

引用

arXiv 2018年

作者： Fan, Yi Li, Nan Li, Chengqian Ma, Zongjie Latecki, Longin Jan Su, Kaile Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China Department of Computer Science Jinan University Guangzhou China Institute for Integrated and Intelligent Systems Griffith University BrisbaneQLD Australia Department of Computer and Information Sciences Temple University PhiladelphiaPA United States Department of Computer Science Sun Yat-sen University Guangzhou China

The tabu and restart are two fundamental strategies for local search. In this paper, we improve the local search algorithms for solving the Maximum Weight Clique (MWC) problem by introducing new tabu and restart strategies. Both the tabu and restart strategies proposed are based on the notion of a local search scenario, which involves not only a candidate solution but also the tabu status and unlocking relationship. Compared to the strategy of configuration checking, our tabu mechanism discourages forming a cycle of unlocking operations. Our new restart strategy is based on the re-occurrence of a local search scenario instead of that of a candidate solution. Experimental results show that the resulting MWC solver outperforms several state-of-theart solvers on the DIMACS, BHOSLIB, and two benchmarks from practical applications. Copyright © 2018, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Improved Forecast Ability of Oil Market Volatility Based on combined Markov Switching and GARCH-class Model

引用

Procedia Computer Science 2017年 122卷 415-422页

作者： Yu Runfang Du Jiangze Liu Xiaotao Intelligent Software & Systems Department Applied Science and Technology Research Institute Hong Kong School of Finance Jiangxi University of Finance and Economics Nanchang China Department of Finance Central China Normal University Wuhan China

This paper estimates and forecasts West Texas Intermediate (WTI) crude oil market volatility with GARCH, EGARCH models. We find that, in terms of Root Mean Squared Error (RMSE) criteria, EGARCH model outperformances GARCH model in both short term and long term forecast length. Then, we apply Markov Switching model on oil volatility term and find that we can improve forecast accuracy of oil market volatility further with MSGARCH model, when compared with normal GARCH and normal EGARCH model. Besides, empirical results confirm that two regimes consist of regime 1 with low volatility and regime 2 with high volatility exist in WTI crude oil market. Also, the smoothed probabilities indicate that before 2004, WTI crude oil market stays in a low volatility regime most of time, while after 2004, WTI crude oil market switches to high volatility regime and stays in it until present most of time.

关键词： GARCH EGARCH Markov Switching Model Volatility Forecasting WTI Oil Market

来源：评论

学校读者我要写书评

暂无评论

SSERBC 2017: Sclera segmentation and eye recognition benchmarking competition

SSERBC 2017: Sclera segmentation and eye recognition benchma...

引用

2017 IEEE International Joint Conference on Biometrics, IJCB 2017

作者： Das, Abhijit Pal, Umapada Ferrer, Miguel A. Blumenstein, Michael Štepec, Dejan Rot, Peter Emeršič, Žiga Peer, Peter Štruc, Vitomir Kumar, S.V. Aruna Harish, B.S. Institute for Integrated and Intelligent Systems Griffith University QLD Australia Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India IDeTIC University of Las Palmas de Gran Canaria Las Palmas Spain School of Software University of Technology Sydney Australia Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Department of Information Science and Engineering Sri Jayachamrajendra College of Engineering Mysusru Karnataka India

ISBN: (纸本)9781538611241

This paper summarises the results of the Sclera Segmentation and Eye Recognition Benchmarking Competition (SSERBC 2017). It was organised in the context of the International Joint Conference on Biometrics (IJCB 2017). The aim of this competition was to record the recent developments in sclera segmentation and eye recognition in the visible spectrum (using iris, sclera and peri-ocular, and their fusion), and also to gain the attention of researchers on this subject. In this regard, we have used the Multi-Angle Sclera Dataset (MASD version 1). It is comprised of2624 images taken from both the eyes of 82 identities. Therefore, it consists of images of 164 (82×2) eyes. A manual segmentation mask of these images was created to baseline both tasks. Precision and recall based statistical measures were employed to evaluate the effectiveness of the segmentation and the ranks of the segmentation task. Recognition accuracy measure has been employed to measure the recognition task. Manually segmented sclera, iris and peri-ocular regions were used in the recognition task. Sixteen teams registered for the competition, and among them, six teams submitted their algorithms or systems for the segmentation task and two of them submitted their recognition algorithm or systems. The results produced by these algorithms or systems reflect current developments in the literature of sclera segmentation and eye recognition, employing cutting edge techniques. The MASD version 1 dataset with some of the ground truth will be freely available for research purposes. The success of the competition also demonstrates the recent interests of researchers from academia as well as industry on this subject. © 2017 IEEE.

关键词： Competition

来源：评论

学校读者我要写书评

暂无评论

The Scalability-Efficiency/Maintainability-Portability Trade-Off in Simulation software Engineering: Examples and a Preliminary Systematic Literature Review

The Scalability-Efficiency/Maintainability-Portability Trade...

引用

International Workshop on software Engineering for High Performance Computing in Computational Science & Engineering (SE-HPCCSE)

作者： Dirk Pflüger Miriam Mehl Julian Valentin Florian Lindner David Pfander Stefan Wagner Daniel Graziotin Yang Wang Institute for Parallel and Distributed Systems University of Stuttgart Germany Institute of Software Technology University of Stuttgart Germany

ISBN: (纸本)9781509052257

Large-scale simulations play a central role in science and the industry. Several challenges occur when building simulation software, because simulations require complex software developed in a dynamic construction process. That is why simulation software engineering (SSE) is emerging lately as a research focus. The dichotomous trade-off between scalability and efficiency (SE) on the one hand and maintainability and portability (MP) on the other hand is one of the core challenges. We report on the SE/MP trade-off in the context of an ongoing systematic literature review (SLR). After characterizing the issue of the SE/MP trade-off using two examples from our own research, we (1) review the 33 identified articles that assess the trade-off, (2) summarize the proposed solutions for the tradeoff, and (3) discuss the findings for SSE and future work. Overall, we see evidence for the SE/MP trade-off and first solution approaches. However, a strong empirical foundation has yet to be established; general quantitative metrics and methods supporting software developers in addressing the trade-off have to be developed. We foresee considerable future work in SSE across scientific communities.

关键词： software Computational modeling Mathematical model Scalability Hardware software engineering Numerical models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：