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

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

来源：评论

学校读者我要写书评

暂无评论

A differential public PUF design for lightweight authentication 16

A differential public PUF design for lightweight authenticat...

引用

2021 International Conference on Synthesis, Modeling, Analysis and Simulation Methods and Applications to Circuit Design, SMACD 2021 and 16th Conference on PhD Research in Microelectronics and Electronics, PRIME 2021

作者： Duan, Shengyu Sai, Gaole School of Computer Engineering and Science Shanghai University Shanghai200444 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Guangdong Provincial Key Lab of Robotics and Intelligent System Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China CAS Key Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institutes of Advanced Technology China

ISBN: (纸本)9783800755899

Physical Unclonable Functions (PUFs) have emerged as a promising primitive to provide a hardware keyless security mechanism for integrated circuit applications. Public PUFs (PPUFs) address the crucial PUF vulnerability of requiring databases to store the secrete reference information. This paper investigates one of the PPUF families, differential PPUF (dPPUF), which exploits complexly interacted logic to create time gap between actual execution and simulation, and to prevent simulation attacks. Conventional dPPUFs have high costs. We observe the repressers have large impact on simulation time, but take a great proportion in current dPPUF structure. We thereby present a represser network with specially designed interconnection and shared logic, to maintain a high circuit complexity and to reduce the area cost. We show the proposed dPPUF has similar resilience over simulation attacks as the conventional design. Area cost can be reduced by up to 44%, and thus the proposed design can be used for lightweight authentication. © VDE VERLAG GMBH.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Parallel implementation of apriori algorithm based on MapReduce

Parallel implementation of apriori algorithm based on MapRed...

引用

13th ACIS International Conference on Software Engineering, Artificial intelligence, Networking, and Parallel/Distributed computing, SNPD 2012

作者： Li, Ning Zeng, Li He, Qing Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University Chinese Academy of Sciences Beijing 100139 China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 Hebei China

ISBN: (纸本)9780769547619

Searching frequent patterns in transactional databases is considered as one of the most important data mining problems and Apriori is one of the typical algorithms for this task. Developing fast and efficient algorithms that can handle large volumes of data becomes a challenging task due to the large databases. In this paper, we implement a parallel Apriori algorithm based on MapReduce, which is a framework for processing huge datasets on certain kinds of distributable problems using a large number of computers (nodes). The experimental results demonstrate that the proposed algorithm can scale well and efficiently process large datasets on commodity hardware. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

SpEx+: A complete time domain speaker extraction network 21

SpEx+: A complete time domain speaker extraction network

引用

21st Annual Conference of the International Speech Communication Association, INTERSPEECH 2020

作者： Ge, Meng Xu, Chenglin Wang, Longbiao Chng, Eng Siong Dang, Jianwu Li, Haizhou Tianjin Key Laboratory of Cognitive Computing and Application College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science and Engineering Nanyang Technological University Singapore Japan Advanced Institute of Science and Technology Ishikawa Japan Department of Electrical and Computer Engineering National University of Singapore Singapore Machine Listening Lab University of Bremen Germany

ISBN: (纸本)9781713820697

Speaker extraction aims to extract the target speech signal from a multi-talker environment given a target speaker's reference speech. We recently proposed a time-domain solution, SpEx, that avoids the phase estimation in frequency-domain approaches. Unfortunately, SpEx is not fully a time-domain solution since it performs time-domain speech encoding for speaker extraction, while taking frequency-domain speaker embedding as the reference. The size of the analysis window for time-domain and the size for frequency-domain input are also different. Such mismatch has an adverse effect on the system performance. To eliminate such mismatch, we propose a complete time-domain speaker extraction solution, that is called SpEx+. Specifically, we tie the weights of two identical speech encoder networks, one for the encoder-extractor-decoder pipeline, another as part of the speaker encoder. Experiments show that the SpEx+ achieves 0.8dB and 2.1dB SDR improvement over the state-of-the-art SpEx baseline, under different and same gender conditions on WSJ0-2mix-extr database respectively. Copyright © 2020 ISCA

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

EEG Data Augmentation for Emotion Recognition Using a Conditional Wasserstein GAN 40

EEG Data Augmentation for Emotion Recognition Using a Condit...

引用

40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBC 2018

作者： Luo, Yun Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai200240 China

ISBN: (纸本)9781538636466

Due to the lack of electroencephalography (EEG) data, it is hard to build an emotion recognition model with high accuracy from EEG signals using machine learning approach. Inspired by generative adversarial networks (GANs), we introduce a Conditional Wasserstein GAN (CWGAN) framework for EEG data augmentation to enhance EEG-based emotion recognition. A Wasserstein GAN with gradient penalty is adopted to generate realistic-like EEG data in differential entropy (DE) form. Three indicators are used to judge the qualities of the generated high-dimensional EEG data, and only high quality data are appended to supplement the data manifold, which leads to better classification of different emotions. We evaluate the proposed CWGAN framework on two public EEG datasets for emotion recognition, namely SEED and DEAP. The experimental results demonstrate that using the EEG data generated by CWGAN significantly improves the accuracies of emotion recognition models. © 2018 IEEE.

关键词： Electroencephalography Gallium nitride Training Generators Emotion recognition Generative adversarial networks Brain modeling

来源：评论

学校读者我要写书评

暂无评论

Frozen-DETR: Enhancing DETR with Image Understanding from Frozen Foundation Models 38

Frozen-DETR: Enhancing DETR with Image Understanding from Fr...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Fu, Shenghao Yan, Junkai Yang, Qize Wei, Xihan Xie, Xiaohua Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University China Peng Cheng Laboratory Shenzhen518055 China Tongyi Lab Alibaba Group China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China Guangdong Province Key Laboratory of Information Security Technology China Guangdong Guangzhou510555 China

Recent vision foundation models can extract universal representations and show impressive abilities in various tasks. However, their application on object detection is largely overlooked, especially without fine-tuning them. In this work, we show that frozen foundation models can be a versatile feature enhancer, even though they are not pre-trained for object detection. Specifically, we explore directly transferring the high-level image understanding of foundation models to detectors in the following two ways. First, the class token in foundation models provides an in-depth understanding of the complex scene, which facilitates decoding object queries in the detector's decoder by providing a compact context. Additionally, the patch tokens in foundation models can enrich the features in the detector's encoder by providing semantic details. Utilizing frozen foundation models as plug-and-play modules rather than the commonly used backbone can significantly enhance the detector's performance while preventing the problems caused by the architecture discrepancy between the detector's backbone and the foundation model. With such a novel paradigm, we boost the SOTA query-based detector DINO from 49.0% AP to 51.9% AP (+2.9% AP) and further to 53.8% AP (+4.8% AP) by integrating one or two foundation models respectively, on the COCO validation set after training for 12 epochs with R50 as the detector's backbone. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A HSC-based sample selection method for Support Vector machine

A HSC-based sample selection method for Support Vector Machi...

引用

International Conference on machine Learning and Cybernetics

作者： He, Qing Li, Ning Shi, Zhong-Zhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Hebei University Baoding 071002 Hebei China Graduate University of Chinese Academy of Sciences Hebei University Baoding 071002 Hebei China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 Hebei China

ISBN: (纸本)9781424465262

Support Vector machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the samples, the time complexity will also increase. So it is necessary to shrink training sets to reduce the time complexity. A sample selection method for SVM is proposed in this paper. It is inspired from the Hyper surface classification (HSC), which is a universal classification method based on Jordan Curve Theorem, and there is no need for mapping from lower-dimensional space to higher-dimensional space. The experiments show that the algorithm shrinks training sets keeping the accuracy for unseen vectors high. © 2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

MINI-Net: Multiple Instance Ranking Network for Video Highlight Detection 16th

MINI-Net: Multiple Instance Ranking Network for Video Highli...

引用

16th European Conference on Computer Vision, ECCV 2020

作者： Hong, Fa-Ting Huang, Xuanteng Li, Wei-Hong Zheng, Wei-Shi School of Data and Computer Science Sun Yat-sen University Guangzhou China Peng Cheng Laboratory Shenzhen518005 China VICO Group University of Edinburgh Edinburgh United Kingdom Pazhou Lab Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

ISBN: (纸本)9783030586003

We address the weakly supervised video highlight detection problem for learning to detect segments that are more attractive in training videos given their video event lab.l but without expensive supervision of manually annotating highlight segments. While manually averting localizing highlight segments, weakly supervised modeling is challenging, as a video in our daily life could contain highlight segments with multiple event types, e.g., skiing and surfing. In this work, we propose casting weakly supervised video highlight detection modeling for a given specific event as a multiple instance ranking network (MINI-Net) learning. We consider each video as a bag of segments, and therefore, the proposed MINI-Net learns to enforce a higher highlight score for a positive bag that contains highlight segments of a specific event than those for negative bags that are irrelevant. In particular, we form a max-max ranking loss to acquire a reliable relative comparison between the most likely positive segment instance and the hardest negative segment instance. With this max-max ranking loss, our MINI-Net effectively leverages all segment information to acquire a more distinct video feature representation for localizing the highlight segments of a specific event in a video. The extensive experimental results on three challenging public benchmarks clearly validate the efficacy of our multiple instance ranking approach for solving the problem. © 2020, Springer Nature Switzerland AG.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

High-throughput Sampling, Communicating and Training for Reinforcement Learning Systems

High-throughput Sampling, Communicating and Training for Rei...

引用

International Workshop on Quality of Service

作者： Laiping Zhao Xinan Dai Zhixin Zhao Yusong Xin Yitao Hu Jun Qian Jun Yao Keqiu Li Tianjin Key Lab. of Advanced Networking College of Intelligence & Computing Tianjin University Tianjin China Noahs Ark Lab Huawei Beijing China

Reinforcement Learning (RL) algorithms require large amounts of computational resources and time to train due to the simultaneous model training and real-time interactions with simulation environments. This results in an RL algorithm's training time potentially exceeding days to months. We present HRL, a comprehensive optimization system designed to improve the system throughput of RL algorithms. HRL addresses the challenges of discovering and identifying bottlenecks in the sampling, training, or communication stages and promptly improving their performance. We propose a group-parallel pipeline method to improve the sampling efficiency and apply data quantization and multi-learner training to resolve the network and learning bottlenecks. The HRL system has been fully implemented and integrated with XingTian. The results of the experiments show that the HRL system can improve the throughput by 18.6%-90.6%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Embedding dynamic attributed networks by modeling the evolution processes

arXiv

引用

arXiv 2020年

作者： Xu, Zenan Ou, Zijing Su, Qinliang Yu, Jianxing Quan, Xiaojun Lin, Zhenkun School of Data and Computer Science Sun Yat-sen University China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

Network embedding has recently emerged as a promising technique to embed nodes of a network into low-dimensional vectors. While fairly successful, most existing works focus on the embedding techniques for static networks. But in practice, there are many networks that are evolving over time and hence are dynamic, e.g., the social networks. To address this issue, a high-order spatio-temporal embedding model is developed to track the evolutions of dynamic networks. Specifically, an activeness-aware neighborhood embedding method is first proposed to extract the high-order neighborhood information at each given timestamp. Then, an embedding prediction framework is further developed to capture the temporal correlations, in which the attention mechanism is employed instead of recurrent neural networks (RNNs) for its efficiency in computing and flexibility in modeling. Extensive experiments are conducted on four real-world datasets from three different areas. It is shown that the proposed method outperforms all the baselines by a substantial margin for the tasks of dynamic link prediction and node classification, which demonstrates the effectiveness of the proposed methods on tracking the evolutions of dynamic networks. Copyright © 2020, The Authors. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：