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

13th International Conference on Microwave and Millimeter Wave technology, ICMMT 2021

作者： Xu, Zhi-Yong Zhang, Xiao Hong, Kai-Dong Zhu, Lei Yuan, Tao Shenzhen University Guangdong Prov. Mobile Terminal Microwave And Millimeter-Wave Antenna Engineering Research Center College Of Electronics And Information Engineering Shenzhen518060 China Guangdong-Hong Kong Joint Laboratory For Big Data Imaging And Communication Shenzhen Guangdong518048 China ATR National Key Laboratory Of Defense Technology College Of Electronics And Information Engineering Shenzhen University Shenzhen Guangdong518060 China Department Of Electrical And Computer Engineering Faculty Of Science And Technology University Of Macau China Postgraduate Education Branch Of The China Education Society Of Electronics China

ISBN: (纸本)9781665434379

A differentially-fed rectangular patch antenna under TM21 and TM03 modes is proposed to realize bandwidth enhancement and stable high gain. Firstly, two open slots along the median of patch are introduced to reconstruct the current distribution of TM21 mode so that its broadside radiation is strengthened greatly. Secondly, another central slot along with the two sided ones interrupt out-of-phase current of TM03 mode and make it circulate with little radiation, hence substantially reducing the sidelobe level (SLL). With the help of loading three cascaded slots and pins, the frequencies of the two modes are merged together, and so the antenna obtains an enhanced impedance bandwidth of 11.8% (2.24-2.52 GHz). Finally, the simulation results show that the proposed rectangular patch antenna achieves gain level as high as 13.8 dBi, which has little variation in the working bandwidth. © 2021 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Universal deep network for steganalysis of color image based on channel representation

arXiv

引用

arXiv 2021年

作者： Wei, Kangkang Luo, Weiqi Tan, Shunquan Huang, Jiwu The Guangdong Key Lab of Information Security Technology School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Up to now, most existing steganalytic methods are designed for grayscale images, and they are not suitable for color images that are widely used in current social networks. In this paper, we design a universal color image steganalysis network (called UCNet) in spatial and JPEG domains. The proposed method includes preprocessing, convolutional, and classification modules. To preserve the steganographic artifacts in each color channel, in preprocessing module, we firstly separate the input image into three channels according to the corresponding embedding spaces (i.e. RGB for spatial steganography and YCbCr for JPEG steganography), and then extract the image residuals with 62 fixed high-pass filters, finally concatenate all truncated residuals for subsequent analysis rather than adding them together with normal convolution like existing CNN-based steganalyzers. To accelerate the network convergence and effectively reduce the number of parameters, in convolutional module, we carefully design three types of layers with different shortcut connections and group convolution structures to further learn high-level steganalytic features. In classification module, we employ a global average pooling and fully connected layer for classification. We conduct extensive experiments on ALASKA II to demonstrate that the proposed method can achieve state-of-the-art results compared with the modern CNN-based steganalyzers (e.g., SRNet and J-YeNet) in both spatial and JPEG domains, while keeping relatively few memory requirements and training time. Furthermore, we also provide necessary descriptions and many ablation experiments to verify the rationality of the network design. Copyright © 2021, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Detail retention and enhancement for camouflaged object detection

引用

Neurocomputing 2025年 648卷

作者： Shangjing Chen Feng Xu Tao Zeng Xin Li Jiale Chen Xin Lyu College of Computer Science and Software Engineering Hohai University Nanjing 211100 China School of Computer Engineering Jiangsu Ocean University Lianyungang 222005 China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing 211100 China

The objective of camouflaged object detection is to segment objects that share similar visual attributes with their backgrounds. Existing methods leverage the consistency and variability of the object to pinpoint its location; however, when presented with samples exhibiting intricate edges, the model tends to overlook critical details. Toward this issue, we analyzed the reasons from the perspective of processing basic features and found that roughly compressing the feature channel could lead to the loss of fine features at the initial stage of the pipeline. Therefore, we introduce a multi-scale feature preprocessing approach named Soft Channel Compression prior to feature fusion, which retains key cues by enhancing the visibility of fine-grained features. We then utilize self-attention to fuse the results of multi-scale feature sampling, synthesizing contextual information between extended details and the main object. Furthermore, we propose the Hierarchical Receptive Field Complementarity module, using a divide-and-conquer strategy to enhance discriminative features with different scales in object details. This facilitates the integration of information across various ranges by employing a hierarchical manner to expand the receptive field, thereby achieving complementary information between local areas. Extensive experimental results on benchmark datasets demonstrate that the proposed method outperforms other state-of-the-art methods.

关键词： Camouflaged object detection Edge detail Hierarchical manner Multi-scale feature Regional information complementarity

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of a Pairing-Based Anonymous key Agreement Scheme for Smart Grid 15th

Cryptanalysis of a Pairing-Based Anonymous Key Agreement Sch...

引用

15th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2019, held in conjunction with the 12th International Conference on Frontiers of Information technology, Applications and Tools, FITAT 2019

作者： Liang, Xiao-Cong Wu, Tsu-Yang Lee, Yu-Qi Chen, Chien-Ming Yeh, Jyh-Haw Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China National Demonstration Center for Experimental Electronic Information and Electrical Technology Education Fujian University of Technology Fuzhou350118 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Department of Computer Science Boise State University Idaho United States

ISBN: (纸本)9789811397134

Authentication and key agreement schemes in smart grid have received much attentions by researchers in recent years. Recently, Mahmood et al. proposed a secure pairing-based anonymous key exchange scheme in smart grid. However, we demonstrate that their scheme is insecure against an ephemeral secret leakage attack and an impersonation attack according to the Canetti-Krawczyk adversarial model in this paper. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Motif Graph Neural Network

arXiv

引用

arXiv 2021年

作者： Chen, Xuexin Cai, Ruichu Fang, Yuan Wu, Min Li, Zijian Hao, Zhifeng The School of Computer Science Guangdong University of Technology Guangzhou510006 China The School of Computer Science Guangdong University of Technology Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application Guangzhou China Peng Cheng Laboratory Shenzhen518066 China The School of Computing and Information Systems Singapore Management University 178902 Singapore A*STAR 138632 Singapore The College of Science Shantou University Shantou515063 China

Graphs can model complicated interactions between entities, which naturally emerge in many important applications. These applications can often be cast into standard graph learning tasks, in which a crucial step is to learn low-dimensional graph representations. Graph neural networks (GNNs) are currently the most popular model in graph embedding approaches. However, standard GNNs in the neighborhood aggregation paradigm suffer from limited discriminative power in distinguishing high-order graph structures as opposed to low-order structures. To capture high-order structures, researchers have resorted to motifs and developed motif-based GNNs. However, existing motif-based GNNs still often suffer from less discriminative power on high-order structures. To overcome the above limitations, we propose Motif Graph Neural Network (MGNN), a novel framework to better capture high-order structures, hinging on our proposed motif redundancy minimization operator and injective motif combination. First, MGNN produces a set of node representations w.r.t. each motif. The next phase is our proposed redundancy minimization among motifs which compares the motifs with each other and distills the features unique to each motif. Finally, MGNN performs the updating of node representations by combining multiple representations from different motifs. In particular, to enhance the discriminative power, MGNN utilizes an injective function to combine the representations w.r.t. different motifs. We further show that our proposed architecture increases the expressive power of GNNs with a theoretical analysis. We demonstrate that MGNN outperforms state-of-the-art methods on seven public benchmarks on both node classification and graph classification tasks. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Plagiarism detection of multi-threaded programs using frequent behavioral pattern mining 32

Plagiarism detection of multi-threaded programs using freque...

引用

32nd International Conference on Software Engineering and Knowledge Engineering, SEKE 2020

作者： Wang, Qing Tian, Zhenzhou Gao, Cong Chen, Lingwei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an China College of Information Sciences and Technology Pennsylvania State University PA United States

ISBN: (纸本)1891706500

Software dynamic birthmark techniques construct birthmarks using the captured execution traces from running the programs, which serve as one of the most promising methods for obfuscation-resilient software plagiarism detection. However, due to the perturbation caused by non-deterministic thread scheduling in multi-threaded programs, such dynamic approaches optimized for sequential programs may suffer from the randomness in multi-threaded program plagiarism detection. In this paper, we propose a new dynamic thread-aware birthmark FPBirth to facilitate multi-threaded program plagiarism detection. We first explore dynamic monitoring to capture multiple execution traces with respect to system calls for each multi-threaded program under a specified input, and then leverage Apriori algorithm to mine frequent patterns to formulate our dynamic birthmark, which can not only depict the program's behavioral semantics, but also resist the changes and perturbations over execution traces caused by the thread scheduling in multithreaded programs. Using FPBirth, we design a multi-threaded program plagiarism detection system. The experimental results based on a public software plagiarism sample set demonstrate that the developed system integrating our proposed birthmark FPBirth cope better with multi-threaded plagiarism detection than alternative approaches. © 2020 Knowledge Systems Institute Graduate School. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Secure and Privacy-preserving data-sharing Framework based on Blockchain technology for Al-Najaf/Iraq Oil Refinery

Secure and Privacy-preserving Data-sharing Framework based o...

引用

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

作者： Samir M. Umran SongFeng Lu Zaid Ameen Abduljabbar Zhi Lu Bingyan Feng Lu Zheng Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Ministry of Industry and Minerals Iraqi Cement State Company Baghdad Iraq Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen China College of Education for Pure Sciences University of Basrah Technical Computer Engineering Department Al-Kunooze University College Basrah Iraq School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Wuhan Huazhong Numerical Control Co. Ltd Industrial Internet Research Institute Wuhan China College of Computer Science South-Central University for Nationalities Wuhan China

The Industrial Internet of Things or Industry 4.0 efficiently enhances the manufacturing process in terms of raising productivity, system performance, cost reduction, and building large-scale systems. It enables the connection of numerous heterogeneous devices and sensors into the internet network through the utilization of revolutionary techniques that transfer the manufacturing paradigm to intelligent processes. The traditional industrial internet of things adopts centralized architectures and complex encryption algorithms that suffer from several cyber-security threats and lead to data leakage, privacy disclosure, and high computational and communicational costs. In our work, we proposed a decentralized, efficient, low-power, scalable, secure, privacy-preserving, and trusting architecture based on a private blockchain network/smart contract and interplanetary file system technology for the Al-NajafyIraq oil refinery factory. That enables autonomous working and provides a high level of security authentication and privacy preservation, P2P communication, remote access, immutability and information backtracking. Traditional blockchain technology has storage limitation issues, most recent works adopted external servers or the cloud for storage purposes. Our proposed scheme addresses the limitations of blockchain data storage by adopting an interplanetary file system (IPFS) network; provides an efficient data encryption mechanism at the perceptual layer by adopting a lightweight encryption algorithm, high-performance, and ultra-low-power consumption ARM Cortex-M microcontroller. In addition, our architecture succeeds in merging blockchain technology, IoTs, and an IPFS with the oil refinery as an industrial application area. Moreover, it provides an efficient framework that resists common cyber-security attacks and realizes cyber-security requirements represented by data availability, integrity, and confidentiality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Random Forest-Based Ensemble Estimator for Concrete Compressive Strength Prediction via AdaBoost Method 15th

Random Forest-Based Ensemble Estimator for Concrete Compress...

引用

15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2019, co-located with the 5th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2019

作者： Lv, Yuanxin Shi, Xiaoyu Ran, Longyu Shang, Mingsheng College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9783030325909

As one of the most important building materials, the quality of concrete directly affects the safety of buildings. Hence, it is an important and hot issue to predict the compressive strength of concrete with highly accuracy. Most of existing methods heavily depend on building a single model to predict the compressive strength of concrete. However, the proposed single models are not one-size-fits-all, different model have different limitations, making them a better or worse fit for different situation. To address this issue, this paper proposes a novel predict model for concrete compressive strength based on ensemble learning method. In detail, we build our ensemble framework via using the AdaBoost method, while the random forests methods as weak classifier are integrated to the AdaBoost framework. For dealing with the noisy and missing value problems, a set of statistical methods are employed. Furthermore, we utilize the Pearson correlation coefficient to analysis the relationship between different input materials, which can effectively drop out the irrelevant and redundant features. Experimental results on two industrial data sets show that proposed ensemble estimator can significantly improve the prediction accuracy in comparing with other five state-of-the-art methods. © 2020, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Deep Sentiment Learning Network for Temporal-aware Recommendation Based on User Reviews

Deep Sentiment Learning Network for Temporal-aware Recommend...

引用

IEEE International Conference on big data Analysis (ICBDA)

作者： Xinxin Li Tianqi Shang Dezhong Peng Xiaoyu Shi School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China College of Computer Science Sichuan University Chengdu China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

Recently, many websites encourage users to fill in reviews on items and services to improve the quality of personalized recommendation, because of the rich sentiment information hidden in user reviews. However, most existing recommendation methods based on reviews heavily emphasize extracting the rich sentiment information from reviews by using deep learning technologies as far as possible and always ignore the effects of temporal dynamical of user preferences. To address the above issues, we propose DSL- TR, a deep sentiment learning framework for the temporal-aware recommendation, using an intricate combination of bidirectional long short-term memory (BLSTM) and Convolution Neural Network (CNN). It consists of four layers: embedding layer, BLSTM layer, CNN layer and feature fusion layer. In the embedding layer, we explicitly combine the time information in the review embedding layer by regarding the review time as an independent factor. Then, we utilize the BLSTM and CNN networks to extract the long and short-terms of latent features of user and item in parallel. Finally, the factorization machine technique, as a rating predictor, is introduced on the last layer to estimate the rating based on the learned user and item latent features. We conduct extensive experiments on Amazon's four data sets. The results demonstrate that our proposed method outperforms several state-of-art methods consistently.

关键词： Deep learning Convolution Conferences Neural networks big data Feature extraction data mining

来源：评论

学校读者我要写书评

暂无评论

Adjusting the inheritance of topic for dynamic document clustering 37th

Adjusting the inheritance of topic for dynamic document clus...

引用

37th National Conference of Theoretical computer science, NCTCS 2019

作者： Huang, Ruizhang Zhu, Yingxue Chen, Yanping Yang, Yue Xu, Weijia Yang, Jian Meng, Yaru College of Computer Science and Technology Guizhou University GuiyangGuizhou China Guizhou Provincial Key Laboratory of Public Big Data Guizhou University GuiyangGuizhou China

ISBN: (纸本)9789811501043

Organizing streaming documents from time-varying dataset is meaningful but difficult because topics evolve over time. Dynamic document clustering is a vital research problem, which helps to group the time-varying documents into a number of clusters corresponding to their underlying topics. datasets are partitioned into a set of time slides to transfer the streaming document clustering from a continuous problem to a categorical one. Traditional dynamic document clustering approach tends to inherit topic information over time directly with no consideration of the nature of datasets. In this paper, we design a novel prior-adjusted dynamic document clustering approach, namely PADC, which is able to adjust the topic inheritance process according to two important of datasets characteristics, in particular, the interval between dataset time slides and the size of dataset time slides. A collapsed Gibbs sampling algorithm is investigated to infer the document structure for all time slides with underlying time-varying topics. Parameters for underlying topics inheritance, as well as parameters of the number of clusters in each time slide, are estimated simultaneously. Extensive experiments have been conducted comparing the PADC model with state-of-the-art dynamic document clustering approaches. Experimental results demonstrate that the PADC model is robust and effective for the dynamic document clustering problem. © Springer Nature Singapore Pte Ltd 2019.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：