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

Adaptive feature selection and extraction approaches for image retrieval based on region

Journal of Multimedia 2010年第1期5卷 85-92页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Image retrieval based on region is one of the most promising and active research directions in recent year's CBIR, while region segmentation, feature selection and feature extraction of region are key issues. However, the existing approaches always adopt a uniform approach of segmentation and feature extraction for all images in the same system. In this paper, we propose adaptive image segmentation and feature extraction approach according to different category image for image retrieval system. To improve performance, we propose adaptive segmentation approach according to different category image. Textured image is segmented by Gaussian Mixture Models (GMM), while non-textured image is segmented by our proposed block-based normalized cut. To accurately describe feature of region, we propose weight assignment method for centroid pixel and its neighbor by convolution with normal distribution when image segmentation by GMM. To improve generalization, we propose adaptive number of Fourier descriptors of shape signature which depends on the energy distribution of Fourier descriptors, instead of fixed number by experience. To simply and efficiently describe the spatial relationships of multi-object or multi-region in same image, we apply simplified topological relationships. The experiments demonstrate that proposed approaches are superior to the traditional approaches. © 2010 ACADEMY PUBLISHER.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Modeling and Mining Spatiotemporal Social Contact of Metapopulation from Heterogeneous Data

Modeling and Mining Spatiotemporal Social Contact of Metapop...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Bo Yang Hongbin Pei Hechang Chen Jiming Liu Shang Xia School of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Department of Computer Science Hong Kong Baptist University Hong Kong National Institute of Parasitic Diseases Chinese CDC Shanghai China

ISBN: (纸本)9781479943012

During an epidemic, the spatial, temporal and demographical patterns of disease transmission are determined by multiple factors. Besides the physiological properties of pathogenes and hosts, the social contacts of host population, which characterize individuals' reciprocal exposures of infection in view of demographical structures and various social activities, are also pivotal to understand and further predict the prevalence of infectious diseases. The means of measuring social contacts will dominate the extent how precisely we can forecast the dynamics of infections in the real world. Most current works focus their efforts on modeling the spatial patterns of static social contacts. In this work, we address the problem on how to characterize and measure dynamical social contacts during an epidemic from a novel perspective. We propose an epidemic-model-based tensor deconvolution framework to address this issue, in which the spatiotemporal patterns of social contacts are represented by the factors of tensors, which can be discovered by a tensor deconvolution procedure with an integration of epidemic models from rich types of data, mainly including heterogeneous outbreak surveillance, social-demographic census and physiological data from medical reports. Taking SIR model as a case study, the efficacy of the proposed method is theoretically analyzed and empirically validated through a set of rigorous experiments on both synthetic and real-world data.

关键词： educational institutions Diseases Sociology Statistics Tensile stress Surveillance Data models

来源：评论

学校读者我要写书评

暂无评论

Efficient and Privacy-Preserving Eclipse Query Over Encrypted Data

Efficient and Privacy-Preserving Eclipse Query Over Encrypte...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Weiyu Song Yonggang Zhang Lili Sun Yandong Zheng Rongxing Lu College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China State Key Laboratory of Integrated Services Networks Xidian University Xi'an China Faculty of Computer Science University of New Brunswick Fredericton Canada

As the mobile Internet grows rapidly, location-based services (LBSs) are widely applied in the tourism and transportation fields. To fully mine the data collected, location service providers (LSPs) intend to offer various query services to users, which include eclipse query. The eclipse query can generalize nearest neighbor queries and skyline queries and allow users to set more rough and customizable preference ranges. In addition, with the boom of cloud computing, more and more LSPs hope to leverage the cloud to offer better query services. Given that the data could potentially contain confidential information, the data are required to be encrypted prior to outsourcing them. Therefore, eclipse queries need to be executed on the ciphertext. Although several schemes for eclipse queries have been proposed in existing works, they have little focus on privacy issues. To address this issue, we propose an efficient and privacy-preserving scheme for eclipse queries (EPEQ) in this paper. First, we develop a MinValue tree to construct an index for the dataset. Then, by utilizing the MinValue tree and a symmetric homomorphic encryption technique, we design a secure minimum value comparison protocol to obtain a skyline data and a secure undominated data acquisition protocol to obtain the data not skyline dominated by the skyline data. After that, we present our scheme. We analyze the security of the EPEQ scheme and perform experimental evaluations, demonstrating the security and efficiency of our EPEQ scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PBCounter: Weighted Model Counting on Pseudo-Boolean Formulas

arXiv

引用

arXiv 2023年

作者： Lai, Yong Xu, Zhenghang Yin, Minghao College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Computer Science and Information Technology Northeast Normal University Changchun130017 China

In Weighted Model Counting (WMC), we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its literals. The current WMC solvers work on Conjunctive Normal Form (CNF) formulas. However, CNF is not a natural representation for human-being in many applications. Motivated by the stronger expressive power of pseudo-Boolean (PB) formulas than CNF, we propose to perform WMC on PB formulas. Based on a recent dynamic programming algorithm framework called ADDMC for WMC, we implement a weighted PB counting tool PBCounter. We compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD, ExactMC, D4, and ADDMC, where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF formula. The experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas. Copyright © 2023, The Authors. All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A Task Processing Efficiency Improvement Scheme Based on Cloud-Edge Architecture in Dense Computing Environments

SSRN

引用

SSRN 2022年

作者： Feng, Jiahui Qi, Jingze Liu, Yuanning Liu, Zhen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Graduate School of Engineering Nagasaki Institute of Applied Science 536 Aba-machi Nagasaki851-0193 Japan

As cloud-edge architecture combines low latency and high-performance computing, it has a wider range of application scenarios. Considering that, how to reasonably allocate tasks to the edge cloud or the central cloud and how to select appropriate virtual machines (VMs) for tasks are two key aspects affecting the efficiency of cloud-edge architecture. For the former, the ARDT algorithm is proposed, which dynamically adjusts the optimal threshold by predicting the number of real-time edge-end devices. For the latter, we design the DBMR algorithm based on the Max-Fit algorithm, in which we propose a structure of blocking to reduce the time complexity of the original algorithm from O(n2) to O(n(n-m)). Experimental results show that the ARDT-DBMR algorithm optimizes the average processing time and task failure rate by 30%-40% compared with the baseline algorithms and other advanced algorithms and significantly improves the problem of abnormal fluctuations in VM utilization in dense computing environments. © 2022, The Authors. All rights reserved.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：