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

10th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2019

作者： Yan, Bai Zhao, Qi Zhang, J. Andrew Li, Yonghui Wang, Zhihai Institute of Laser Engineering Beijing University of Technology Beijing China College of Economics and Management Beijing University of Technology Beijing China Global Big Data Technologies Centre University of Technology Sydney Sydney Australia School of Electrical and Information Engineering University of Sydney Sydney Australia Key Laboratory of Optoelectronics Technology Ministry of Education Beijing University of Technology Beijing China

ISBN: (纸本)9783030125974

Multiobjective sparse reconstruction (MOSR) methods can potentially obtain superior reconstruction performance. However, they suffer from high computational cost, especially in high-dimensional reconstruction. Furthermore, they are generally implemented independently without reusing prior knowledge from past experiences, leading to unnecessary computational consumption due to the re-exploration of similar search spaces. To address these problems, we propose a sparse-constraint knowledge transfer operator to accelerate the convergence of MOSR solvers by reusing the knowledge from past problem-solving experiences. Firstly, we introduce the deep nonlinear feature coding method to extract the feature mapping between the search of the current problem and a previously solved MOSR problem. Through this mapping, we learn a set of knowledge-induced solutions which contain the search experience of the past problem. Thereafter, we develop and apply a sparse-constraint strategy to refine these learned solutions to guarantee their sparse characteristics. Finally, we inject the refined solutions into the iteration of the current problem to facilitate the convergence. To validate the efficiency of the proposed operator, comprehensive studies on extensive simulated signal reconstruction are conducted. © Springer Nature Switzerland AG 2019.

关键词： Signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

Heuristics Propositional Extension Rule Method

Heuristics Propositional Extension Rule Method

引用

International Conference on Innovative Computing, Information and Control (ICICIC)

作者： Xia Wu Haihong Yu Ying Li College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

Theorem proving based on the extension rule is a new reasoning method. Based on the extension rule algorithm RIER, this paper presents a more efficient algorithm HRIER, which uses the heuristic strategy to guide the choosing of restricted searching space. The experiment results show HRIER improves the efficiency a lot, meanwhile it keeps the essence characteristic of extension rule method, namely it is still potentially a complementary method to resolution based methods.

关键词： Erbium Computer science Mathematics Educational institutions Educational technology Laboratories knowledge engineering Computer science education Control engineering education Frequency

来源：评论

学校读者我要写书评

暂无评论

Enhancing GPSR's credibility using experienced trustiness for VANET

引用

Journal of Computational Information Systems 2010年第8期6卷 2537-2544页

作者： Liu, Yanheng He, Junting Wang, Jian College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Vehicular ad hoc network (VANET) is a kind of self-organizing ad hoc network, which is specifically designed for communication among vehicles. In VANET, a source vehicle must rely on intermediate vehicles to forward its packets along multi-hops to the destination vehicle. Due to the lack of center infrastructure in such networks, secure and reliable packet delivery is challenging. In this paper, we design a robust cooperative trusted routing protocol for VANET, particularly in the presence of malicious nodes. We establish the trust relationships among nodes by introducing the concept of experienced trustiness, based on which we design a new forwarding rule to encourage cooperative behaviors. Also we provide some recommendatory methods to calculate the experienced trustiness value. The simulations show that our scheme behaves better than the original GPSR and the Trust-Aware GPSR against malicious nodes. Finally, the extensive numerical results about the impacts of different scenarios (highway, suburb, and urban) on performance are given. Copyright © 2010 Binary Information Press.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

ROD: Reception-aware online distillation for sparse graphs

arXiv

引用

arXiv 2021年

作者： Zhang, Wentao Jiang, Yuezihan Li, Yang Sheng, Zeang Shen, Yu Miao, Xupeng Wang, Liang Yang, Zhi Cui, Bin School of EECS Key Laboratory of High Confidence Software Technologies Peking University Center for Data Science Peking University National Engineering Laboratory for Big Data Analysis and Applications Alibaba Group

Graph neural networks (GNNs) have been widely used in many graph-based tasks such as node classification, link prediction, and node clustering. However, GNNs gain their performance benefits mainly from performing the feature propagation and smoothing across the edges of the graph, thus requiring sufficient connectivity and label information for effective propagation. Unfortunately, many real-world networks are sparse in terms of both edges and labels, leading to sub-optimal performance of GNNs. Recent interest in this sparse problem has focused on the self-training approach, which expands supervised signals with pseudo labels. Nevertheless, the self-training approach inherently cannot realize the full potential of refining the learning performance on sparse graphs due to the unsatisfactory quality and quantity of pseudo labels. In this paper, we propose ROD, a novel reception-aware online knowledge distillation approach for sparse graph learning. We design three supervision signals for ROD: multi-scale reception-aware graph knowledge, task-based supervision, and rich distilled knowledge, allowing online knowledge transfer in a peer-teaching manner. To extract knowledge concealed in the multi-scale reception fields, ROD explicitly requires individual student models to preserve different levels of locality information. For a given task, each student would predict based on its reception-scale knowledge, while simultaneously a strong teacher is established on-the-fly by combining multi-scale knowledge. Our approach has been extensively evaluated on 9 datasets and a variety of graph-based tasks, including node classification, link prediction, and node clustering. The result demonstrates that ROD achieves state-of-art performance and is more robust for the graph sparsity. Copyright © 2021, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised prototype topic model with discriminative seed words: Modifying the category prior by self-exploring supervised signals

arXiv

引用

arXiv 2021年

作者： Wang, Bing Wang, Yue Li, Ximing Ouyang, Jihong College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University China

dataless text classification, i.e., a new paradigm of weakly supervised learning, refers to the task of learning with unlabeled documents and a few predefined representative words of categories, known as seed words. The recent generative dataless methods construct document-specific category priors by using seed word occurrences only, however, such category priors often contain very limited and even noisy supervised signals. To remedy this problem, in this paper we propose a novel formulation of category prior. First, for each document, we consider its label membership degree by not only counting seed word occurrences, but also using a novel prototype scheme, which captures pseudo-nearest neighboring categories. Second, for each label, we consider its frequency prior knowledge of the corpus, which is also a discriminative knowledge for classification. By incorporating the proposed category prior into the previous generative dataless method, we suggest a novel generative dataless method, namely Weakly Supervised Prototype Topic Model (Wsptm). The experimental results on real-world datasets demonstrate that Wsptm outperforms the existing baseline methods. © 2021, CC0.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

eSROP Attack: Leveraging Signal Handler to Implement Turing-Complete Attack Under CFI Defense 1

引用

18th EAI International Conference on Security and Privacy in Communication Networks, SecureComm 2022

作者： Zhang, Tianning Cai, Miao Zhang, Diming Huang, Hao Department of Computer Science and Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing China School of Computer and Information Hohai University Nanjing China College of Computer Engineering Jiangsu University of Science and Technology Nanjing China

ISBN: (数字)9783031255380

ISBN: (纸本)9783031255373

Signal Return Oriented Programming (SROP) is a dangerous code reuse attack method. Recently, defense techniques have been proposed to defeat SROP attacks. In this paper, we leverage the signal nesting mechanism provided by current operating systems and propose a new variant of SROP attack called enhanced SROP (eSROP) attack. eSROP provides the ability of invoking arbitrary system calls, simulating Turing-complete computation, and even bypassing the fine-grained label-based CFI defense, without modifying the return address and instruction register in the signal frame. Because the signal returns to the interrupted instruction, the shadow stack defense can hardly detect our attack. Signal has strong flexibility which can interrupt the normal control flow. We leverage such flexibility to design a new code reuse attack. To evaluate eSROP, we perform two exploits on two real-world programs, namely Proftpd and Wu-ftpd. In our attacks, adversaries can invoke arbitrary system calls and obtain a root shell. Both attacks succeed within 10 min under strict system defense such as data execution prevention, address space layout randomization, and coarse-grained control flow integrity. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Terahertz metamaterial narrowband absorber based on metal split ring

Terahertz metamaterial narrowband absorber based on metal sp...

引用

2023 Applied Optics and Photonics China: Optical Sensing, Imaging, and Display Technology and Applications;and Biomedical Optics, AOPC 2023

作者： Ji, Xiaodi Ge, Hongyi Jiang, Yuying Wu, Xuyang Jia, Zhiyuan Sun, Zhenyu Key Laboratory of Grain Information Processing and Control Henan University of Technology Ministry of Education Henan China Henan Provincial Key Laboratory of Grain Photoelectric Detection and Control Henan China College of Information Science and Engineering Henan University of Technology Henan Zhengzhou450001 China School of Artificial Intelligence and Big Data Henan University of Technology Henan Zhengzhou450001 China

ISBN: (纸本)9781510672321

Multi-band terahertz metamaterial absorbers offer new perspectives to achieve perfect absorption and multipoint information matching, which enable an ever-growing number of applications. In this study, a dual-band terahertz metamaterial absorber based on the metal split ring is designed. The absorber has perfect absorption peaks at 1.15 THz and 2.47 THz, and the absorption rate is more than 99%. The absorber produces a harp peak with a bandwidth of 0.008 at 2.47 THz, which has an extremely high quality factor of 308. The distribution of the electric field and surface current at two resonance points is analyzed using the finite element integration method. Through full wave simulation calculation, the maximum sensitivity of the analyte refractive index of the absorber is 400 GHz/RIU, and the maximum sensitivity of the thickness is 35 GHz/μm. The results show that the absorber can achieve highly sensitive detection of trace substances. © 2023 SPIE. All rights reserved.

关键词： Metamaterials

来源：评论

学校读者我要写书评

暂无评论

A direction-based search algorithm in P2P network

引用

Journal of Computational Information Systems 2010年第1期6卷 25-31页

作者： Liu, Xiaonan Fang, Zhiyi Tang, Huanhuan College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

We researched one search algorithm based on direction in the unstructured P2P network, analyzed the limited insufficiencies of this algorithm to the search speed, we proposed the improved direction search algorithm based on LAN agent-ABDS algorithm. We expounded the basic thought and the design principle of ABDS algorithm, carried on the theoretical analysis to the aspects of accuracy and parameter value. We took simulation experiments to the improved algorithms, carried on the quantification analysis to the improved algorithms through the experimental datum, drew up charts with the experimental datum, presented the network search process through the images, all which made the complex problems be more clearer and direct-viewing. Simulation experiments verify the improved algorithms improve the search speed of the P2P network, shorten the search response time. Copyright © 2010 Binary Information Press.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Panicle-Cloud:An Open and Al-Powered Cloud Computing Platform for Quantifying Rice Panicles from Drone-Collected Imagery to Enable the Classification of Yield Production in Rice

引用

Plant Phenomics 2023年第4期5卷 905-916页

作者： Zixuan Teng Jiawei Chen Jian Wang Shuixiu Wu Riqing Chen Yaohai Lin Liyan Shen Robert Jackson Ji Zhou Changcai Yang Digital Fujian Research Institute of Big Data for Agriculture and Forestry College of Computer and Information SciencesFujian Agriculture and Forestry UniversityFuzhou 350002China State Key Laboratory of Crop Genetics&Germplasm Enhancement academy for Advanced Interdisciplinary StudiesNanjing Agricultural UniversityNanjing 210095China Ningxia Academy of Agriculture and Forestry Sciences Yinchuan 750002China College of Mechanical and Electrical Engineering Fujian Agriculture and Forestry UniversityFuzhou 350002China Cambridge Crop Research National Institute of Agricultural Botany(NIAB)Cambridge CB3 OLEUK Key Laboratory of Smart Agriculture and Forestry(Fujian Agriculture and Forestry University) Fujian Province UniversityFuzhou 350002China Center for Agroforestry Mega Data Science School of Future TechnologyFujian Agriculture and Forestry UniversityFuzhou 350002China

Rice(Oryza sativa)is an essential stable food for many rice consumption nations in the world and,thus,the importance to improve its yield production under global climate *** evaluate different rice varieties'yield performance,key yield-related traits such as panicle number per unit area(PNpM^(2))are key indicators,which have attracted much attention by many plant research ***,it is still challenging to conduct large-scale screening of rice panicles to quantify the PNpM^(2)trait due to complex field conditions,a large variation of rice cultivars,and their panicle morphological ***,we present Panicle-Cloud,an open and artificial intelligence(AI)-powered cloud computing platform that is capable of quantifying rice panicles from drone-collected *** facilitate the development of Al-powered detection models,we first established an open diverse rice panicle detection dataset that was annotated by a group of rice specialists;then,we integrated several state-of-the-art deep learning models(including a preferred model called Panicle-AI)into the Panicle-Cloud platform,so that nonexpert users could select a pretrained model to detect rice panicles from their own aerial *** trialed the Al models with images collected at different attitudes and growth stages,through which the right timing and preferred image resolutions for phenotyping rice panicles in the field were ***,we applied the platform in a 2-season rice breeding trial to valid its biological relevance and classified yield production using the platform-derived PNpM^(2)trait from hundreds of rice *** correlation analysis between computational analysis and manual scoring,we found that the platform could quantify the PNpM^(2)trait reliably,based on which yield production was classified with high ***,we trust that our work demonstrates a valuable advance in phenotyping the PNpM^(2)trait in rice,which provides a useful toolkit to enable rice br

关键词： breeding cultivar hundreds

来源：评论

学校读者我要写书评

暂无评论

Improved (Pseudo) preimage attacks on reduced-round GOST and Grøstl-256 and studies on several truncation patterns for AES-like compression functions 10th

Improved (Pseudo) preimage attacks on reduced-round GOST and...

引用

10th International Workshop on Security, IWSEC 2015

作者： Ma, Bingke Li, Bao Hao, Ronglin Li, Xiaoqian State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Data Assurance and Communication Security Research Center Chinese Academy of Sciences Beijing100093 China University of Chinese Academy of Sciences Beijing China Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei230027 China

ISBN: (纸本)9783319224244

In this paper, we present improved preimage attacks on the reduced-round GOST hash function family, which serves as the new Russian hash standard, with the aid of techniques such as the rebound attack, the Meet-in-the-Middle preimage attack and the multicollisions. Firstly, the preimage attack on 5-round GOST-256 is proposed which is the first preimage attack for GOST-256 at the hash function level. Then we extend the (previous) attacks on 5-round GOST-256 and 6-round GOST-512 to 6.5 and 7.5 rounds respectively by exploiting the involution property of the GOST transposition operation. Secondly, inspired by the preimage attack on GOST-256, we also study the impacts of four representative truncation patterns on the resistance of the Meet-in-the-Middle preimage attack against AES-like compression functions, and propose two stronger truncation patterns which make it more difficult to launch this type of attack. Based on our investigations, we are able to slightly improve the previous pseudo preimage attacks on reduced-round Grøstl-256. © Springer International Publishing Switzerland 2015.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：