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

International Journal of Digital Content technology and its Applications 2012年第19期6卷 432-440页

作者： Ren, Jiadong Li, Shuo Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China

There exist two major problems in weighted closed sequential patterns mining. The first is that only the weights of items are considered and they ignore the time-interval information of data elements during the mining process;the second is that the existing weighted closed sequential pattern mining algorithms need to scan the sequence database many times or to construct numerous intermediate databases. To address these problems, we propose a memory-based algorithm, MIWCSpan (Memory Indexing for Weighted Closed Sequential pattern mining), for weighted closed sequential pattern mining. In the algorithm, we define a novel sequence weighting approach to find more interesting sequential patterns. Both the weight of sequence items and the time-interval of the data elements are considered in this approach. Moreover, an improved index set based on time-interval, p-iidx, is defined. The structure is a set of triples which store the pointer pointing to the sequence containing p, the time-interval of p in the sequence and the position where p occurs. In the mining process, MIWCSpan first scans the sequence database to read the database into memory. Then it adopts the find-then-index technique recursively to find the items which can constitute a weighted closed sequential pattern and construct p-iidx for the possible weighted closed sequential pattern. At last, the algorithm uses the close-detecting to mine the weighted closed sequential patterns efficiently. The experimental results show that MIWCSpan is better on running time, and it has good scalability.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Commodity dynamic pricing and inventory joint decision-making model based on specific power demand function

引用

Revista Tecnica de la Facultad de Ingenieria Universidad del Zulia 2016年第4期39卷 74-81页

作者： Sun, Dejie Liu, Wenyuan Zhang, Jie School of Information Science and Engineering Yanshan University Qinhuangdao Hebei066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao Hebei066004 China

Dynamic pricing and inventory play a respective role. The purpose of inventory is to try best to maintain an even production speed and efficiently ease supply-and-demand contradiction during the production process and among enterprises in the supply chain. However, dynamic pricing aims at maximizing revenues by setting commodities or services at different price levels according to diversified demands of consumers and different commodity or service price evaluation by consumers in different periods. Therefore, it is important for enterprises to optimize their dynamic pricing strategies and commodity inventory so as to maximize value of researches. However, demands for tangible commodities are uncertain. Generally speaking, the commodity demand volume should first be confirmed before any specific analysis. Therefore, this paper focuses on introducing the commodity demand function and relevant factors influencing the commodity demand volume. The utility function describing consumers' demands for a single commodity is analyzed. The specific power demand function model based on utility maximization is built through the utility function. At last, we conduct an in-depth analysis and simulation of the model.

关键词： Economics

来源：评论

学校读者我要写书评

暂无评论

Subspace clustering based on finding effective spaces

International Journal of Digital Content Technology and its ...

引用

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

作者： Ren, Jiadong Liu, Zhigang Dong, Jun 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

In high-dimensional data space, because the data is sparse inherently, clusters tend to exist in different subspaces, which makes the traditional methods no longer suitable for use. In this paper, we present SCFES, a subspace clustering algorithm based on finding effective spaces. First, we define the effective dimension. By calculating relative entropy we remove redundancy dimensions which affect clustering accuracy. Second, according to the data distribution in the effective dimensions, we get the effective intervals through merging adjacent intervals. The effective space is composed of effective intervals. Third, we extend the density estimator based on undirected acyclic connected graph by using weight so as to estimate the expectation of existing clusters in the space, at the same time combine it with the monotonicity of the clustering criterion mentioned in the CLIQUE algorithm to prune candidates. Consequently we get the effective spaces. Finally, we adopt the structure of sibling tree to store all the effective spaces and use DBSCAN algorithm based on density to generate maximal subspace clusters in some effective spaces. Experimental results show that SCFES effectively finds arbitrarily shaped and positioned clusters in different subspaces. Meanwhile SCFES has better clustering quality and scalability.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Data stream clustering algorithm based on spatial directed graph

引用

Advances in Information Sciences and Service Sciences 2012年第20期4卷 241-249页

作者： Ren, Jiadong Yuan, Xuemei Dong, Jun College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China

Recently, the grid-density based clustering has become one of the major issues among all of the clustering approaches, it has special advantages over other clustering algorithms, such as less computation and the ability of clustering with arbitrarily shape, which are particularly useful for the data stream clustering. This paper defines a spatial directed graph named Grid-Based Graph (GBG) to store the non-empty grids in data space, and proposes a data stream clustering algorithm based on spatial directed graph GBGSClu (Grid-Based Graph Stream Clustering). GBG graph composes of vertices and directed edges, if a vertex A has a neighboring dense vertex B, and then there is a directed edge from vertex B to A in GBG. The algorithm maps the data stream into the non-empty vertices online, updates the vertices' feature vectors with the arriving of data stream, deletes the sparse vertices every gap time, generates GBG graph when the clustering quest coming and finally clusters on the current structure. The eventual clustering results can be obtained by only checking the vertices' in-degree which can reduce the computation needed in clustering. The validity and efficiency of GBGSClu algorithm have been tested and verified by clustering on real and synthetic datasets.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Efficient subtree results computation for XML keyword queries

引用

Frontiers of computer Science 2015年第2期9卷 253-264页

作者： Ziyang CHEN School of Information Science and Engineering Yanshan University Hebei 066004 China Environmental Management College of China Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Yanshan University Hebei 066004 China

In this paper, we focus on efficient construction of restricted subtree （RSubtree） results for XML keyword queries on a multicore system. We firstly show that the perfor- mance bottlenecks for existing methods lie in 1） computing the set of relevant keyword nodes （RKNs） for each subtree root node, 2） constructing the corresponding RSubtree, and 3） parallel execution. We then propose a two-step generic top-down subtree construction algorithm, which computes SLCA/ELCA nodes in the first step, and parallelly gets RKNs and generates RSubtree results in the second step, where generic means that 1） our method can be used to compute dif- ferent kinds of subtree results, 2） our method is independent of the query semantics; top-down means that our method con- structs each RSubtree by visiting nodes of the subtree con- structed based on an RKN set level-by-level from left to right, such that to avoid visiting as many useless nodes as possible. The experimental results show that our method is much more efficient than existing ones according to various metrics.

关键词： XML SLCA/ELCA RSubtree RKNs parallel

来源：评论

学校读者我要写书评

暂无评论

Inference rules based on XML functional dependency and XML multi-valued dependency

Inference rules based on XML functional dependency and XML m...

引用

2014 International Conference on Future Information Engineering and Manufacturing Science(FIEMS 2014)

作者： Zhongping Zhang Shanshan Shi The School of Information Science and Engineering Yanshan University The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province

ISBN: (纸本)9781138026445

There not only exists the relation of the functional dependency and multi-valued dependency in XML data constraint,but also exists the relation of data dependency obtained only from a certain existing relationship instance that is *** reducing data redundancy,in this paper,the concepts of XML functional dependency and XML multi-valued dependency based on the path expression in the Document Type Definition are *** then the inference rules on the condition of the coexistence of functional dependency and multi-valued dependency in XML are ***,the validity and completeness of the inference rules are *** above-mentioned fundamentally solves the problems of implication of functional dependency and multi-valued dependency in XML data,laying a theoretical foundation for XML database design.

关键词： Extensible Markup Language inference rules functional dependency multi-valued dependency

来源：评论

学校读者我要写书评

暂无评论

Kainate induced gamma oscillations and spike-gamma relationship analysis

引用

Advances in Information Sciences and Service Sciences 2012年第21期4卷 606-612页

作者： Wen, Dong Peng, Ce Li, Xiaoli Lu, Chengbiao The Key Laboratory for Computer Virtual Technology System Integration of HeBei Province Yanshan University Qinhuangdao Hebei 066004 China Institue of Electrical Engineering Yanshan University Qinhuangdao Hebei 066004 China

Neuronal oscillations in the gamma frequency range and spikes have been reported in many cortical areas in the information processing, but the role of spikes play in cortical processing remains unclear. The aim of this study was to examine the role of kainate in the generation of oscillatory field activity at gamma frequency in the hippocampal slice prepared from rat brain, and to determine the phase relationship between spikes and gamma oscillations. The kainate induced large amplitude field population spiking activity, which is correlated linearly with the field gamma oscillations. The relationship between timing of spikes and the phase of gamma oscillation was determined by an analysis of circular statistics. Further analysis with Rayleigh test revealed that the relationship of phase-locking between spikes and gamma rhythm is of statistical significance. These data demonstrate that kainate sensitive neuronal networks within hippocampus are able to generate gamma oscillations which are modulated by large amplitude population spikes and phase-locking of spikes to the gamma rhythm suggest the role of memory enhancement in the presence of Kainate receptor activation.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Frequent jump pattern mining based on complex network

引用

Journal of Computational Information systems 2015年第17期11卷 6451-6458页

作者： Wang, Lei Jiang, Liya Dong, Jun Huang, Guoyan Ren, Jiadong 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 Hebei Normal University of Science and Technology Qinhuangdao China

Many researchers are devoted to find frequent pattern in static network. Due to these frequent patterns are usually defined as frequent existence patterns which satisfy given support threshold in network. However, the temporal feature in dynamic network is ignored. In this paper, frequent jump pattern (FJP) is proposed, it not only represents frequent pattern but also can show regular behavior in evolving social network. Furthermore, jump patterns are robust against noise in the analysis of dynamical process. We construct matrix of directed graph (MDG) to present the evolution of complex directed network over time. Moreover, a frequent jump pattern searching algorithm (FJPSA) based on MDG is proposed to find dynamic evolution rule of social network. FJP mining is a technique which can be used in many application fields, such as explaining biological evolution and mining customer behavior regularity in social network. Experimental results demonstrate that our method could effectively mining FJP-graph. © 2015, by Binary Information Press

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

A community detection method to undirected weighted signed social networks

引用

Journal of Computational Information systems 2015年第10期11卷 3623-3632页

作者： Guo, Jingfeng Liu, Miaomiao Liu, Linlin Liu, Yuanying 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 Northeast Petroleum University Daqing China

With regard to the community mining in weighted signed networks and weighted social networks containing only positive links, the AGMA algorithm has some imperfections in the second clustering of vertices. So some improvements were made to it. And a new algorithm CD WSSN (Community Detection for Weighted Signed Social Networks) is proposed to detect communities in undirected and unweighted signed networks. It takes the sign of the edge, the weight of the edge and the friend coefficient between the vertex and community as clustering criteria of vertices. It can divide a weighted signed network into the right number of communities accurately and effectively. Experiments were done on datasets like weighted signed networks, weighted traditional social networks, unweighted signed networks as well as standard networks. The comparative analysis of the experimental results were also done with regard to the difference and frustration about CD WSSN, AGMA, CRA algorithm, and so on. The results verify the accuracy and generality of the algorithm. ©, 2015, Binary Information Press. All right reserved.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

An identity authentication algorithm in the object name service of the internet of things for heat meter

引用

Advances in Information Sciences and Service Sciences 2012年第22期4卷 174-181页

作者： Han, Yuanyuan Liu, Yongshan Chen, Wei Liu, Chang Shang, Xuehui Lv, Yongteng The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Yanshan University Qinhuangdao City 066004 China College of Information Science and Engineering Yanshan University Qinhuangdao City 066004 China

In the environment of the Internet of Things for heat meter, insecurity of the object name service (ONS) is likely to lead to the leakage of user privacy. In order to solve this problem, an identity authentication algorithm is proposed. First, the certificate authority may generate parameters of elliptic curve and its own public key and private key, and announce the parameters and its own public key, so that the registered users can inquire and use them. Second, the client registers at the certificate authority. The certificate authority will generate the public key of the client and the evidence of the client's private key which is signed by private key of the certificate authority. If the generated evidence of private key passes verification of the client, the client will generate its own private key. When a client sends a query request to an ONS server, the ONS server will authenticate identity of the client. If the client gets through the authentication, the ONS server will respond to the query request. The experimental result shows that this algorithm has high security and can avoid the ONS server providing query service for illegitimate client, so as to ensure the security of user privacy.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：