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

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

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

ISBN: (纸本)9781509056972

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%.

关键词： Principal component analysis Wireless sensor networks Wireless communication Discrete wavelet transforms Feature extraction Wireless fidelity Object detection

来源：评论

学校读者我要写书评

暂无评论

The study to eeg synchronization in alzheimer's disease based on new s estimator method

引用

Journal of Convergence Information technology 2012年第22期7卷 1-7页

作者： Wen, Dong Chen, Ruihong Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province 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 Alzheimer's disease (AD) was relevant to a loss of functional connectivity in intermediate frequency bands. The 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 AD and healthy normal controls at rest, and preliminarily make clear the clinical significance of the NSE in AD *** (EEG) were recorded from 10 AD 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 Mini-Mental Status Examination (MMSE) was used to assess the symptom severity of AD patients and *** values in the beta1 and beta2 bands were significantly lower in AD patients than in NC. NSE values in the alpha and beta1 bands were positively correlated with the MMSE scores in all participants (AD and NC). In AD patients, NSE values in the alpha, beta1 and beta2 bands were also positively correlated with MMSE *** results suggest that NSE values are a useful correlate of EEG synchronization in AD patients.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

A Robust Collaborative Recommendation Algorithm Based on k-distance and Tukey M-estimator

引用

China Communications 2014年第9期11卷 112-123页

作者： YI Huawei ZHANG Fuzhi LAN Jie School of Information Science and Engineering Yanshan University Qinhuangdao 066004 Hebei Province E R.China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 P. R. China Liaoning University of Technology Jinzhou 121001 Liaoning Province P. R. China

The existing collaborative recommendation algorithms have lower robustness against shilling *** this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distance and Tukey ***,we propose a k-distancebased method to compute user suspicion degree(USD).The reliable neighbor model can be constructed through incorporating the user suspicion degree into user neighbor *** influence of attack profiles on the recommendation results is reduced through adjusting similarities among ***,Tukey M-estimator is introduced to construct robust matrix factorization model,which can realize the robust estimation of user feature matrix and item feature matrix and reduce the influence of attack profiles on item feature ***,a robust collaborative recommendation algorithm is devised by combining the reliable neighbor model and robust matrix factorization *** results show that the proposed algorithm outperforms the existing methods in terms of both recommendation accuracy and robustness.

关键词： shilling attacks robust collaborative recommendation matrix factori-zation k-distance Tukey M-estimator

来源：评论

学校读者我要写书评

暂无评论

Fourth Normal Form and Free Redundancy for XML Document Based on Path Expression

Fourth Normal Form and Free Redundancy for XML Document Base...

引用

International Conference on computer Science and Network technology

作者： Zhongping Zhang Zhixiao Liu College of Information Science and Engineering The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University College of Information Science and Engineering Yanshan University

ISBN: (纸本)9781467329637

With eXtensible Markup Language (XML) becoming more and more popular, to avoid the redundancy, XML schema design has become an important issue. So the normalization of XML is a hotspot in research field. Similar to relational database, this paper is database based with the goal of eliminating the data redundancy, to study the concepts of path expression in Document Type Definition (DTD). In this paper, XML is extended with functional dependency (XFD) and multi-valued dependency (XMVD), which are fundamental to semantic specification. And make formalized definitions on XFD and XMVD;Based on the concepts of XML tree and data dependency, it provides the description of key and redundancy. On the condition of the coexistence of XFD and XMVD, it further proposes the terms to meet the fourth normal form (4XNF) and provides theorem to determine the XML document tree which meets the above terms without redundancy, and the sound of the 4XNF is proved by experiment.

关键词： Normalization Functional dependency Multi-valued dependency key Redundancy The fourth normal form redundancy XML document extensible markup language normalization data redundancy data dependency

来源：评论

学校读者我要写书评

暂无评论

Towards Constant-Time Cardinality Estimation for Large-Scale RFID systems

Towards Constant-Time Cardinality Estimation for Large-Scale...

引用

International Conference on Parallel Processing (ICPP)

作者： Binbin Li Yuan He Wenyuan Liu School of Information Science and Engineering YanShan University China TNLIST Tsinghua University China The Key Laboratory for Computer Virtual Technology System Integration of HeBei Province China

ISBN: (纸本)9781467375887

Cardinality estimation is the process to survey the quantity of tags in a RFID system. Generally, the cardinality is estimated by exchanging information between reader(s) and tags. To ensure the time efficiency and accuracy of estimation, numerous probability-based approaches have been proposed, most of which follow a similar way of minimizing the number of required time slots from tags to reader. The overall execution time of the estimator, however, is not necessarily minimized. The estimation accuracy of those approaches also largely depends on the repeated rounds, leading to a dilemma of choosing efficiency or accuracy. In this paper, we propose BFCE, a Bloom Filter based Cardinality Estimator, which only needs a constant number of time slots to meet desired estimation accuracy, regardless of the actual tag cardinality. The overall communication overhead is also significantly cut down, as the reader only needs to broadcast a constant number of messages for parameter setting. Results from extensive simulations under various tag IDs distributions shows that BFCE is accurate and highly efficient. In terms of the overall execution time, BFCE is 30 times faster than ZOE and 2 times faster than SRC in average, the two state-of-the-arts estimation approaches.

关键词： Estimation Radiofrequency identification Servers Probabilistic logic Protocols Approximation methods Error probability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

LocP: An efficient Localized Polling Protocol for large-scale RFID systems

LocP: An efficient Localized Polling Protocol for large-scal...

引用

International Conference on Network Protocols

作者： Binbin Li Yuan He Wenyuan Liu Lin Wang Hongyan Wang School of Information Science and Engineering YanShan University China TNLIST Tsinghua University China The Key Laboratory for Computer Virtual Technology and System Integration HeBei Province China

ISBN: (纸本)9781509032822

RFID systems nowadays are operated at large-scale in terms of both occupied space and tag quantity. One may have prior knowledge of the complete set of tags (denoted by N) and any set of wanted tags (denoted by M) within the complete set, i.e., M ⊆ N. Then here comes an open problem: when one is particularly interested in a subarea of the system, how to collect information (not simply tagIDs) from a wanted subset (denoted by d M ) of the interrogated tags (denoted by d N ) in that subarea? This issue has great significance in many practical applications but appears to be challenging when there is a stringent time constraint. In this work, we first establish the lower-bound of this problem, and show a straightforward polling solution. Then, we propose a novel polling protocol called LocP, which consists of two phases: the Tags-Filtering phase and the Ordering-and-Reporting phase. LocP employs Bloom Filter twice to significantly reduce the scale of candidate tags in the Tags-Filtering phase. In the Ordering-and-Reporting phase, tags determine their own transmission time-slots according to the allocation vectors iteratively broadcasted by the reader. LocP thus achieves a delicate tradeoff between time and polling accuracy. We conduct extensive simulations to evaluate the performance of LocP. The results demonstrate that LocP is highly efficient in terms of information collection time, leading to convincing applicability and scalability of large-scale RFID systems.

关键词： Protocols Radiofrequency identification Microwave integrated circuits Market research Conferences Scalability Airports

来源：评论

学校读者我要写书评

暂无评论

Complementarity Analysis of Cloud API Ecosystems: An Empirical Study on ProgrammableWeb and Huawei AppGallery Datasets

Complementarity Analysis of Cloud API Ecosystems: An Empiric...

引用

IEEE International Conference on Web Services (ICWS)

作者： Xiaowei Liu Mengmeng Sun Wenhui Chen Dianlong You Limin Shen Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

With the proliferation of the digital economy, cloud API has become the best carrier for data transmission and capability replication in software development. In the service-oriented software development paradigm, developers select appropriate cloud APIs for mashup creation based on their practical needs, where complementarity is an important consideration. Complementarity is reflected in various implicit relationships within mashups and cloud APIs, making complementarity analysis of cloud API ecosystems a critical issue. However, existing studies have overlooked the complementarity, and the lack of application variety in the primary dataset ProgrammableWeb has added a threat to the validity and generalization. In this paper, we first build a dataset of two cloud API ecosystems: ProgrammableWeb centering on mashup creation and Huawei AppGallery centering on mobile app development. Then, we conduct statistical and graph analysis to compare the two ecosystems. Finally, we propose a modeling approach to quantify complementarity and perform an analysis to investigate the role of complementarity in cloud API ecosystems. The results reveal differences between mashups and mobile apps in their preferences for cloud APIs. It also highlights the potential of complementarity in addressing the long-tail problem in cloud API ecosystems and improving cloud API recommendations.

关键词： Analytical models Mashups Ecosystems Mobile applications Data communication Software development management

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for outlier mining in the internet of things

引用

ICIC Express Letters 2013年第1期7卷 215-219页

作者： Chen, Wei Liu, Yongshan Zhang, Yang College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province No. 438 Hebei Ave. Qinhuangdao 066004 China

Most of the traditional outlier mining algorithms are not suitable for high dimensional datasets. However, the dimensionality of the dataset in the field of the Internet of Things is high. Therefore, Hypergraph-based Outlier Mining (HOM) algorithm is proposed to solve the problem. Two different hypergraph models are constructed in the HOM algorithm. One is itemset hypergraph. One-itemset in transaction database is itemset hypergraph's vertices, and the transactions are itemset hypergraph's hyperedges. The other one is transaction hypergraph. The transactions are its vertices, and frequent itemsets are the hyperedges. The outliers are found by hypergraph partitioning. Experiments show that HOM algorithm can effectively find the outliers in high dimensional space. ©2013 ICIC International.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Incremental mining of sequential patterns from multiple item set data streams

引用

ICIC Express Letters 2014年第10期8卷 2687-2692页

作者： Hao, Xiaobing Chen, Yuping Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Ave. Qinhuangdao 066004 China

Sequential pattern mining has a wide range of applications in data streams. The real data involves multiple data streams and each data stream is itemset-sequence. However, most algorithms mine a single item in a single data stream. So IMASP algorithm (incremental mining of across-stream sequential patterns from multiple item set data streams) is presented to mine sequential patterns from multiple data streams and it is an incremental algorithm with single-pass scanning. What is more, the algorithm uses a multi-streams bitmap temporary table to store the sequence information in the current sliding windows. The partial substitution and the real-time counting of the item in old and new windows are adopted to improve the execution efficiency of the algorithm. A multi-streams Lexicographic Sequence Tree is used to store items, extended sequences and the support. Experimental results show that IMASP algorithm reduces time and memory consumption and has the efficiency and accuracy for mining across-stream sequential pattern from itemset sequence streams. © 2014 ICIC International.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：