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

Density and sliding window-based clustering over evolving data streams

ICIC Express Letters, Part B: Applications 2015年第8期6卷 2275-2283页

作者： Yu, Yanwei Zhao, Jindong Zhang, Yonggang Wen, Changci School of Computer and Control Engineering Yantai University No. 32 Qingquan Road Laishan District Yantai China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University No. 2699 Qianjin Street Changchun China Jingchang Office of Chinese Airforce No. 11 Shuangyuan Road Shijingshan District Beijing China

Density-based clustering over huge volumes of evolving data streams is critical for many modern applications ranging from network traffic monitoring to moving object management. In this work, we propose an efficient density-based clustering algorithm under sliding window environments to handle evolving data streams. First, we use cell partition optimization to fast determine points’ status instead of expensive completed neighbor query for core points. Second, we cluster new and expired points with cell-cluster structure. Cell-cluster leverages relationships of connected cells around points to complete classification of the points in the cells. Under the effect analysis of new and expired points, we then design an exact clustering framework with cell partition and cell-cluster in streaming windows. Our experimental evaluation, using both real and synthetic streaming data, demonstrates that our algorithm shows effectiveness in capturing the clusters with noise and performs faster than state-of-the art methods, and scales to high volume data streams. © 2015, ICIC International.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

Neural architecture search based on the cartesian genetic programming

arXiv

引用

arXiv 2021年

作者： Wu, Xuan Zhang, Xiuyi Jia, Linhan Chen, Liang Liang, Yanchun Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China College of Software Jilin University Changchun130012 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China

Neural architecture search (NAS) is a hot topic in the field of automated machine learning and outperforms humans in designing neural architectures on quite a few machine learning tasks. Motivated by the natural representation form of neural networks by Cartesian Genetic Programming (CGP), we propose an evolutionary approach of NAS based on CGP, called CGPNAS, to solve sentence classification task. To evolve the architectures under the framework of CGP, the operations such as convolution are identified as the types of function nodes of CGP, and the evolutionary operations are designed based on Evolutionary Strategy. The experimental results show that the searched architectures are comparable with the performance of human-designed architectures. We verify the ability of domain transfer of our evolved architectures and the transfer experimental results show that the accuracy deterioration is lower than 2-5%. Finally, the ablation study identifies the Attention function as the single key function node and the linear transformations along could keep the accuracy similar with the full evolved architectures, which is worthy of investigation in the future. Copyright © 2021, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Verilog combinational equivalence checking based on smt constraint solver

引用

ICIC Express Letters, Part B: Applications 2011年第5期2卷 1087-1092页

作者： Zeng, Hailin Ouyang, Dantong Zhang, Yuehua Zhang, Liming Zhang, Guiling School of Computer Science and Technology Jilin University No. 2699 Qanjin Street Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University No. 2699 Qanjin Street Changchun 130012 China Software College Jilin University No. 2699 Qanjin Street Changchun 130012 China

Most previous works on combinational equivalence checking use BDDs and other Boolean level representations to formulate and solve the problem, and therefore, not utilizing the word-level information inherently presents in the design. To overcome this limitation, word level proof techniques like Satis ability Module Theory (SMT) were proposed. The SMT can efficiently handle the designs containing word-level arithmetic operators and bit-level Boolean logic. In this paper, we present a technique checking the equivalence of two combinational circuits based on SMT constraint solver. The experimental results indicate that our method can utilize word-level information to speed up the process of verification and result in a decrease in memory usage. © 2011 ISSN 2185-2766.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

Multifaceted User Modeling in Recommendation: A Federated Foundation Models Approach

arXiv

引用

arXiv 2024年

作者： Zhang, Chunxu Long, Guodong Guo, Hongkuan Liu, Zhaojie Zhou, Guorui Zhang, Zijian Liu, Yang Yang, Bo College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Australia Kuaishou Technology China Institute for AI Industry Research Tsinghua University China

Multifaceted user modeling aims to uncover fine-grained patterns and learn representations from user data, revealing their diverse interests and characteristics, such as profile, preference, and personality. Recent studies on foundation model-based recommendation have emphasized the Transformer architecture's remarkable ability to capture complex, non-linear user-item interaction relationships. This paper aims to advance foundation model-based recommendersystems by introducing enhancements to multifaceted user modeling capabilities. We propose a novel Transformer layer designed specifically for recommendation, using the self-attention mechanism to capture sequential user-item interaction patterns. Specifically, we design a group gating network to identify user groups, enabling hierarchical discovery across different layers, thereby capturing the multifaceted nature of user interests through multiple Transformer layers. Furthermore, to broaden the data scope and further enhance multifaceted user modeling, we extend the framework to a federated setting, enabling the use of private datasets while ensuring privacy. Experimental validations on benchmark datasets demonstrate the superior performance of our proposed method. Code is available. Copyright © 2024, The Authors. All rights reserved.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

A New Authentication Protocol for Wireless Communication Network Based on IEEE802.16

A New Authentication Protocol for Wireless Communication Net...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Ruixue Li Zhiyi Fang Wei Cao Yumei Yin Peng Xu College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China College of Information Technology Liaodong University Dandong China Changchun Institute of Optics Fine Mechanics and Physics Chinese Academy and Sciences Changchun China

After analyzing the specific security requirements of the wireless communication network based on IEEE802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol for wireless mobile environment was proposed and designed. Then, its security was analyzed from the angle of technical realization and formal analysis to verify whether the original safety goals were achieved. Especially, formal analysis was mostly done. Finally, system testing was also carried out and the results were analyzed to verify function and performance of the new protocol.

关键词： Authentication Wireless application protocol Wireless communication Communication system security Information security Data security Safety Access protocols Clocks Synchronization

来源：评论

学校读者我要写书评

暂无评论

Describing the semantic relation of the deep web query interfaces using ontology extended LAV

Journal of Software

引用

Journal of Software 2010年第1期5卷 89-98页

作者： Liang, Hao Zuo, Wan-Li Ren, Fei Department of Computer Science and Technology Jilin University Jilin Changchun China Department of Information Changchun Taxation College Jilin Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun China

The key element in a Deep Web information fusion system is the data source modeling problem, which is the determinant technical factor of the whole system. The query interfaces provided by the Deep Web are the clues to disclose the hidden schemas. But the complicated semantic relationships in the query interfaces lead to the lower generality and ability of local as view (LAV) method in the traditional information fusion system. An approach of extracting attributes and semantic relationships from the interfaces utilizing Ontology is present in this paper, and WordNet is introduced as an Ontology instrument. The semantic relationships between semantic related attributes are evaluated by the WordNet. The meaningless attributes are instantiated by instance information embedded in the interfaces. A semantic matrix is generated and used to evaluate the semantic related groups in the specific domains. The expression ability of LAV is extended by the mapping and matching mechanism based on the semantic related groups. The experiment is carried out on the famous dataset, and the results show the efficiency of Ontology extended LAV of building mappings between local schemas and mediator schema. © 2010 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Image resizing by color energy updating

引用

Guangxue Jingmi Gongcheng/Optics and Precision engineering 2013年第SUPPL期21卷 264-270页

作者： Zhao, Hong-Wei Wang, Zhen Liu, Ping-Ping Li, Qing-Liang School of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China

A new image resizing algorithm was proposed based on a color space and an energy updating mechanism. First, the concept of color space was introduced into image resizing algorithm and the pixel's energy function was re-built based on the gradient of gray space and color space. Three kinds of color energy functions were tested and the energy function in HSI space was finally chosen because of its excellent performance. Additionally, since image resizing might badly corrupt the contours of main areas in an original image and might further affect the understanding of the image, an energy updating mechanism was proposed. The energy updating mechanism could increase the neighborhood energy values where a pixel had been deleted. By doing so, it could decrease the probability that seams cross this area again, thus the contour of this area could be protected well. In experiments, the degree of Scale Invariant Feature Transform (SIFT) matching between original image and resized image with different λ values was calculated. The best performance shows that the proportion between the color and gray energy functions was 7:3. By comparing the proposed method with other two state of arts algorithms, it indicates that the shape of main area will be better preserved with the proposed algorithm without introducing any more complexity.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Integrity maintenance of continually changed OWL ontology

引用

Journal of computational Information Systems 2012年第7期8卷 2931-2939页

作者： Cui, Xianji Ouyang, Dantong Ye, Yuxin Wang, Haiyan College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Computation and Knowledge Engineering Ministry of Education Changchun 130012 China National Engineering Research Center of Geophysics Exploration Instruments Changchun 130061 China

OWL Ontologies may change continually to meet user's dynamic request and it may damage the integrity of the ontology. Thus, it is in urgent to propose an effective strategy to maintain the integrity of the continually changed ontology. In this paper, we propose a framework of integrity maintenance of continually changed OWL ontology. At the basis of the connectedness between ontology data and integrity constraints, we define the maximal relevant subontology of the continually changed ontology and perform the integrity checking in its maximal relevant subontology instead of the entire ontology. In further, for the different change operations, the integrity checking is realized by finding the corresponding maximal relevant subontologies. Finally, for the unintegrity ontology data, obtain the integrity ontology for the continually changed ontology which satisfies all the integrity constraints by modifying the ontology axioms. Thus, maintain the integrity of the continually changed ontology. © 2012 Binary Information Press.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Solving the optimal power flow problem via a non-interior path following algorithm

引用

Journal of computational Information Systems 2013年第3期9卷 1191-1198页

作者： Su, Menglong Liu, Le Wang, Jian Cai, Hua Mathematics and Information Science College Luoyang Normal University Luoyang 471022 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China College of Mathematics and Information Science Ocean University of China Qingdao 266000 China College of Mathematics Jilin University Changchun 130012 China

In this paper, we propose a non-interior path following algorithm for solving the optimal power flow problem. By using the new approach, we can choose initial guesses arbitrarily in the whole space of n dimensional Euclidean space. This can improve the computational efficiency of the algorithm greatly than before. Some numerical examples are presented to illustrate the results of this paper. Copyright © 2013 Binary Information Press.

关键词： computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A directional algorithm based on shape context for 3D point pattern matching

引用

Journal of computational Information Systems 2015年第7期11卷 2355-2365页

作者： Pang, Kuo Liang, Yanchun Zhou, You Wang, Kangping Wang, Shu Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun China Department of Computer Science and Technology Zhuhai College of Jilin University Zhuhai China

Point pattern matching is the basis of image recognition and computer vision. Point pattern matching in three dimensional space with the presence of noise and outlier is an important research focus. In this paper, we present a novel method for point pattern matching base on shape context. Particularly, we aim to find robust feature points to determine the positive direction of the point set for three dimensional rotation. At the same time, we improve the feature extraction and similarity measurement, and then combine with bipartite map matching. Comparative experiments on both synthetic point sets and real data sets demonstrate that the proposed algorithm is effective and robust. ©, 2015, Binary Information Press. All right reserved.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：