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

arXiv 2022年

作者： Huang, Siyu Wang, Tianyang Xiong, Haoyi Wen, Bihan Huan, Jun Dou, Dejing The Harvard John A. Paulson School of Engineering and Applied Sciences Harvard University CambridgeMA02134 United States The Department of Computer Science and Information Technology Austin Peay State University ClarksvilleTN37044 United States The Big Data Laboratory Baidu Research Beijing100193 China The School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore The AWS AI Lab Amazon SeattleWA98109 United States

While deep learning succeeds in a wide range of tasks, it highly depends on the massive collection of annotated data which is expensive and time-consuming. To lower the cost of data annotation, active learning has been proposed to interactively query an oracle to annotate a small proportion of informative samples in an unlabeled dataset. Inspired by the fact that the samples with higher loss are usually more informative to the model than the samples with lower loss, in this article we present a novel deep active learning approach that queries the oracle for data annotation when the unlabeled sample is believed to incorporate high loss. The core of our approach is a measurement temporal output discrepancy (TOD) that estimates the sample loss by evaluating the discrepancy of outputs given by models at different optimization steps. Our theoretical investigation shows that TOD lower-bounds the accumulated sample loss thus it can be used to select informative unlabeled samples. On basis of TOD, we further develop an effective unlabeled data sampling strategy as well as an unsupervised learning criterion for active learning. Due to the simplicity of TOD, our methods are efficient, flexible, and task-agnostic. Extensive experimental results demonstrate that our approach achieves superior performances than the state-of-the-art active learning methods on image classification and semantic segmentation tasks. In addition, we show that TOD can be utilized to select the best model of potentially the highest testing accuracy from a pool of candidate models. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

The Research on Clustering Ensembles Selection Algorithm based on Semi-supervised K-means Clustering

引用

Journal of Physics: Conference Series 2021年第1期1732卷

作者： Xiaoxuan Wu Changjian Guo Tanglei Hu School of Artificial Intelligence and Big Data Hefei University Hefei China Anhui Engineering Lab of Big Data Technology Application for Urban Infrastructure Hefei University Hefei China Institute of Business Intelligence Hefei University of Technology Hefei China

Selective clustering ensemble algorithm can eliminate the inferior quality clustering member's influence and can achieve a better clustering solution relative to the clustering ensemble algorithm. For high dimensional data clustering, in this paper, a novel selective ensemble algorithm based on semi-supervised K-means clustering is proposed. In this paper, through a large number of experiments to verify the validity of the proposed algorithm for dealing with high dimensional data clustering. The new algorithm can achieve statistically significant performance improvement over other clustering algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Shattered chain of trust: understanding security risks in cross-cloud IoT access delegation 20

Shattered chain of trust: understanding security risks in cr...

引用

Proceedings of the 29th USENIX Conference on Security Symposium

作者： Bin Yuan Yan Jia Luyi Xing Dongfang Zhao XiaoFeng Wang Deqing Zou Hai Jin Yuqing Zhang School of Cyber Science and Engineering Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center and Indiana University Bloomington and Shenzhen Huazhong University of Science and Technology Research Institute China School of Cyber Engineering Xidian University China and National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences China and Indiana University Bloomington Indiana University Bloomington School of Cyber Science and Engineering Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong Univ. of Sci. & Tech. China and National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab and Big Data Security Engineering Research Center Huazhong Univ. of Sci. & Tech. China National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences China and School of Cyber Engineering Xidian University China

ISBN: (纸本)9781939133175

IoT clouds facilitate the communication between IoT devices and users, and authorize users' access to their devices. In this paradigm, an IoT device is usually managed under a particular IoT cloud designated by the device vendor, e.g., Philips bulbs are managed under Philips Hue cloud. Today's mainstream IoT clouds also support device access delegation across different vendors (e.g., Philips Hue, LIFX, etc.) and cloud providers (e.g., Google, IFTTT, etc.): for example, Philips Hue and SmartThings clouds support to delegate device access to another cloud such as Google Home, so a user can manage multiple devices from different vendors all through Google Home. Serving this purpose are the IoT delegation mechanisms developed and utilized by IoT clouds, which we found are heterogeneous and ad-hoc in the wild, in the absence of a standardized delegation protocol suited for IoT environments. In this paper, we report the first systematic study on real-world IoT access delegation, based upon a semi-automatic verification tool we developed. Our study brought to light the pervasiveness of security risks in these delegation mechanisms, allowing the adversary (e.g., Airbnb tenants, former employees) to gain unauthorized access to the victim's devices (e.g., smart locks) or impersonate the devices to trigger other devices. We confirmed the presence of critical security flaws in these mechanisms through end-to-end exploits on them, and further conducted a measurement study. Our research demonstrates the serious consequences of these exploits and the security implications of the practice today for building these mechanisms. We reported our findings to related parties, which acknowledged the problems. We further propose principles for developing more secure cross-cloud IoT delegation services, before a standardized solution can be widely deployed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal Margin Distribution Machine with Sparsity Inducing Penalty

Optimal Margin Distribution Machine with Sparsity Inducing P...

引用

International Conference on big data and Smart Computing (bigCOMP)

作者： Teng Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

Recently a promising research direction of statistical learning has been advocated, i.e., the optimal margin distribution learning, with the central idea of optimizing the margin distribution. As the most representative approach of this new learning paradigm, the optimal margin distribution machine (ODM) considers maximizing the margin mean and minimizing the margin variance simultaneously. The standard ODM exploits the ℓ_2-norm penalty, which gives rise to a dense decision boundary. However, in some situations, the model with parsimonious representation is more preferred, due to the redundant noisy features or limited computing resources. In this paper, we propose the sparse optimal margin distribution machine (Sparse ODM), which aims to achieve better generalization performance with moderate model size. For optimization, we extends an efficient coordinate descent method to solve the final problem since the variables are decoupled. In each iteration, we propose a modified Newton method to solve the one-variable sub-problem. Experimental results on both synthetic and real data sets show the superiority of the proposed method.

关键词： Standards Newton method Noise measurement Optimization Support vector machines Computational modeling Training

来源：评论

学校读者我要写书评

暂无评论

HMRNet: High and Multi-Resolution Network with Bidirectional Feature Calibration for Brain Structure Segmentation in Radiotherapy

arXiv

引用

arXiv 2022年

作者： Fu, Hao Wang, Guotai Lei, Wenhui Xu, Wei Zhao, Qianfei Zhang, Shichuan Li, Kang Zhang, Shaoting The School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China Chengdu611731 China Shanghai AI Laboratory Shanghai200030 China Department of Radiation Oncology Sichuan Cancer Hospital and Institute University of Electronic Science and Technology of China Chengdu610042 China West China Hospital-SenseTime Joint Lab West China Biomedical Big Data Center Sichuan University West China Hospital Chengdu610041 China SenseTime Research Shanghai200233 China

Accurate segmentation of Anatomical brain Barriers to Cancer spread (ABCs) plays an important role for automatic delineation of Clinical Target Volume (CTV) of brain tumors in radiotherapy. Despite that variants of U-Net are state-of-the-art segmentation models, they have limited performance when dealing with ABCs structures with various shapes and sizes, especially thin structures (e.g., the falx cerebri) that span only few slices. To deal with this problem, we propose a High and Multi-Resolution Network (HMRNet) that consists of a multi-scale feature learning branch and a high-resolution branch, which can maintain the high-resolution contextual information and extract more robust representations of anatomical structures with various scales. We further design a Bidirectional Feature Calibration (BFC) block to enable the two branches to generate spatial attention maps for mutual feature calibration. Considering the different sizes and positions of ABCs structures, our network was applied after a rough localization of each structure to obtain fine segmentation results. Experiments on the MICCAI 2020 ABCs challenge dataset showed that: 1) Our proposed two-stage segmentation strategy largely outperformed methods segmenting all the structures in just one stage;2) The proposed HMRNet with two branches can maintain high-resolution representations and is effective to improve the performance on thin structures;3) The proposed BFC block outperformed existing attention methods using monodirectional feature calibration. Our method won the second place of ABCs 2020 challenge and has a potential for more accurate and reasonable delineation of CTV of brain tumors. © 2022, CC BY.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

Parameter decoupling strategy for semi-supervised 3D left atrium segmentation

arXiv

引用

arXiv 2021年

作者： Hao, Xuanting Gao, Shengbo Sheng, Lijie Zhang, Jicong School of Biological Science and Medical Engineering Beihang University Beijing China School of Computer Science and Technology Xidian University China Hefei Innovation Research Institute Beihang University Anhui Hefei China Beijing Advanced Innovation Centre for Biomedical Engineering Beihang University Beijing Advanced Innovation Centre for Big Data-Based Precision Medicine Beihang University Beijing China

Consistency training has proven to be an advanced semi-supervised framework and achieved promising results in medical image segmentation tasks through enforcing an invariance of the predictions over different views of the inputs. However, with the iterative updating of model parameters, the models would tend to reach a coupled state and eventually lose the ability to exploit unlabeled data. To address the issue, we present a novel semi-supervised segmentation model based on parameter decoupling strategy to encourage consistent predictions from diverse views. Specifically, we first adopt a two-branch network to simultaneously produce predictions for each image. During the training process, we decouple the two prediction branch parameters by quadratic cosine distance to construct different views in latent space. Based on this, the feature extractor is constrained to encourage the consistency of probability maps generated by classifiers under diversified features. In the overall training process, the parameters of feature extractor and classifiers are updated alternately by consistency regularization operation and decoupling operation to gradually improve the generalization performance of the model. Our method has achieved a competitive result over the state-of-the-art semi-supervised methods on the Atrial Segmentation Challenge dataset, demonstrating the effectiveness of our framework. Code is available at https://***/BX0903/PDC. © 2021, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

MoCA: Incorporating multi-stage domain pretraining and cross-guided multimodal attention for Textbook Question Answering

arXiv

引用

arXiv 2021年

作者： Xu, Fangzhi Lin, Qika Liu, Jun Zhang, Lingling Zhao, Tianzhe Chai, Qi Pan, Yudai Department of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D Xi'an Jiaotong University China

Textbook Question Answering (TQA) is a complex multimodal task to infer answers given large context descriptions and abundant diagrams. Compared with Visual Question Answering(VQA), TQA contains a large number of uncommon terminologies and various diagram inputs. It brings new challenges to the representation capability of language model for domain-specific spans. And it also pushes the multimodal fusion to a more complex level. To tackle the above issues, we propose a novel model named MoCA, which incorporates multi-stage domain pretraining and multimodal cross attention for the TQA task. Firstly, we introduce a multi-stage domain pretraining module to conduct unsupervised post-pretraining with the span mask strategy and supervised pre-finetune. Especially for domain post-pretraining, we propose a heuristic generation algorithm to employ the terminology corpus. Secondly, to fully consider the rich inputs of context and diagrams, we propose cross-guided multimodal attention to update the features of text, question diagram and instructional diagram based on a progressive strategy. Further, a dual gating mechanism is adopted to improve the model ensemble. The experimental results show the superiority of our model, which outperforms the state-of-the-art methods by 2.21% and 2.43% for validation and test split respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Textbooks

来源：评论

学校读者我要写书评

暂无评论

High Performance DDoS Attack Detection System Based on Distribution Statistics 16th

High Performance DDoS Attack Detection System Based on Distr...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2019

作者： Xie, Xia Li, Jinpeng Hu, Xiaoyang Jin, Hai Chen, Hanhua Ma, Xiaojing Huang, Hong National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783030307080

Nowadays, web servers often face the threat of distributed denial of service attacks and their intrusion prevention systems cannot detect those attacks effectively. Many existing intrusion prevention systems detect attacks by the state of per-flow and current processing speed cannot fulfill the requirements of real-time detection due to the high speed traffic. In this paper, we propose a powerful system TreeSketchShield which can improve sketch data structure and detect attacks quickly. First, we discuss a novel structure TreeSketch to obtain statistics of network flow, which utilizes the stepped structure of binary tree to map the distribution and reduces the complexity of the statistic calculation. Second, we present a two-level detection scheme that could make a compromise between the detection speed and detection accuracy. Experimental results show that our method can process more than 100,000 records per second. The false alarm rate can achieve 2% to 25% performance improvement. © 2019, IFIP International Federation for Information Processing.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

Failure order: A missing piece in disk failure processing of data centers 21

Failure order: A missing piece in disk failure processing of...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Yi, Yusheng Xiao, Jiang Wu, Song Li, Huichuwu Jin, Hai National Engineering Research Center for Big Data Technology System Services Computing Technology System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781728120584

To avoid data loss, data centers adopt disk failure prediction (DFP) technology to raise warnings ahead of actual disk failures, and process the warnings in the order they are raised, i.e., a first-in-first-out (FIFO) warning order. The FIFO-guided warning order can process warnings timely when disk failures are rare in data centers. With the growing scale of data centers, the increasing number of disk failures leads to a complex situation that multiple warnings are raised simultaneously, where the FIFO-guided warning order neither processes warnings timely, nor manages warnings properly due to lack of the priority of warnings. Thus, a real-time and finer-grained priority guidance for warning order management is an urgent need. To this end, we turn our attention to the failures since each warning corresponds to a fail event. The key insight is that the interdependence of failures, i.e., the order failure occurred, indicates the order of warning processing. With an accurate failure order, data centers can decrease the probability of data loss and the downtime of latency-sensitive applications by processing urgent warnings in advance. In this paper, we predict the failure order with a LambdaMART model, which is a state-of-the-art ranking algorithm in information retrieval. To avoid overly concerning on the correctness of high-rank warnings in information retrieval, we design a symmetric metric to evaluate the prediction evaluation of failure order. Experiment on a public dataset, provided by the Backblaze company, shows that our model outperforms the FIFO order and the order from previous DFP models. © 2019 IEEE.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

data Anonymization for big Crowdsourcing data

Data Anonymization for Big Crowdsourcing Data

引用

2019 INFOCOM IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2019

作者： Deng, Xiaofeng Zhang, Fan Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781728118789

In traditional database systems, data anonymization has been extensively studied, it provides an effective solution for data privacy preservation, and multidimensional anonymization scheme among them is widely used. However, without delicate parameter settings, these technologies may cause uncontrollable information loss and decrease the accuracy of data analytic tasks. Furthermore, crowdsourcing data is usually huge in amount and must be distributed stored in clouds, which makes the conventional data anonymization technologies not applicable. In this paper, we propose a framework that uses MapReduce to anonymize large-scale data before disseminating them to human workers. In order to guarantee the number and distribution of data records to be similar in all nodes, our framework first redistributes the original data to all participating nodes. Then a heuristic two-phase anonymization schema, which can be seamlessly integrated into the framework, is proposed. Experimental results show that with the same objective of privacy, our approach is scalable for large-scale data and can improve the average accuracy of human worker's analytic tasks. © 2019 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：