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

Cluster-based superseding nearest neighbor queries on uncertain data

Journal of Convergence Information technology 2012年第17期7卷 392-401页

作者： Liu, Wenyuan Li, Wei Du, Ying Chen, Zijun He, Yourui College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China College of Economics and Management Yanshan University Qinhuangdao Hebei 066004 China The Key Lab. for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao Hebei 066004 China

Recently, query processing based on uncertain data is becoming research focuses. Cluster-based superseding nearest neighbor (CSNN) query algorithm on uncertain data is proposed in this paper. We divide the instances of each object into k clusters by applying the clustering algorithm k-means, and then store these clustered objects in R-tree like index structures. Ranked list will be retrieved through traversing R-tree, which could include instances, clusters, or objects. While unfolding the ranked list, the superseding graph G will be constructed gradually based on the superseding relationship. The final result sets will be found through pruning and validating the superseding graph G. Finally, the experimental results show that the algorithm is efficient and effective.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

VT-SGN:Spiking Graph Neural Network for Neuromorphic Visual-Tactile Fusion

引用

IEEE Transactions on Haptics 2024年 PP卷 PP-PP页

作者： Wu, Peiliang Zhang, Haozhe Li, Yao Chen, Wenbai Gao, Guowei Yanshan University School of Information Science and Engineering Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao066004 China Beijing Information Science and Technology University School of Automation Beijing100192 China

Current issues with neuromorphic visual-tactile perception include limited training network representation and inadequate cross-modal fusion. To address these two issues, we proposed a dual network called visual-tactile spiking graph neural network (VT-SGN) that combines graph neural networks and spiking neural networks to jointly utilize the neuromorphic visual and tactile source data. First, the neuromorphic visual-tactile data were expanded spatiotemporally to create a taxel-based tactile graph in the spatial domain, enabling the complete exploitation of the irregular spatial structure properties of tactile information. Subsequently, a method for converting images into graph structures was proposed, allowing the vision to be trained alongside graph neural networks and extracting graph-level features from the vision for fusion with tactile data. Finally, the data were expanded into the time domain using a spiking neural network to train the model and propagate it backwards. This framework effectively utilizes the structural differences between sample instances in the spatial dimension to improve the representational power of spiking neurons, while preserving the biodynamic mechanism of the spiking neural network. Additionally, it effectively solves the morphological variance between the two perceptions and further uses complementary data between visual and tactile. To demonstrate that our approach can improve the learning of neuromorphic perceptual information, we conducted comprehensive comparative experiments on three datasets to validate the benefits of the proposed VT-SGN framework by comparing it with state-of-the-art studies. © 2008-2011 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of foam and sprays based on the Weber number

引用

Journal of Computational Information systems 2014年第7期10卷 2829-2836页

作者： Zhang, Lihui Zhang, Chao Li, Ying Lv, Mengya Tang, Yong The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province The College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Department of Information Engineering Environmental Management College of China Qinhuangdao 066004 China

In this paper, we propose a method based on the Weber number to uniformly model and simulate the foam and sprays generated by the fluid motion. We use the SPH to construct the fluid and calculate the Weber number of each particle. The fluid particles are divided into foam particles, transition particles and water particles by comparing their Weber number with a given critical value. These particles are rendered independently. For the solid-liquid interaction in fluid, we use SPH particles to mark the solid shape, and correct the changed solid particle position using a rotating equation. Finally, a more precise fluid surface illumination model is proposed, and the Fresnel reflection coefficient of this model can be gotten by the Snell law. Experiment results show that our method achieve real-time performance and the visual effect is desirable. © 2014 Binary Information Press.

关键词： Hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Adaptive multilevel meshes for cloth simulation

引用

Journal of Information and Computational Science 2014年第11期11卷 3865-3872页

作者： Zhao, Jing Pei, Shanshan Lv, Mengya Li, Ying Tang, Yong Yang, Meiling Zhang, Mingmin Pan, Zhigeng The College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao China The College of Computer Science and Technology Zhejiang University Hangzhou China Institute of Service Engineering Hangzhou Normal University Hangzhou China

A novel method based on multilevel meshes is proposed to simulate the cloth draping process rapidly on a complex model. Considering of the difficulty of computing the realtime collision between cloth and complex models by normally methods, the draping process of cloth is divided into several phases and at each phase the mesh size is smaller than its previous one. The optimized 1-to-4 split is used to drive the rapid changes in the grid hierarchy and to simplify the calculations. We choose the widely used ellipsoid as the bounding cell to enclose the complex models in the environment. The ellipsoid avoids the complex structure of hierarchical bounding box and eliminates the impossible collision model area rapidly. Experiments demonstrate that this method can accelerate the draping process of cloth and decrease the number of iterations and the calculation of collision detection. Further mesh refinement improves the reality of cloth when it reaches the final position and ensures the realism of the simulation in real time. ©2014 Binary Information Press

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Learning to Cluster Person in the Video via Graph Convolution Network

Learning to Cluster Person in the Video via Graph Convolutio...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Wei Li Sixin Liang Ang Bian Guodong Du College of Computer Science Sichuan University Chengdu China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and Engineering Yanshan University Qinhuangdao P.R. China

Video person re-identification is receiving academic interest. However, the practical application of the algorithm is hardly supported because of prohibitive annotated data. Hence, the study for unlabeled data will lead to an attractive alternative. This work explores an innovative strategy, namely, learning to cluster unlabeled person in the video through graph convolutional networks. In this paper, we find that the possibility of inter-frame linkage can be inferred from context. Therefore, a pose-guided topology linkage clustering framework is proposed. Our framework consists of three modules: (i) a pose-guided representation module; (ii) a pose-guided embedding module; (iii) a link prediction module. Firstly, the representation coding alone is performed at the level of relational induction bias, embedding the implicit pose structure information in image features. Then, based on the consideration of the topology relationship between adjacent and cross-frame, graph convolutional network is introduced to infer the likelihood of linkage between frame nodes. Experiments show that the method demonstrates excellent scalability in addition to being an effective response to person clustering in case of changes, and does not need the number of clusters as a prior.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Practical Cloud API Complementary Recommendation Service for Mashup Creation

A Practical Cloud API Complementary Recommendation Service f...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xiaowei Liu Wenhui Chen Mengmeng Sun Yali Si Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China School of Computer Science and Engineering Changshu Institute of Technology Changshu China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the popularity of the service-oriented development paradigm in the cloud era, numerous cloud APIs have been developed. The continuous proliferation of cloud APIs has submerged developers in a sea of options, bringing the need for cloud API recommendation techniques. Most existing cloud API recommendation methods focus on theoretical studies and neglect practical applications. As a result, these methods face several challenges, such as covering recommendation scenarios, generating real-time responses, and handling concurrent requests. In this paper, we propose and implement a practical cloud API complementary recommendation service for mashup creation. To address the above challenges, we first propose a cloud API complementary recommendation framework named FICR, which exploits feature interactions to mine implicit complementarity and models complementarity from the mashup side and the target cloud API side for scenario coverage. Then, we conduct performance optimization via precoding and batch size tuning to optimize FICR for real-time responses. Finally, we design a minimum-connection load balancing algorithm with resource early warning and build a distributed system for concurrent requests. Experiments conducted on real-world datasets show that FICR outperforms state-of-the-art baseline models in complementary recommendation scenarios, and demonstrate that the implemented service meets the real-time and concurrency requirements. The service will serve as a practical tool to help developers during mashup creation.

关键词： Concurrent computing Federated learning Mashups Precoding Load management Real-time systems Tuning

来源：评论

学校读者我要写书评

暂无评论

New construction of quaternary sequence with even period based on cyclotomic classes of order two

引用

ICIC Express Letters 2015年第7期9卷 1959-1964页

作者： Jia, Yanguo Shi, Yan Duan, Xiaobei Shen, Xiumin School of Information Science and Engineering Yanshan University No. 438 West Hebei Street Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Heibei Province No. 438 West Hebei Street Qinhuangdao China

In this paper, we present a new method for constructing quaternary sequence with even period 2f based on cyclotomic classes of order two. Under the premise of v = 2f +1, we construct two binary sequences with period 2f. Then we can construct a new quaternary sequence from those two binary sequences by using the reverse Gray Mapping. The distribution of autocorrelation function of the proposed quaternary sequence is also derived, which is decided by the parity of f. © 2015, ISSN 1881-803X.

关键词： Binary sequences

来源：评论

学校读者我要写书评

暂无评论

Mining the important nodes of software based on complex networks

引用

ICIC Express Letters 2015年第12期9卷 3263-3268页

作者： Huang, Guoyan Zhang, Peng Li, Yanling Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 Hebei Ave Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao China

The main purpose of studying the software structure is considered to understand and recognize the structure easily by also taking into account the quality of software. In this paper, we define and analyze the node importance based on the invoking dependency relationships among the nodes to mine the influential nodes for the software. Firstly, we construct a directed network to denote the software execution process depending on the invoking relationships. Secondly, according to the information of the Dependency Node Set (DNS) of each function node, we define the importance for the node. Finally, we present the algorithm Measure the Importance of Node (MIN) to evaluate the importance of each node. Comparing the value of nodes by the algorithm Mining the top-K Nodes (MKN), we can obtain the most influential nodes in the software network. In addition, with experiments results, the method MKN is verified to be effective for measuring the importance of the function nodes accurately. © 2015 ICIC International.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Mining software behavior pattern from software execution trace

引用

ICIC Express Letters, Part B: Applications 2015年第12期6卷 3367-3372页

作者： Ren, Jiadong Wu, Hongfei Yin, Tengteng Li, Yanling Liu, Jiaxin Dong, Jun College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology System Integration of Hebei Province No. 438 Hebei Avenue Qinhuangdao066004 China

A software execution trace can be viewed as a series of events. An event may correspond to the execution of a basic block, the invocation of a class or a method. These traces imply important unique characteristics of software behaviors. In this paper, a novel approach to mine representative software behavior patterns is proposed. First, we give an exact definition of Common Closed Ordered Iterative Pattern (CCOIP). The pattern may occur many times not only within a single trace but also across multiple traces. Then, an efficient algorithm called CCOIP-Miner is proposed to mine CCOIP. The mined CCOIPs are regarded as representative software behavior patterns. Our experiment results show the efficiency of algorithm CCOIP-Miner. © 2015, ICIC Express Letters Office. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Research on community detection algorithm based on modularity maximum

引用

ICIC Express Letters 2016年第12期10卷 2995-3003页

作者： Chen, Jing Wan, Yun College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Avenue Qinhuangdao066004 China

It is well known that the drawbacks of label propagation algorithm are high randomness, weak robustness and easy to form monster community. Many improved methods are proposed constantly in order to avoid these problems. However, the related label propagation algorithm is seldom concerned with the stability of community structure and the results of community detection. In order to obtain the high value communities, modularity and community structure are involved in detecting communities. In this paper, the algorithm CDMMCS (Community Detection based on Modularity Maximum and Community Structure) is proposed. The main idea is based on label propagation, but CDMMCS begins with some small communities, and the process of label updating is in consideration of the modularity maximum. When the label stops propagating, the communities with the same label are merged. Check the community structure of merged communities, and perform different operations according to different community structures. Experiments show that CDMMCS successfully detects communities with higher modularity values than LPA (label Propagation Algorithm) and LPAm+ in some realworld networks. And the running time of CDMMCS is less than LPAm+. © 2016 ICIC International.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：