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

作者： Jing Chen Jincheng Huang College of Information Science and Engineering Yanshan University Key Laboratory for Computer Virtual Technology and system Integration of Hebei Province Software Engineering Laboratory in Hebei Province

In order to maximize the influence of commodity profits in e-commerce platforms, designing and improving the K-shell algorithm to select the more influential seed node sets in this paper. The new algorithm improves the number of active nodes by setting node threshold and edge weight attributes. To obtain more commodity profits, a strategy IRDSN(Strategy for Improving Repeat Degree of Seed Nodes) is proposed to select initial seed nodes and improve the repeat degree of seed nodes. The profit maximization based on linear threshold model is realized by setting different propagation modes. The improved algorithm and strategy IRDSN are analysed and verified in real data set and e-commerce platform. The results show that the algorithm effectively improves the profit of commodities.

关键词： Influence threshold K-shell influence maximization profit

来源：评论

学校读者我要写书评

暂无评论

The research of g-mixing and g-equicontinuity on the hyperspace of topological group action 12

The research of g-mixing and g-equicontinuity on the hypersp...

引用

12th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2020

作者： Zhan-Jiang, Ji Wei, Shi School of Information and Electronic Engineering Wuzhou University China Guangxi Colleges and Universities Key Lab. of Image Processing and Intelligent Information System Wuzhou University China Guangxi Colleges and Universities Key Laboratory of Professional Software Technology Wuzhou University China Party Committee Office Wuzhou Vocational College China

ISBN: (纸本)9781728170817

G-mixing and G-equicontinuity have an important significance in terms of theory and application. According to the definition of mixing and equicontinuity, we give the concept of G-mixing and G-equicontinuity in this paper. By inference, some conclusions of the hyperspace were extended to the hyperspace of topological group action. We have the following result: (1)Letbe the hyperspace ofandbe a pseudo equivariant map. All non-empty open set are invariable for. Ifis a G-mixing map, thenis a G-mixing map;(2)Letbe the hyperspace of andbe a equivariant map. Thenis a G-mild mixing map if and only ifis a G-mild mixing map;(3)Letbe the hyperspace ofandbe a equivariant map. Thenis a G-equicontinuity map if and only ifis a G-equicontinuity map. These results enriched the theory of the G-mixing and G-equicontinuity on the hyperspace of topological group action. © 2020 IEEE.

关键词： Mixing

来源：评论

学校读者我要写书评

暂无评论

The research of G-chain transitive and G-chain mixing on the hyperspace of topological group action 12

The research of G-chain transitive and G-chain mixing on the...

引用

12th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2020

ISBN: (纸本)9781728170817

G-chain transitive and G-chain mixing have an important significance in terms of theory and application. According to the definition of chain transitive and chain mixing, we give the concept of G-chain transitiveand G-chain mixing in this paper. By inference, some conclusions of the hyperspace were extended to the hyperspace of topological group action. We have the following result: (1)Letbe the hyperspace of. Ifis a G-chain transitive map, thenis a G-chain transitive map;(2)Letbe the hyperspace of. Ifis a G-chain mixing map, thenis a G-chain mixing map;(3)Letbe the hyperspace ofandbe a equivariant map. All non-empty open set are invariable for. Thenis a G-exact map if and only ifis a G-exact map. These results enriched the theory of the G-chain transitive and G-chain mixing on the hyperspace of topological group action. © 2020 IEEE.

关键词： Group theory

来源：评论

学校读者我要写书评

暂无评论

The research of the expansion property and chain mixing property of topological group 12

The research of the expansion property and chain mixing prop...

引用

12th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2020

ISBN: (纸本)9781728170817

The expansion property and chain mixing property have an important significance in terms of theory and application. The concept of the expansion property and chain mixing property are introduced in this paper. We study their dynamical properties. The following result are obtained: (1)Letbe the hyperspace of. Ifis expansive, thenis expansive;(2)Letbe the hyperspace of. Ifis chain mixing, thenis chain mixing;(3)Letbe the hyperspace of. Ifis chain transitive, thenis chain transitive;These results enriched the theory of the expansion property and chain mixing property of topological group. © 2020 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Non-aligned double JPEG compression detection based on refined Markov features in QDCT domain

Non-aligned double JPEG compression detection based on refin...

引用

作者： Wang, Jinwei Huang, Wei Luo, Xiangyang Shi, Yun-Qing Jha, Sunil Kr. School of Computer and Software Nanjing University of Information Science and Technology NanjingJiangsu China Nanjing University of Information Science and Technology Nanjing China Shanxi Key Laboratory of Network and System Security Xidian University Shanxi China State Key Laboratory of Mathematical Engineering and Advanced Computing ZhengzhouHenan China New Jersey Institute of Technology NewarkNJ United States

Due to the widespread use of the JPEG format, non-aligned double JPEG (NA-DJPEG) compression is very common in image tampering. Therefore, non-aligned double JPEG compression detection has attracted significant attention in digital forensics in recent years. In most of the previous detection algorithms, grayscale images are used directly, or color images are first converted into grayscale images and then processed. However, it is worth noting that most tampered images are color images. To make full use of the color information in images, a detection algorithm, which uses color images directly, is put forward in this paper. The algorithm based on refined Markov in quaternion discrete cosine transform (QDCT) domain is proposed for NA-DJPEG compression detection. Firstly, color information of a given JPEG image is extracted from blocked images to construct quaternion, and then block image QDCT coefficient matrices, including amplitude and three angles (ψ, , and θ) can be obtained. Secondly, the refined Markov features are generated from the transition probability matrix in the corresponding refinement process. Our proposed refinement method not only reduces redundant features but also makes the acquired features more efficient in detection. Therefore, the refined Markov features can not only capture the intra-block correlation between block QDCT coefficients but also improve computing efficiency in real-time. Finally, support vector machine (SVM) method is employed for NA-DJPEG compression detection. The experiment results demonstrate that the proposed algorithm not only make use of color information of images, but also can achieve better detection performance with small size images (i.e., 64 × 64) outperforming state-of-the-art detection methods tested on the same dataset. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Discrete cosine transforms

来源：评论

学校读者我要写书评

暂无评论

MetAug: Contrastive Learning via Meta Feature Augmentation

arXiv

引用

arXiv 2022年

作者： Li, Jiangmeng Qiang, Wenwen Zheng, Changwen Su, Bing Xiong, Hui Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Guangdong China Gaoling School of Artificial Intelligence Renmin University of China Beijing China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Guangzhou China Department of Computer Science Engineering The Hong Kong University of Science and Technology Hong Kong

What matters for contrastive learning? We argue that contrastive learning heavily relies on informative features, or "hard" (positive or negative) features. Early works include more informative features by applying complex data augmentations and large batch size or memory bank, and recent works design elaborate sampling approaches to explore informative features. The key challenge toward exploring such features is that the source multi-view data is generated by applying random data augmentations, making it infeasible to always add useful information in the augmented data. Consequently, the informativeness of features learned from such augmented data is limited. In response, we propose to directly augment the features in latent space, thereby learning discriminative representations without a large amount of input data. We perform a meta learning technique to build the augmentation generator that updates its network parameters by considering the performance of the encoder. However, insufficient input data may lead the encoder to learn collapsed features and therefore malfunction the augmentation generator. A new margin-injected regularization is further added in the objective function to avoid the encoder learning a degenerate mapping. To contrast all features in one gradient back-propagation step, we adopt the proposed optimization-driven unified contrastive loss instead of the conventional contrastive loss. Empirically, our method achieves state-of-the-art results on several benchmark datasets. Copyright © 2022, The Authors. All rights reserved.

关键词： Backpropagation

来源：评论

学校读者我要写书评

暂无评论

Integration of a novel attribute and classical topology metrics of hyper-networks for automatic diagnosis of Major depressive disorder 22

Integration of a novel attribute and classical topology metr...

引用

22nd IEEE International Conference on E-Health Networking, Application and Services, HEALTHCOM 2020

作者： Li, Yongchao Chen, Nan Wang, Yin Yang, Lin Zheng, Weihao Yao, Zhijun Hu, Bin Gansu Province Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University Lanzhou China College of Biomedical Engineering and Instrument Science Zhejiang University Zhejiang China CAS Center for Excellence in Brain Science and Intelligence Technology Shanghai Institutes for Biological Sciences Chinese Academy of Sciences Shanghai China Joint Research Center for Cognitive Neurosensor Technology of Lanzhou University Institute of Semiconductors Chinese Academy of Sciences Lanzhou China Engineering Research Center of Open Source Software and Real-Time System Lanzhou University Ministry of Education Lanzhou China

ISBN: (纸本)9781728162676

Conventional hyper-network coefficients ignore the weighted hyper-edge information which could be vital in researching the specificity of brain disease. Functional hyper-networks for 64 healthy controls (HC) and 56 patients with major depressive disorder (MDD) were constructed using the least absolute shrinkage and selection operator (Lasso). Not only the classical topology metrics but also a novel hyper-edge weight (HEW) attribute were extracted as features to promote the functional-based auto-diagnosis accuracy of MDD. We compared the categorization performance of each hyper-network coefficient. A multi-feature ensemble model was applied to fuse different kinds of features. We obtained 82.15 % accuracy with the classical hyper-network clustering coefficient (HCC) and 84.08 % accuracy with the HEW attribute on the MDD dataset. The performance was further improved to 89.24% by combining all the properties of the hyper-networks. The multi-feature ensemble model combining different hyper-network coefficients provides new insights into the automatic diagnosis with diverse information of MDD. © 2021 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Interventional Contrastive Learning with Meta Semantic Regularizer

arXiv

引用

arXiv 2022年

作者： Qiang, Wenwen Li, Jiangmeng Zheng, Changwen Su, Bing Xiong, Hui Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Guangdong China Gaoling School of Artificial Intelligence Renmin University of China Beijing China Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Guangzhou China Department of Computer Science & Engineering The Hong Kong University of Science and Technology Hong Kong

Contrastive learning (CL)-based self-supervised learning models learn visual representations in a pairwise manner. Although the prevailing CL model has achieved great progress, in this paper, we uncover an ever-overlooked phenomenon: When the CL model is trained with full images, the performance tested in full images is better than that in foreground areas;when the CL model is trained with foreground areas, the performance tested in full images is worse than that in foreground areas. This observation reveals that backgrounds in images may interfere with the model learning semantic information and their influence has not been fully eliminated. To tackle this issue, we build a Structural Causal Model (SCM) to model the background as a confounder. We propose a backdoor adjustment-based regularization method, namely Interventional Contrastive Learning with Meta Semantic Regularizer (ICL-MSR), to perform causal intervention towards the proposed SCM. ICL-MSR can be incorporated into any existing CL methods to alleviate background distractions from representation learning. Theoretically, we prove that ICL-MSR achieves a tighter error bound. Empirically, our experiments on multiple benchmark datasets demonstrate that ICL-MSR is able to improve the performances of different state-of-the-art CL methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Semantic Learning and Emulation Based Cross-platform Binary Vulnerability Seeker

arXiv

引用

arXiv 2022年

作者： Gao, Jian Jiang, Yu Liu, Zhe Yang, Xin Wang, Cong Jiao, Xun Yang, Zijiang Sun, Jiaguang The School of Software Tsinghua University Beijing National Research Center for Information Science and Technology Key Laboratory for Information System Security Ministry of Education Beijing100084 China The College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China The Department of Electrical and Computer Engineering Villanova University VillanovaPA19085 United States The Department of Computer Science Western Michigan University KalamazooMI49008 United States

Clone detection is widely exploited for software vulnerability search. The approaches based on source code analysis cannot be applied to binary clone detection because the same source code can produce significantly different binaries due to different operating systems, microprocessor architectures and compilers. In this paper, we present BinSeeker, a cross-platform binary seeker that integrates semantic learning and emulation. With the help of the labeled semantic flow graph, BinSeeker can quickly identify M candidate functions that are most similar to the vulnerability from the target binary. The value of M is relatively large so this semantic learning procedure essentially eliminates those functions that are very unlikely to have the vulnerability. Then, semantic emulation is conducted on these M candidates to obtain their dynamic signature sequences. By comparing signature sequences, BinSeeker produces top-N functions that exhibit most similar behavior to that of the vulnerability. With fast filtering of semantic learning and accurate comparison of semantic emulation, BinSeeker seeks vulnerability precisely with little overhead. The experiments on six widely used programs with fifteen known CVE vulnerabilities demonstrate that BinSeeker outperforms three state-of-the-art tools Genius, Gemini and CACompare. Regarding search accuracy, BinSeeker achieves an MRR value of 0.65 in the target programs, whereas the MRR values by Genius, Gemini and CACompare are 0.17, 0.07 and 0.42, respectively. If we consider ranking a function with the targeted vulnerability in the top-5 as accurate, BinSeeker achieves the accuracy of 93.33 percent, while the accuracy of the other three tools is merely 33.33, 13.33 and 53.33 percent, respectively. Such accuracy is achieved with 0.27s on average to determine whether the target binary function contains a known vulnerability, and the time for the other three tools are 1.57s, 0.15s and 0.98s, respectively. Compared to the time used to manu

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Integration of a novel attribute and classical topology metrics of hyper-networks for automatic diagnosis of Major depressive disorder

Integration of a novel attribute and classical topology metr...

引用

International Conference on e-health Networking, Applications and Services (HealthCom)

作者： Yongchao Li Nan Chen Yin Wang Lin Yang Weihao Zheng Zhijun Yao Bin Hu Gansu Province Key Laboratory of Wearable Computing School of information science and Engineering Lanzhou University Lanzhou China College of Biomedical Engineering and Instrument Science Zhejiang University Zhejiang China Engineering Research Center of Open Source Software and Real-Time System(Lanzhou University) Ministry of Education Lanzhou China

ISBN: (数字)9781728162676

ISBN: (纸本)9781728162683

关键词： Measurement Fuses Diversity reception Feature extraction Depression Topology Diseases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：