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

2010 International Conference on Computer Application and System Modeling, ICCASM 2010

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

ISBN: (纸本)9781424472369

In order to realize that IPv6 (Internet Protocol version 6) clients are able to visit remote IPv6 servers through GPRS (General Packet Radio Service), we proposed a new and feasible framework. After discussing the limitations of those existing methods which aren't suitable for GPRS network, we then detailedly demonstrated the proposed framework, and also gave the implementations based on NetFilter framework, Libnet as well as Libipq. Simulation results show that the isolated IPv6 areas can be efficiently connected by GPRS network through the presented framework. © 2010 IEEE.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

Cardinal direction relations in 3D space

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： Juan, Chen Dayou, Liu Haiyang, Jia Changhai, Zhang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9783540767183

The existing 3D direction models approximate spatial objects either as a point or as a minimal bounding block, which decrease the descriptive capability and precision. Considering the influence of object's shape, this paper extends the planar cardinal direction (CD) into 3D space and obtains a new model called TCD (three-dimensional cardinal direction). Base on the smallest cubic TCD relations and original relations, explain the correlations between basic TCD relations and block algebra. Then according to the results in block algebra, two novel ways to compute the inverse and composition of basic TCD relations are proposed. And an O(n4) algorithm to check the consistency of a set of basic TCD constraints over simple blocks is given. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Multi-Target Track Initiation in Heavy Clutter

引用

Computers, Materials & Continua 2022年第9期72卷 4489-4507页

作者： Li Xu Ruzhen Lou Chuanbin Zhang Bo Lang Weiyue Ding College of Computer Science and Technology Harbin Engineering UniversityHarbin150001China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun130012China Norinco Group Air Ammunition Research Institute Co.Ltd. Harbin150036China Harvard Medical School Boston02115USA

In the heavy clutter environment, the information capacity is large,the relationships among information are complicated, and track initiationoften has a high false alarm rate or missing alarm rate. Obviously, it is adifficult task to get a high-quality track initiation in the limited measurementcycles. This paper studies the multi-target track initiation in heavy *** first, a relaxed logic-based clutter filter algorithm is presented. In thealgorithm, the raw measurement is filtered by using the relaxed logic *** not only design a kind of incremental and adaptive filtering gate, but alsoadd the angle extrapolation based on polynomial extrapolation. The algorithm eliminates most of the clutter and obtains the environment with highdetection rate and less clutter. Then, we propose a fuzzy sequential Houghtransform-based track initiation algorithm. The algorithm establishes a newmeshing rule according to system noise to balance the relationship between thegrid granularity and the track initiation quality. And a flexible superpositionmatrix based on fuzzy clustering is constructed, which avoids the transformation error caused by 0–1 voting method in traditional Hough *** addition, the algorithm allows the superposition matrixes of nonadjacentcycles to be associated to overcome the shortcoming that the track can’t beinitiated in time when the measurements appear in an intermittent way. Anda slope verification method is introduced to detect formation-intensive serialtracks. Last, the sliding window method is employed to feedback the trackinitiation results timely and confirm the track. Simulation results verify thatthe proposed algorithms can initiate the tracks accurately in heavy clutter.

关键词： Track initiation heavy clutter multi-target Hough transform

来源：评论

学校读者我要写书评

暂无评论

Security Analysis Model, System Architecture and Relational Model of Enterprise Cloud Services

引用

International Journal of Automation and computing 2016年第6期13卷 574-584页

作者： Dang-Dang Niu Lei Liu Xin Zhang Shuai Lu Zhuang Li College of Computer Science and Technology Jilin University Changchun 130012 China Data Center Consolidation (Beijing) Industrial and Commercial Bank of China Beijing 100096 China College of Mathematics Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Cloud computing is one of the fastest growing and popular computer technologies, and there are more and more enterprise services based on the cloud computing. In order to save costs, more and more enterprises and their employees have hired the enterprise cloud services, and put much important information in the cloud gradually. Cloud service systems have become the main targets of malicious attacks. However, the cloud computing technologies are still not perfect, and the management and maintenance of enterprise cloud services are more complex compared to traditional network services of cloud computing. So, enterprise cloud services are more likely to encounter some security problems, and the influenced scale of these security problems is broad. But there are few researches on the security of enterprise cloud services. In this paper, we analyze the software as a service（Saa S） enterprise cloud services and introduce the research status of security problems in cloud computing environment. Combining with the analysis of the characteristics and application architecture of Saa S enterprise cloud services, we propose the security problems analysis model, the analysis system architecture and the relational model. Our researches can support further research of the automatic generation of solutions and guide the deployment of security policies of Saa S enterprise cloud services.

关键词： cloud deployment perfect maintenance likely users bases encounter relational costs

来源：评论

学校读者我要写书评

暂无评论

An algorithm of sensor optimization in controlled discrete event systems

引用

Journal of Computational Information Systems 2014年第20期10卷 8677-8684页

作者： Hao, Shuang Ouyang, Dantong Li, Lin Zhang, Liming Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Sensor optimization is the problem of minimizing sensor activation in a controlled discrete event system. During the evolutionary process, the available resources are supposed to be limited. Therefore, sensors are activated by the agent when it is necessary. Sensor activation policies are the functions that determine which sensors are to be activated. One policy is considered to minimal, if any strictly less activation decided by the agent satisfies the feasibility. In this paper, a new algorithm is proposed to compute the minimal sensor activation policy. The algorithm, based on the operation of Reverse Change and the property of the Label-reached, calculates the minimal solution of sensor activation and achieves a lower complexity of computation relatively.

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

Dynamic policy updating based on one-point coverage random sets theory

Dynamic policy updating based on one-point coverage random s...

引用

1st International Workshop on knowledge Discovery and Data Mining, WKDD

作者： Da, Wei Yan-Heng, Liu Lian-Deng, Li Xue-Jie, Liu Hai-Yan, Hu College of Computer Science and Technology Jilin University Jilin 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun Jilin 130012 China

ISBN: (纸本)0769530907

Aiming at the dynamic policy trigger problem in policy based network management, this thesis first introduces the uncertain information generated by onepoint coverage random sets theory and also the unified framework of fuzzy information. On the basis of which, according to the feature of policy based network management, a model used to update the predicted information using present known information, experience, and knowledge is designed. At the same time, this thesis put forward that, take the semblance of policy as constant probability in product space conditional event algebra, so as to execute information fusion of multiple sets of related policy. In the end, compared with the policy based inference system and then analyze the result. © 2008 IEEE.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

A registration method for augmented reality system based on visual SLAM

A registration method for augmented reality system based on ...

引用

2019 International Conference on Electronic engineering and Informatics, EEI 2019

作者： Zhang, Zuoming Shu, Man Wang, Zixuan Wang, Hanwen Wang, Xin College of Software Engineering Jilin University Changchun China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education Changchun China

ISBN: (纸本)9781728140766

In augmented reality, smart devices need to sense their own position in real physical space and complex scene structure to achieve good virtual reality interaction and three-dimensional registration. This paper proposes a technical framework of visual SLAM, which uses VO and BA methods based on feature points to obtain pose, and applies it to the augmented reality system to realize pose estimation, registration, tracking, collision and other effects of intelligent equipment independent of artificial or natural landmarks. © 2019 IEEE.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

A Simple but Effective Approach for Unsupervised Few-Shot Graph Classification 24

A Simple but Effective Approach for Unsupervised Few-Shot Gr...

引用

33rd ACM Web Conference, WWW 2024

作者： Liu, Yonghao Huang, Lan Cao, Bowen Li, Ximing Giunchiglia, Fausto Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education China

ISBN: (纸本)9798400701719

Graphs, as a fundamental data structure, have proven efficacy in modeling complex relationships between objects and are therefore found in wide web applications. Graph classification is an essential task in graph data analysis, which can effectively assist in extracting information and mining content from the web. Recently, few-shot graph classification, a more realistic and challenging task, has garnered great research interest. Existing few-shot graph classification models are all supervised, assuming abundant labeled data in base classes for meta-training. However, sufficient annotation is often challenging to obtain in practice due to high costs or demand for expertise. Moreover, they commonly adopt complicated meta-learning algorithms via episodic training to transfer prior knowledge from base classes. To break free from these constraints, in this paper, we propose a simple yet effective approach named SMART for unsupervised few-shot graph classification without using any labeled data. SMART employs transfer learning philosophy instead of the previously prevailing meta-learning paradigm, avoiding the need for sophisticated meta-learning algorithms. Additionally, we adopt a novel mixup strategy to augment the original graph data and leverage unsupervised pretraining on these data to obtain the expressive graph encoder. We also utilize the prompt tuning technique to alleviate the overfitting and low fine-tuning efficiency caused by the limited support samples of novel classes. Extensive experimental results demonstrate the superiority of our proposed approach, significantly surpassing even leading supervised few-shot graph classification models. Our code is available here. © 2024 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

More Flexible Proximity Wildcards Path Planning with Compressed Path Databases 34

More Flexible Proximity Wildcards Path Planning with Compres...

引用

34th International Conference on Automated Planning and Scheduling, ICAPS 2024

作者： Chen, Xi Zhang, Yue Zhang, Yonggang College of Software Jilin University China College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

ISBN: (纸本)9781577358893

Grid-based path planning is one of the classic problems in AI, and a popular topic in application areas such as computer games and robotics. Compressed Path Databases (CPDs) are recognized as a state-of-the-art method for grid-based path planning. It is able to find an optimal path extremely fast without state-space search. In recent years, researchers have tended to focus on improving CPDs by reducing CPD size or improving search performance. Among various methods, proximity wildcards are one of the most proven improvements in reducing the size of CPD. However, its proximity area is significantly restricted by complex terrain, which significantly affects the pathfinding efficiency and causes more additional costs. In this paper, we enhance CPDs from the perspective of improving search efficiency and reducing search costs. Our work focuses on using more flexible methods to obtain larger proximity areas, so that more heuristic information can be used to improve search performance. Experiments conducted on the Grid-Based Path Planning Competition (GPPC) benchmarks demonstrate that the two proposed methods can effectively improve search efficiency and reduce search costs by up to 3 orders of magnitude. Remarkably, our methods can further reduce the storage cost, and improve the compression capability of CPDs simultaneously. Copyright © 2024, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Learning Stable Task-Level Manifold for Few-Shot Learning

Learning Stable Task-Level Manifold for Few-Shot Learning

引用

2023 International Conference on Digital Image computing: Techniques and Applications, DICTA 2023

作者： Yu, Siyi Luo, Wei Li, Gang Yang, Bo Jilin University College of Computer Science and Technology China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Deakin University School of Information Technology Geelong Australia

ISBN: (纸本)9798350382204

Few-shot learning (FSL) aims to learn to new concepts based on very limited data. One of the main challenges in FSL is the use of pretrained embeddings whose dimension is too high for the small sample size. While the large dimensionality helps capture diverse features in the training example, not all the features are relevant to the task at hand. Such task-irrelevant features from pre-trained embeddings can negatively impact the performance of the FSL model. To address this challenge, we propose a simple yet effective way to learn task-level manifolds that explicitly eliminate the negative effect of nuisance features. One key novelty of our approach is to address class imbalance in the training data by injecting supervised information through key virtual samples, which we named Manifold Support Points. Empirically, we demonstrate that the stability of the learnt task-level manifolds and their effectiveness in challenging tasks in FSL. Our approach shows competitive performance on several benchmark datasets, including tieredImageNet and CUB. © 2023 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：