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

CurveCluster: Automated Recognition of Hard Landing Patterns Based on QAR Curve Clustering

学校读者我要写书评

暂无评论

CurveCluster: Automated Recognition of Hard Landing Patterns...

Symposia and Workshops on Ubiquitous, Autonomic and Trusted computing, UIC-ATC

作者： Xu Li Jiaxing Shang Linjiang Zheng Dajiang Liu Lin Qi Liu Liu College of Computer Science Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University China College of Computer Science Chongqing University China Data Analysis Department Sichuan Hantai Technology Co. Ltd. Chengdu China

ISBN: (数字)9781728140346

ISBN: (纸本)9781728140353

Flight safety is of vital importance to the aviation industry. As one of the most typical security events, hard landing is extremely concerned by airlines and related studies have received extensive attention in recent years. However, existing regression or risk based models either suffers from low prediction accuracy, or cannot provide good interpretability, making themselves impractical in real applications. To solve these problems, in this paper we propose CurveCluster: a curve clustering-based approach which is able to automatically recognize hard landing patterns from quick access recorder (QAR) data. We first provide a two-level hierarchical classification of hard landing events based on different hard landing patterns. Then we extract curve features from several key QAR parameters through interpolation and resampling. Finally, we apply K-means clustering algorithm on the curve features to automatically recognize the hard landing patterns. We test our approach on a dataset of 9,203 A320 flight QAR data samples and the overall recognition accuracy reaches up to 93.1%. Moreover, our results directly reflect the reasons of different types of hard landing events, which show strong interpretability.

关键词： Feature extraction Interpolation Atmospheric modeling Pattern recognition Aircraft Machine learning Safety

Decode the Dark Side of the Language: Applications of LLMs in the Dark Web

学校读者我要写书评

暂无评论

Decode the Dark Side of the Language: Applications of LLMs i...

IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Hongfan Chen Yigang Diao Hui Xiang Yixuan Huo Xiaqing Xie Jiapeng Zhao Xuebin Wang Yanwei Sun Jinqiao Shi School of Cyberspace Security Beijing University of Posts and Telecommunications Beijing China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China Cyberspace Administration of China Data and Technology Support Center Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350391367

ISBN: (纸本)9798350391374

Previous studies have discovered that Transformers pre-trained on large scale datasets have a great advantage over traditional methods and can achieve human-level performance in many NLP tasks. Various encoder-only models like BERT and RoBERTa are used in the researches of the language in the Dark Web and most of them have achieved state-of-the-art performance. However, decoder-only models are not frequently used as they were considered to be unsuitable for NLU tasks until recent advancements in large language models. In this paper, we discuss the application of large scale decoder-only models in NLP tasks of real-world Dark Web research. We explore the capabilities of these models with the most realistic datasets in this specific domain. Surprisingly, results show that decoder-only models can achieve similar or better performance compared with state-of-the-art encoder-only model in some cases and show their own unique advantages in such field. We also discuss the limitations of these models and the challenges associated with their application in such field. Our study unveils the potential of decoder-only models in NLP tasks of real-world Dark Web research.

关键词： Dark Web Large language models Text categorization Zero shot learning Cyberspace Data science Transformers Natural language processing Data models Encoding

A simple low-degree optimal finite element scheme for the elastic transmission eigenvalue problem

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Xi, Yingxia Ji, Xia Zhang, Shuo School of Science Nanjing University of Science and Technology Nanjing210094 China School of Mathematics and Statistics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 China LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing100190 China

The paper presents a finite element scheme for the elastic transmission eigenvalue problem written as a fourth order eigenvalue problem. The scheme uses piecewise cubic polynomials and obtains optimal convergence rate. Compared with other low-degree and nonconforming finite element schemes, the scheme inherits the continuous bilinear form which does not need extra stabilizations and is thus simple to *** Codes 31A30, 65N30, 47B07 Copyright © 2021, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

Greedy signal space recovery algorithm with overcomplete dictionaries in compressive sensing

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhu, Jianchen Zhao, Shengjie Shi, Qingjiang Arce, Gonzalo R. College of Electronics and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Software Engineering Tongji University Shanghai201804 China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

Compressive Sensing (CS) is a new paradigm for the efficient acquisition of signals that have sparse representation in a certain domain. Traditionally, CS has provided numerous methods for signal recovery over an orthonormal basis. However, modern applications have sparked the emergence of related methods for signals not sparse in an orthonormal basis but in some arbitrary, perhaps highly overcomplete, dictionary, particularly due to their potential to generate different kinds of sparse representation of signals. To this end, we apply a signal space greedy method, which relies on the ability to optimally project a signal onto a small number of dictionary atoms, to address signal recovery in this setting. We describe a generalized variant of the iterative recovery algorithm called Signal space Subspace Pursuit (SSSP) for this more challenging setting. Here, using the Dictionary-Restricted Isometry Property (D-RIP) rather than classical RIP, we derive a low bound on the number of measurements required and then provide the proof of convergence for the algorithm. The algorithm in noisy and noise-free measurements has low computational complexity and provides high recovery accuracy. Simulation results show that the algorithm outperforms best compared with the existing recovery algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Compressed sensing

Cross-Image Siamese Graph Convolutional Network For Fine-Grained Image Retrieval in Diabetic Retinopathy

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Chen, Fang Zhao, Weiling Zhou, Xiaobo School of Electronics and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Biomedical Informatics The University of Texas Health Science Center at Houston HoustonTX77030 United States Center for Computational Systems Medicine

The categories of diabetic retinopathy (DR) are interrelated, and different ophthalmologists often give different results for the same fundus image. Automatic cross image retrieval of DR can provide an effective diagnostic solution for ophthalmologists and is of great significance in clinical practice. Cross-image (i.e. left and right fundus images for a patient) information is highly correlated and complementary and can be harnessed to improve various computer vision tasks such as image classification, object detection, image segmentation, and image retrieval. Previous studies did not explore the correlation between lesion areas in left and right fundus images of patients, limiting the effective diagnosis of DR. In this study, we proposed a cross-image siamese graph convolutional network(CIS-GCN) to retrieve fine-grained diabetic retinopathy fundus images. First, we constructed a global-specific structure to obtain the specific features of the left and right eyes. Then, we passed the specific features through the pathological localization network to obtain the location features of the lesion. Finally, a graph convolutional neural network was introduced to construct node sets for the left and right eyes, respectively, to represent relatively consistent regions in the fundus images of patients and learn their correlations. We tested our method using Diabetic Retinopathy Detection datasets and the results showed that our algorithm outperforms other state-of-the-art methods by 2.2% ~ 3.7% in image data retrieval. © 2023, The Authors. All rights reserved.

关键词： Object detection

A semi-supervised text clustering algorithm based on pairwise constraints

学校读者我要写书评

暂无评论

Journal of Information and Computational Science 2011年第6期8卷 951-960页

作者： Zhong, Jiang Dong, Gaofeng Zhou, Ying Li, Xue Liu, Longhai Chen, Qiang College of Computer Science Chongqing University Chongqing 400044 China Chongqing Management Center of Housing Provident Fund Chongqing 400015 China School of Information Technology and Electrical Engineering Queensland University Queensland QLD 4072 Australia Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing 400044 China

In this paper, an active learning method which can effectively select pairwise constraints during clustering procedure was presented. A novel semi-supervised text clustering algorithm was proposed, which employed an effective pairwise constraints selection method. As the samples on the fuzzy boundary are far away from the cluster center in the clustering procedure, they can be easily divided into the wrong clusters. Therefore, we choose the pairwise constraint points from the fuzzy boundary to guide the clustering process towards appropriate partition. The experimental results show that the proposed algorithm can effectively improve the text clustering results by using the same amount of pairwise constraints. © 2011 Binary Information Press.

关键词： Supervised learning

CSformer: Bridging Convolution and Transformer for Compressive Sensing

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ye, Dongjie Ni, Zhangkai Wang, Hanli Zhang, Jian Wang, Shiqi Kwong, Sam The Department of Computer Science City University of Hong Kong 999077 Hong Kong The Department of Computer Science & Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China The School of Electronic and Computer Engineering Peking University Shenzhen Graduate School Shenzhen518055 China The Peng Cheng Laboratory Shenzhen518052 China The City University of Hong Kong Shenzhen Research Institute Shenzhen518057 China

Convolution neural networks (CNNs) have succeeded in compressive image sensing. However, due to the inductive bias of locality and weight sharing, the convolution operations demonstrate the intrinsic limitations in modeling the long-range dependency. Transformer, designed initially as a sequence-to-sequence model, excels at capturing global contexts due to the self-attention-based architectures even though it may be equipped with limited localization abilities. This paper proposes CSformer, a hybrid framework that integrates the advantages of leveraging both detailed spatial information from CNN and the global context provided by transformer for enhanced representation learning. The proposed approach is an end-to-end compressive image sensing method, composed of adaptive sampling and recovery. In the sampling module, images are measured block-by-block by the learned sampling matrix. In the reconstruction stage, the measurement is projected into dual stems. One is the CNN stem for modeling the neighborhood relationships by convolution, and the other is the transformer stem for adopting global self-attention mechanism. The dual branches structure is concurrent, and the local features and global representations are fused under different resolutions to maximize the complementary of features. Furthermore, we explore a progressive strategy and window-based transformer block to reduce the parameter and computational complexity. The experimental results demonstrate the effectiveness of the dedicated transformer-based architecture for compressive sensing, which achieves superior performance compared to state-of-the-art methods on different datasets. Copyright © 2021, The Authors. All rights reserved.

关键词： Compressed sensing

A Hybrid Routing Algorithm based on Destruction Resistance Cost and Reliability in Flying Ad-Hoc Networks

学校读者我要写书评

暂无评论

A Hybrid Routing Algorithm based on Destruction Resistance C...

International Conference on Computer and Communications (ICCC)

作者： Kun Guo Dongbin Wang Hui Zhi Yibo Gao Tao Zhang Tiejun Lv Yueming Lu Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing China National Engineering Laboratory for Mobile Network Beijing University of Posts and Telecommunications Beijing China TravelSky Technology Limited Beijing China Cyberspace Security Research Center Peng Cheng Laboratory Beijing University of Posts and Telecommunications Beijing China China Academy of Launch Vehicle Technology Beijing China

ISBN: (纸本)9781665409513

Existing routing algorithms in Flying Ad-Hoc Net- works (FANETs) lack the optimization consideration of destruction resistance cost caused by routing recovery when some nodes fail suddenly. In this paper, we propose a hybrid routing algorithm based on destruction resistance cost and reliability. Based on the real-time network topology and network state, the algorithm can provide a multi-parameters-based routing path with low destruction resistance cost for communication transmission. It can ensure that the main routing path can be quickly recovered after interruption and reduce the process of discovering new routing paths. We have constructed a variety of simulation scenarios to analyze the proposed algorithm and the existing algorithms. The simulation results show that the pro- posed algorithm has good performance in reducing destruction resistance cost.

关键词： Resistance Analytical models Costs Computer network reliability Simulation Routing Real-time systems

GenFace: A Large-Scale Fine-Grained Face Forgery Benchmark and Cross Appearance-Edge Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Yaning Yu, Zitong Wang, Tianyi Huang, Xiaobin Shen, Linlin Gao, Zan Ren, Jianfeng Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Nanyang Technological University 50 Nanyang Ave Block N 4 639798 Singapore Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518129 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University China Jinan250014 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin300384 China School of Computer Science University of Nottingham Ningbo China

The rapid advancement of photorealistic generators has reached a critical juncture where the discrepancy between authentic and manipulated images is increasingly indistinguishable. Thus, benchmarking and advancing techniques detecting digital manipulation become an urgent issue. Although there have been a number of publicly available face forgery datasets, the forgery faces are mostly generated using GAN-based synthesis technology, which does not involve the most recent technologies like diffusion. The diversity and quality of images generated by diffusion models have been significantly improved and thus a much more challenging face forgery dataset shall be used to evaluate SOTA forgery detection literature. In this paper, we propose a large-scale, diverse, and fine-grained high-fidelity dataset, namely GenFace, to facilitate the advancement of deepfake detection, which contains a large number of forgery faces generated by advanced generators such as the diffusion-based model and more detailed labels about the manipulation approaches and adopted generators. In addition to evaluating SOTA approaches on our benchmark, we design an innovative Cross Appearance-Edge Learning (CAEL) detector to capture multi-grained appearance and edge global representations, and detect discriminative and general forgery traces. Moreover, we devise an Appearance-Edge Cross-Attention (AECA) module to explore the various integrations across two domains. Extensive experiment results and visualizations show that our detection model outperforms the state of the arts on different settings like cross-generator, cross-forgery, and cross-dataset evaluations. Code and datasets will be available at https://***/Jenine-321/GenFace. Copyright © 2024, The Authors. All rights reserved.

关键词： Image enhancement