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

K-means sequence clustering algorithm based on Two-stage center sequences selection

Journal of Computational Information systems 2014年第6期10卷 2351-2358页

作者： Wu, Di Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Department of Information and Electronic Engineering Hebei University of Engineering Handan 056038 China Key Lab of Computer Virtual Manufacturing and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China

K-means sequence clustering is a hot topic in data mining. However, the clustering quality of K-means is affected heavily by outliers and noises. In this paper, a new sequence similarity measurement, sequence density and Q neighborhoods of sequence are deffned and then a novel K-means sequence clustering algorithm TCSSK-means (Two-stage center sequences selection-based K-means) is proposed. In the first stage, the sequence with the minimum density neighborhood is viewed as initial clustering center, and the distances between each initial clustering center are as far as possible, the KICCSS (K initial clustering center sequences set) is obtained. In the second stage, by selecting the mean sequence of the larger similarity sequences set, which meets certain conditions with clustering centers in the T-1-th round, K clustering centers of sequence databases in the T-th round are updated. Repeat the renewal process of sequence clustering centers until the sequence clustering criterion function converges. K final sequence clusters are gained finally. The experimental results and analysis show that the performance of TCSSK-means is better in clustering quality and running time. Copyright © 2014 Binary Information Press.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Directional relation reasoning based on boundary sensitive model in three-dimensional space

引用

Journal of Computational Information systems 2015年第17期11卷 6345-6354页

作者： Kong, Dehan Liu, Yongshan Ma, Junlei Wang, Yuzheng Han, Ameng Department of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China Data Industry Research Lab Qinhuangdao China Telecommunications Engineering with Management Beijing University of Posts and Telecommunications Beijing China Information Technology Office of Yanshan University Qinhuangdao China

In three-dimension space, with the minimum bounding rectangular (MBR) of any type of object's projections in xoy and xoz planes, there are four possible types of projection: minimum bounding rectangular, horizontal line, vertical line and point, then a boundary sensitive directional relationship matrix model (BSDRM) is proposed, the model can unified representation direction relations between objects of the four different types of projection, further, the three dimensional direction relation is inferred by combining the two direction matrixes in plane xoy and plane xoz. Based on this model, single direction relation reasoning table and multi direction relation reasoning method are proposed. Finally, direction relation reasoning arithmetic is given and proved to be true. © 2015, by Binary Information Press

关键词： Boundary Sensitive Directional Relationship Matrix Model Three-dimension Directional Relationship Reasoning Combinative Reasoning Table

来源：评论

学校读者我要写书评

暂无评论

Local outlier detection algorithm based on gaussian kernel density function 10th

Local outlier detection algorithm based on gaussian kernel d...

引用

10th International Symposium on Intelligence Computation and Applications, ISICA 2018

作者： Zhang, Zhongping Liu, Jiaojiao Miao, Chuangye School of Information Science and Engineering Yanshan University QinhuangdaoHebei066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province QinhuangdaoHebei066004 China

ISBN: (纸本)9789811364723

With the rapid development of information technology, the structure of data resources is becoming more and more complex, and outlier mining is attracting more and more attention. Based on Gaussian kernel function, this paper considers three neighbors: k nearest neighbors, reverse k neighbors and shared nearest neighbors. A local outlier detection algorithm based on Gaussian kernel function is proposed. Firstly, the algorithm stores the nearest neighbors of each data object through kNN maps, including k-nearest neighbors, reverse k-nearest neighbors, and shared nearest neighbors, forming a kernel neighbor set S. Secondly, Estimating density of data objects through kernel density estimation KDE method. Finally, the relative density outlier factor RDOF is used to estimate the degree of data objects deviating from the neighborhood, and then determines whether the data objects are outliers, and the validity of the algorithm is proved on the real and synthetic data sets. © Springer Nature Singapore Pte Ltd. 2019.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

TACS: A transparent application bandwidth management system

TACS: A transparent application bandwidth management system

引用

IEEE 9th International Conference on computer and Information technology, CIT 2009

作者： Chen, Xianqin Long, Xiang Gao, Xiaopeng Ma, Junjie State Key Lab. of Virtual Reality Technology and System School of Computer Science and Technology Beijing University of Aeronautics and Astronautics Beijing 100191 China

ISBN: (纸本)9780769538365

With the rapid advance of computer and network technology, more and more applications are deployed in the customer-side network. These applications require different quality of service (QoS), but have to share a few bandwidth limited internet connections. Owing to the IP network's best-effort delivery mechanism, the QoS requirements are hard to be satisfied. There have been plenty of QoS solutions in research and industry areas, however, few of them are easy to understand or to deploy. Therefore, we provide a solution, based on a simple and clear model, has the ability of transparently deployed at the inner side of customer's gateway device and controlled in the application-oriented way. We also introduce a straightforward QoS policy definition language to allow user to create QoS rules for various applications. We conduct the evaluation of our proto type system running upon mid-end industrial personal computer under both the lab testbed and the practical network. In the lab test, our system achieves 200Mbps throughput, in the practical field test, our system successfully manages a 100Mbps internet link for over 3000 active users. © 2009 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A new estimator analysis method to synchronization among multivariate neural series of mild cognitive impairment

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2012年第23期6卷 868-874页

作者： Wen, Dong Guan, Xinyong Chen, Ruihong The Key Laboratory for Computer Virtual Technology System Integration of HeBei Province Yanshan University Qinhuangdao Hebei 066004 China Liren College Yanshan University Qinhuangdao Hebei 066004 China Division of General Internal Medicine Xiantao First People's Hospital Xiantao Hubei 433000 China

Synchronization decay of resting state EEG has shown that cognitive dysfunction in mild cognitive impairment (MCI) was relevant to a loss of functional connectivity in intermediate frequency bands. A new estimator analysis method called new S estimator (NSE) proposed recently by us quantifies synchronization between neuronal signals at multiple *** paper meant to explore the behavior of synchronization of multichannel EEG in MCI and healthy normal controls at rest, and preliminarily make clear the clinical significance of the NSE in MCI *** (EEG) were recorded from 10 MCI patients and 12 age-matched healthy normal controls (NC). NSE values were computed both across the all frequency band and separately in the delta, theta, alpha, beta (including beta1, beta2 and beta3), and gamma bands. The Montreal Cognitive Assessment (MoCA) was used to assess the symptom severity of MCI patients and *** values in the alpha and beta1 bands were significantly lower in MCI patients than in NC. NSE values in the alpha and beta1 bands were positively correlated with the MoCA scores in all participants (MCI and NC). In MCI patients, NSE values in the alpha and beta1 bands were also positively correlated with MoCA *** results suggest that NSE values are a useful correlate of EEG synchronization in MCI patients.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

An algorithm based on bit vector decomposition and hash linklist for mining frequent patterns in data streams

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2012年第22期6卷 570-579页

作者： Ren, Jiadong Zhang, Yuanyuan Yu, Shiying College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China Hebei Provincial S and T Management Information Center 159 Dongfeng Road Shijiazhuang 050021 China

Most of algorithms based on bit vector for mining frequent pattern always produce candidate itemsets and scan the same data repeatedly;this increases the running time and the space consumption. In this paper, an algorithm BVDAHL based on bit vector decomposition and hash linklist for mining frequent patterns on data streams which solves the above issues, is proposed. The itemsets (transactions) whose corresponding number of 1 is k, denoted as k-one itemsets (k-one transactions). The arrival transactions are converted into bit vectors, and permutations and combinations are used to decompose converted results, then the decomposed itemsets are stored in the hash linklist. In hash function, according to the position of 1 of bit vector to compute the address, if the transaction has same address and same content that already exists in data domain, then the value adds one in count domain, otherwise the pointer in pointer domain points to the next node directly, it is no need to deal with conflict. Afterwards the property of anti-monotonic will be used to prune the k+1-one transactions in bit vector table if there exists infrequent k-one itemsets that decomposed by such k+1-one transactions. Then the algorithm repeats the above processes until the transaction in bit vector table can not be decomposed. Finally we will receive the frequent itemsets by comparing the obtained value of count domain in hash linklist with minSup. Experiment results show that BVDAHL is very efficiency and scalable.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

A cloud-edge-device collaborative offloading scheme with heterogeneous tasks and its performance evaluation

引用

Frontiers of Information technology & Electronic Engineering 2024年第5期25卷 664-684页

作者： Xiaojun BAI Yang ZHANG Haixing WU Yuting WANG Shunfu JIN School of Information Science and Engineering Yanshan UniversityQinhuangdao 066004China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan UniversityQinhuangdao 066004China

How to collaboratively offload tasks between user devices,edge networks(ENs),and cloud data centers is an interesting and challenging research *** this paper,we investigate the offoading decision,analytical modeling,and system parameter optimization problem in a collaborative cloud-edge device environment,aiming to trade off different performance *** to the differentiated delay requirements of tasks,we classify the tasks into delay-sensitive and delay-tolerant *** meet the delay requirements of delay-sensitive tasks and process as many delay-tolerant tasks as possible,we propose a cloud-edge device collaborative task offoading scheme,in which delay-sensitive and delay-tolerant tasks follow the access threshold policy and the loss policy,*** establish a four-dimensional continuous-time Markov chain as the system *** using the Gauss-Seidel method,we derive the stationary probability distribution of the system ***,we present the blocking rate of delay-sensitive tasks and the average delay of these two types of *** experiments are conducted and analyzed to evaluate the system performance,and numerical simulations are presented to evaluate and validate the effectiveness of the proposed task offloading ***,we optimize the access threshold in the EN buffer to obtain the minimum system cost with different proportions of delay-sensitive tasks.

关键词： Edge computing Ofloading scheme Cloud-edge device collaboration Markov chain Cost function

来源：评论

学校读者我要写书评

暂无评论

Semantic analysis and retrieval of spatial data based on the uncertain ontology model in Digital Earth

引用

International Journal of Digital Earth 2015年第1期8卷 3-16页

作者： Shengtao Sun Lizhe Wang Rajiv Ranjan Aizhi Wu The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and EngineeringYanshan UniversityQinhuangdaoChina Institute of Remote Sensing and Digital Earth Chinese Academy of SciencesBeijingChina Computational Informatics CSIROCanberraACTAustralia College of Vehicles and Energy Yanshan UniversityQinhuangdaoChina

Metadata are the information about and description of *** Digital Earth,metadata become variant and heterogeneous with many *** paper studies uncertain features in the generation and application of metadata,and two types of uncertainties(incomplete and imprecise)are described based on semantic quantitative measurement method semantic relationship quantitative measurement based on possibilistic logic and probability statistic(SRQ-PP).Moreover,in the case study,we apply two types of quantitative measurements based on SRQ-PP to describe incomplete(uncertain)knowledge and imprecise(vague)information separately in spatial data service retrieval,which in turn is helpful to identify additional potential data resources and provide a quantitative analysis of the results.

关键词： metadata semantic ontology uncertainty measurement spatial data digital earth

来源：评论

学校读者我要写书评

暂无评论

Mining important nodes in complex software network based on ripple effects of probability 19

Mining important nodes in complex software network based on ...

引用

2019 ACM Turing Celebration Conference - China, ACM TURC 2019

作者： Ren, Jiadong Huang, Guoyan Wang, Qian He, Haitao Liu, Xinqian Zhao, Xiaolin Computer Virtual Technology and System Integration Laboratory of Hebei Province College of Information Science and Engineering Yanshan University Qinhuangdao Hebei China Beijing Key Laboratory of Software Security Engineering Technology School of Computer Science and Technology Beijing Institute of Technology Beijing China

ISBN: (纸本)9781450371582

The complexity of software directly leads to an increasing cost in software testing and maintenance. Finding the important nodes with significant vulnerability is helpful for fault discovery and further reduces the damage to the software system. In this paper, a new algorithm named MIN-REP (Mining the Important Nodes based on Ripple Effects of Probability) is proposed to find out the paths with greater possibility for fault propagation, and then the important nodes are mined. To build a model of directed unweighted software network, functions are taken as the nodes and the dependencies between the functions are regarded as the edges. Fault propagation tendency paths are discovered based on the function execution paths and minimum probability threshold. The frequency of each directed edge in the set of fault propagation tendency path is taken as the weight of the corresponding edge. Then some metrics related to ripple effects of probability are calculated. Finally, the nodes with the metric at top-k are taken as the important nodes. The experiment verifies the accuracy and efficiency of the algorithm MIN-REP. © 2019 Association for Computing Machinery.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Human Movement Detection and Gait Periodicity Analysis Using Channel State Information 12

Human Movement Detection and Gait Periodicity Analysis Using...

引用

12th International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2016

作者： Liu, Zijuan Wang, Lin Liu, Wenyuan Li, Binbin School of Information Science and Engineering Yanshan University China Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province China School of Economics and Management Yanshan University Qinhuangdao HeBei China

ISBN: (纸本)9781509056965

Under the influence of multipath effects and small scale fading, the robustness and reliability of the existing human detection methods based on radio frequency signals are easy to be impaired. In this paper, we propose a novel design that using the multi-layer filtering of channel state information (CSI) to identify moving targets in dynamic environments and analyze the gait periodicity of human. We employ an efficient CSI subcarrier feature difference to the multi-layer filtering method leveraging principal component analysis (PCA) and discrete wavelet transform (DWT) to eliminate the noises. Furthermore, we propose a profile matching mechanism for human detection and a periodicity analysis mechanism for human gait taking advantage of the above design. We evaluated it with the commodity Wi-Fi infrastructures in different environments. Experimental results indicate that our approach performs identification of human with an average accuracy of 94%. © 2016 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：