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

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jin Qian Yu-Hui Chang Ping Lv Jiangsu Key Laboratory of Big Data Analysis Technology/B-DAT Nanjing University of Information Science & Technology Nanjing China Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology Changzhou China

ISBN: (纸本)9781509003914

Attribute reduction is one of the key issues for data preprocess in data mining. Many heuristic attribute reduction algorithms based on discernibility matrix have been proposed for inconsistent decision tables. However, these methods are usually computationally time-consuming. To address this issue, the derived consistent decision tables are defined for different definitions of relative reducts. The computations for different reducts of the original inconsistent decision tables are converted into the computations for their corresponding reducts of the derived consistent datasets. The relative discernibility object pair and the more optimal relative discernibility degree from view of the boundary region are designed to accelerate the attribute reduction process. An efficient attribute reduction framework using relative discernibility degree is proposed for large datasets. Experimental results show that our attribute reduction algorithms are effective and feasible for large inconsistent datasets.

关键词： Cybernetics Acceleration Time complexity Rough sets Heuristic algorithms data mining Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Vehicle appearance feature recognition based on image

Vehicle appearance feature recognition based on image

引用

2016 6th International Conference on Machinery,Materials,Environment,Biotechnology and Computer(MMEBC 2016)

作者： Deyang Shao Chao Xu Shixian Luo Bo Feng Long Jiao Anhui Engineering Laboratory of Agro-Ecological Big Data Anhui University Key Laboratory of Intelligent Computer & Signal Processing Ministry of EducationAnhui University

ISBN: (纸本)9781510828087

Now, the highway toll system still uses a single license plate recognition, this method has a problem of inaccurate identificationFor this kind of situation, this paper put forward to increase the appearance of the vehicle feature information and can improve the accuracy of recognitionIn this paper, we adopt the ORB algorithm to extract the exterior feature information of the vehicle and two-way matching、RANSAC algorithms to remove mismatching pointsAt the same time, we continue to iteration the scale parameter of the affine transformation and rotation angle at the matching point as a kind of judgment, which improves the robustness of the algorithm.

关键词： Feature information ORB RANSAC Affine transformation

来源：评论

学校读者我要写书评

暂无评论

Software Defined Networking Based On-Demand Routing Protocol in Vehicle Ad Hoc Networks

Software Defined Networking Based On-Demand Routing Protocol...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Baihong Dong Weigang Wu Zhiwei Yang Junjie Li School of Data and Computer Science Sun Yat-Sen University Guangdong Key Lab. of Big Data Analysis and Processing Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou

ISBN: (纸本)9781509056972

This paper comes up with a SDN based On-Demand Routing Protocol, SVAO, which separates data forwarding layer and network control layer, as in SDN, to enhance the data transmission efficiency within VANETs. The Roadside Service Unit plays the role of Local Controller and is in charge of selecting vehicles to forward packet within a road segment. All the vehicles state in the road. Correspondingly, a two-level design is used. Global Level is distributed and adopts a ranked query scheme to collect vehicle information and determine the road segments along which a message should be forwarded. And the Local Level is in charge of selecting forwarding vehicles in each road segment determined by the global level. We compare SVAO with popular ad-hoc network routing protocols, including OLSR, DSR, DSDV, and DB via simulations. We consider the impact of vehicle density, speed on data transmission rate and average packet delay. The simulation results show that in case of large network scales or high vehicle speed, SVAO performs better than the others.

关键词： Routing protocols Roads Routing Ad hoc networks Topology Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

Cyber-Physical Security Assessment and Simulation Based on Graph database

Cyber-Physical Security Assessment and Simulation Based on G...

引用

IEEE Conference on Energy Internet and Energy System Integration

作者： Di Wang Qinglai Guo Yan Song Kunlun Gao Aihua Zhou State Key Laboratory of Power Systems Department of Electrical Engineering Tsinghua University Electric Power Research Institute State Grid Shanghai Municipal Electric Power Company Advanced Computing and Big Data Laboratory of SGCC Global Energy Interconnection Research Institute

ISBN: (纸本)9781538614280

With the development of information technology, the operation of power grid increasingly depends upon the support of strong communication network. The power system consisting of grids infrastructure and communication equipment is a typical cyber-physical system(CPS). In recent years, power accidents that information-side failure impacts on physical operation happen at times. In order to simulate the impacts of information failure on grid operation, we develop a cyber-physical simulation tool for the secondary-voltage control of power system to implement the reasonable analysis and evaluation of the influence of different types of information failure on voltage control effect. In this paper, the graph database is introduced to construct the basic cyber-physical data model as an important part of the simulation tool, whose graphical modeling and management is friendly for users. In addition, the importance of different types of information is analyzed with the tool. It can be seen that the voltage information is more fragile and critical than the non-independent generator reactive information.

关键词： Cyber-physical system Graph database Cyber-contingency assessment Secondary-voltage control

来源：评论

学校读者我要写书评

暂无评论

Learning robust and discriminative low-rank representations for face recognition with occlusion

引用

Pattern Recognition 2017年 66卷 129-143页

作者： Guangwei Gao Jian Yang Xiao-Yuan Jing Fumin Shen Wankou Yang Dong Yue Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Engineering Laboratory of Big Data Analysis and Control for active distribution network Nanjing University of Posts and Telecommunications Nanjing China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control (Minjiang University) Fuzhou China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China School of Automation Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Automation Southeast University Nanjing China

For robust face recognition tasks, we particularly focus on the ubiquitous scenarios where both training and testing images are corrupted due to occlusions. Previous low-rank based methods stacked each error image into a vector and then used L 1 or L 2 norm to measure the error matrix. However, in the stacking step, the structure information of the error image can be lost. Depart from the previous methods, in this paper, we propose a novel method by exploiting the low-rankness of both the data representation and each occlusion-induced error image simultaneously, by which the global structure of data together with the error images can be well captured. In order to learn more discriminative low-rank representations, we formulate our objective such that the learned representations are optimal for classification with the available supervised information and close to an ideal-code regularization term. With strong structure information preserving and discrimination capabilities, the learned robust and discriminative low-rank representation (RDLRR) works very well on face recognition problems, especially with face images corrupted by continuous occlusions. Together with a simple linear classifier, the proposed approach is shown to outperform several other state-of-the-art face recognition methods on databases with a variety of face variations.

关键词： Face recognition Low-rank matrix recovery Nuclear norm

来源：评论

学校读者我要写书评

暂无评论

Real-time Information Service System for the Meteorological Screen Base on CDMA

Real-time Information Service System for the Meteorological ...

引用

2016 International Conference on Wireless Communication and Network Engineering (WCNE2016)

作者： Tai-sheng ZENG Ji-chang WEN College of Mathematics and Computer Science Quanzhu Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University College of Engineering Quanzhou Meteorological Bureau

Real-time Information Service System for the Meteorological Screen Base on CDMA is designed, a complete set of information gathering, processing, aggregating and publishing system for weather prediction products, disaster warning information, Typhoon real-time position information, weather information every ten minutes. Real-time weather information to the grouping of the LED display live information and notice is automatically released. The system contains user classification and display management module, disaster warning information into the module, all kinds Notice entry module, real-time weather information collected the summary module as well as real-time weather information automatically release the module.

关键词： LED CDMA Information service system

来源：评论

学校读者我要写书评

暂无评论

Secure searchable encryption:a survey

引用

Journal of Communications and Information Networks 2016年第4期1卷 52-65页

作者： WANG Yunling WANG Jianfeng CHEN Xiaofeng State Key Laboratory of Integrated Service Networks(ISN) Xidian UniversityXian 710071China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic TechnologyGuilin 541004China

Cloud computing facilitates convenient and on-demand network access to a centralized pool of ***,many users prefer to outsource data to the cloud in order to mitigate the burden of local ***,storing sensitive data on remote servers poses privacy challenges and is currently a source of ***(Searchable Encryption)is a positive way to protect users sensitive data,while preserving search ability on the server *** allows the server to search encrypted data without leaking information in plaintext *** two main branches of SE are SSE(Searchable Symmetric Encryption)and PEKS(Public key Encryption with keyword Search).SSE allows only private key holders to produce ciphertexts and to create trapdoors for search,whereas PEKS enables a number of users who know the public key to produce ciphertexts but allows only the private key holder to create *** article surveys the two main techniques of SE:SSE and *** SE schemes are categorized and compared in terms of functionality,efficiency,and ***,we point out some valuable directions for future work on SE schemes.

关键词： cloud storage encrypted data searchable encryption searchable symmetric encryption public key encryption with keyword search.

来源：评论

学校读者我要写书评

暂无评论

Author Correction: bigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

引用

Nature methods 2024年第10期21卷 1959页

作者： Linus Manubens-Gil Zhi Zhou Hanbo Chen Arvind Ramanathan Xiaoxiao Liu Yufeng Liu Alessandro Bria Todd Gillette Zongcai Ruan Jian Yang Miroslav Radojević Ting Zhao Li Cheng Lei Qu Siqi Liu Kristofer E Bouchard Lin Gu Weidong Cai Shuiwang Ji Badrinath Roysam Ching-Wei Wang Hongchuan Yu Amos Sironi Daniel Maxim Iascone Jie Zhou Erhan Bas Eduardo Conde-Sousa Paulo Aguiar Xiang Li Yujie Li Sumit Nanda Yuan Wang Leila Muresan Pascal Fua Bing Ye Hai-Yan He Jochen F Staiger Manuel Peter Daniel N Cox Michel Simonneau Marcel Oberlaender Gregory Jefferis Kei Ito Paloma Gonzalez-Bellido Jinhyun Kim Edwin Rubel Hollis T Cline Hongkui Zeng Aljoscha Nern Ann-Shyn Chiang Jianhua Yao Jane Roskams Rick Livesey Janine Stevens Tianming Liu Chinh Dang Yike Guo Ning Zhong Georgia Tourassi Sean Hill Michael Hawrylycz Christof Koch Erik Meijering Giorgio A Ascoli Hanchuan Peng Institute for Brain and Intelligence Southeast University Nanjing China. Microsoft Corporation Redmond WA USA. Tencent AI Lab Bellevue WA USA. Computing Environment and Life Sciences Directorate Argonne National Laboratory Lemont IL USA. Kaya Medical Seattle WA USA. University of Cassino and Southern Lazio Cassino Italy. Center for Neural Informatics Structures and Plasticity Krasnow Institute for Advanced Study George Mason University Fairfax VA USA. Faculty of Information Technology Beijing University of Technology Beijing China. Beijing International Collaboration Base on Brain Informatics and Wisdom Services Beijing China. Nuctech Netherlands Rotterdam the Netherlands. Janelia Research Campus Howard Hughes Medical Institute Ashburn VA USA. Department of Electrical and Computer Engineering University of Alberta Edmonton Alberta Canada. Ministry of Education Key Laboratory of Intelligent Computation and Signal Processing Anhui University Hefei China. Paige AI New York NY USA. Scientific Data Division and Biological Systems and Engineering Division Lawrence Berkeley National Lab Berkeley CA USA. Helen Wills Neuroscience Institute and Redwood Center for Theoretical Neuroscience UC Berkeley Berkeley CA USA. RIKEN AIP Tokyo Japan. Research Center for Advanced Science and Technology (RCAST) The University of Tokyo Tokyo Japan. School of Computer Science University of Sydney Sydney New South Wales Australia. Texas A&M University College Station TX USA. Cullen College of Engineering University of Houston Houston TX USA. Graduate Institute of Biomedical Engineering National Taiwan University of Science and Technology Taipei Taiwan. National Centre for Computer Animation Bournemouth University Poole UK. PROPHESEE Paris France. Department of Neuroscience Columbia University New York NY USA. Mortimer B. Zuckerman Mind Brain Behavior Institute Columbia University New York NY USA. Department of Computer Science Northern Illinois Universit

来源：评论

学校读者我要写书评

暂无评论

Answering why-not questions on metric probabilistic range queries

Answering why-not questions on metric probabilistic range qu...

引用

International Conference on data Engineering

作者： Lu Chen Yunjun Gao Kai Wang Christian S. Jensen Gang Chen College of Computer Science Zhejiang University Hangzhou China The Key Lab of Big Data Intelligent Computing of Zhejiang Province Zhejiang University Hangzhou China Department of Computer Science Aalborg University Denmark

ISBN: (纸本)9781509020218

Metric probabilistic range queries (MPRQ) have received substantial attention due to their utility in multimedia and text retrieval, decision making, etc. Existing MPRQ studies generally aim to improve query efficiency and resource usage. In contrast, we define and offer solutions to why-not questions on MPRQ. Given an original metric probabilistic range query and a why-not set W of uncertain objects that are absent from the query result, a why-not question on MPRQ explains why the uncertain objects in W do not appear in the query result, and provides refinements of the original query and/or W with the minimal penalty, so that the uncertain objects in W appear in the result of the refined query. Specifically, we propose a framework that consists of three efficient solutions, one that modifies the original query, one that modifies the why-not set, and one that modifies both the original query and the why-not set. Extensive experiments using both real and synthetic data sets offer insights into the properties of the proposed algorithms, and show that they are effective and efficient.

关键词： Probabilistic logic Extraterrestrial measurements Uncertainty Computers databases Multimedia communication

来源：评论

学校读者我要写书评

暂无评论

Multi-view Metric Learning for Multi-view Video Summarization

Multi-view Metric Learning for Multi-view Video Summarizatio...

引用

International Conference on Cyberworlds

作者： Linbo Wang Xianyong Fang Yanwen Guo Yanwei Fu MOE Key Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Data Science Fudan University China

Traditional methods on video summarization are designed to generate summaries for single-view video records, and thus they cannot fully exploit the mutual information in multi-view video records. In this paper, we present a multiview metric learning framework for multi-view video summarization. It combines the advantages of maximum margin clustering with the disagreement minimization criterion. The learning framework thus has the ability to find a metric that best separates the input data, and meanwhile to force the learned metric to maintain underlying intrinsic structure of data points, for example geometric information. Facilitated by such a framework, a systematic solution to the multi-view video summarization problem is developed from the viewpoint of metric learning. The effectiveness of the proposed method is demonstrated by experiments.

关键词： Extraterrestrial measurements Optimization Manifolds Visualization Minimization Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：