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

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

作者： Jian, Jiang Guoqiong, Liao Hao, Wang Qizhi, Wan School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang Nanchang China

ISBN: (纸本)9780769545448

In RFID application systems with multiple packaging layers, labeling packaging relationship of objects in different packaging layers by encoding methods is a important technology field. Prefix-based labeling scheme is a method by which the packaging relationship of objects amounts to testing whether one object is an prefix of the other, whereas the region numbering scheme is a method by which an ancestor query amount to an interval containment test on the labels. This paper first presents a mixed-encoding scheme based on Huffman algorithm, then propose a variant of this encoding scheme in which new "virtual nodes" are involved in order to improve the stability of encoding. Our experiments prove that the mixed-based encoding scheme is effective due to the enhancement of update performance and query efficiency. © 2011 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

HDROP: Detecting ROP attacks using performance monitoring counters

HDROP: Detecting ROP attacks using performance monitoring co...

引用

10th International Conference on Information Security Practice and Experience, ISPEC 2014

作者： Zhou, Hongwei Wu, Xin Shi, Wenchang Yuan, Jinhui Liang, Bin Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China School of Information Renmin University of China Beijing China Information Engineering University Zhengzhou China

ISBN: (纸本)9783319063195

Combining short instruction sequences originated only from existing code pieces, Return Oriented Programming (ROP) attacks can bypass the code-integrity effort model. To defeat this kind of attacks, current approaches check every instruction executed on a processor, which results in heavy performance overheads. In this paper, we propose an innovative approach, called HDROP, to detecting the attacks. It utilizes the observation that ROP attacks often make branch predictor in modern processors fail to determine the accurate branch destination. With the support of PMC (Performance Monitoring Counters) that is capable of counting performance events, we catch the abnormal increase in branch mis-prediction and detect the existence of ROP attacks. In HDROP, each basic unit being checked consists of hundreds of instructions rather than a single one, which effectively avoids significant performance overheads. The prototype system we developed on commodity hardware shows that HDROP succeeds in detecting ROP attacks, and the performance tests demonstrate that our approach has acceptably lower overheads. © 2014 Springer International Publishing.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Online Streaming Features Causal Discovery Algorithm Based on Partial Rank Correlation

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第1期4卷 197-208页

作者： Yang, Jing Jiang, Liufeng Shen, Anbo Wang, Aiguo Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei230009 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China School of Electronic and Information Engineering Foshan University Foshan528011 China

Aimedat the problem of dynamic causal discovery in the era of artificial intelligence, this article combines partial rank correlation coefficients and streaming features in the field of Bayesian network structure learning and proposes a new online streaming feature causal discovery algorithm based on partial rank correlation named the partial rank casual discovery streaming feature based algorithm. This algorithm is not only suitable for Bayesian causal structure learning in dynamic feature spaces generated by sequential streams of features but can also effectively process multivariate linear Gaussian and nonlinear non-Gaussian data. We present three main contributions. First, for arbitrarily distributed datasets, which can be generated by the additive noise model, we proved that the partial rank correlation coefficient can be used as the criterion for the conditional independence test and explored the distribution of corresponding statistics. Second, the PCSDSF algorithm redefined the relevance based on partial rank statistic prospects and then redefined conditional dependence or independence. This method can significantly reduce the number of conditional independence tests and achieves a good time performance. Finally, theoretical analysis and several experiments proved the reliability of the algorithm. A simulation showed that on average, the PCSDSF algorithm outperforms existing algorithms in terms of both the accuracy and time performance. © 2022 IEEE.

关键词： Additive noise

来源：评论

学校读者我要写书评

暂无评论

A hardware sandbox using processor virtualization for untrusted native code

A hardware sandbox using processor virtualization for untrus...

引用

2013 International Forum on Computer and Information Technology, IFCIT 2013

作者： Wu, Xin Shi, Wen Chang Liang, Bin Key Laboratory of Data Engineering and Knowledge Engineering Renmin University Ministry Of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9783038350194

Native code which is in the form of browser plugins and native binaries in browser extensions brings significant security threats and has attracted considerable attention in recent years. Many researches focus on dangerous behaviors in browser extensions for new security countermeasures but there is no fundamental improvement. Constructing an individual isolation domain and providing sandboxed execution of the code is a key idea to address this problem. However current approach relies heavily on the trust of a module executing within the context of the whole untrusted browser code base accompanied with inevitable vulnerabilities. In this paper, we propose an innovative sandbox utilizing the hardware virtualization support available in modern Intel and AMD processors to construct an individual isolation domain for each benign-but-buggy native code. Our approach push the responsibilities for security down to the hardware level and minimize the difficulties encountered with software based approaches. By utilizing the processor instruction VMENTER or VMEXIT to cause the context switch, we can obtain a better system performance. © (2014) Trans Tech Publications, Switzerland.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Efficient SPARQL query processing in mapreduce through data partitioning and indexing

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Nie, Zhi Du, Fang Chen, Yueguo Du, Xiaoyong Xu, Linhao Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing China IBM Research China Beijing China

ISBN: (纸本)9783642292521

Processing SPARQL queries on single node is obviously not scalable, considering the rapid growth of RDF knowledge bases. This calls for scalable solutions of SPARQL query processing over Web-scale RDF data. There have been attempts for applying SPARQL query processing techniques in MapReduce environments. However, no study has been conducted on finding optimal partitioning and indexing schemes for distributing RDF data in MapReduce. In this paper, we investigate RDF data partitioning technique that provides effective indexing schemes to support efficient SPARQL query processing in MapReduce. Our extensive experiments over a huge real-life RDF dataset show the performance of the proposed partitioning and indexing schemes for efficient SPARQL query processing. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

The rewriting algorithm for disjunctive queries between peer ontologies

The rewriting algorithm for disjunctive queries between peer...

引用

3rd International Conference on Semantics, knowledge, and Grid, SKG 2007

作者： Qin, Biao Wang, Shan Dept. of Computer Science Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China

ISBN: (纸本)0769530079

We study the problem of answering queries given a set of mappings between peer ontologies. In addition to the schema mapping between peer ontologies, there are axioms to give constraints to classes and properties. We propose a set of rules to build graphs for the axioms. Because the axioms have different properties, the generated graphs are classified into four sets. In each peer, its RDF/OWL query languages can support regular expressions. If it wants to be transitive along semantic paths in peer knowledge management systems, we must rewrite conjunctive and disjunctive queries between peers. Because conjunctive queries are well-understood, we focus on a novel algorithm to rewrite disjunctive queries along semantic paths based on the graphs. For all atoms of a disjunctive query, we consider its union as a set and find the maximum rewritings over peers through a graphical way. Finally we do extensive simulation experiments. The simulation results show our algorithm can generate more rewritings than the naive rewriting algorithm at each distance. © 2007 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Using ontology to enhance collaborative recommendation based on community

Using ontology to enhance collaborative recommendation based...

引用

9th International Conference on Web-Age Information Management, WAIM 2008

作者： Yu, Li School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China

ISBN: (纸本)9780769531854

Collaborative filtering is an important personalized recommendation technique applied widely in E-commerce. It is not adapted to multi-interest or title recommendation for the 'general neighbourhood' problem which is analyzed in this paper. Based on it, collaborative filtering recommendation based on community is presented by introducing the concept 'community neighbourhood' in the paper. Unfortunately, it results into severer sparsity problem which makes heavy effect on its performance. In order to overcome it, an ontological A-priori score is used to infer user preference and to pre-fill null rating first. After pre-filling using the ontology method, then collaborative filtering based on community is executed based on a dense rating matrix. The experiment shows that collaborative filtering based on community makes generally better performance than traditional method when data is not very sparse, and ontology method can truly enhance collaborative filtering based on community since the sparsity is overcame. © 2008 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Improve top-K recommendation by extending review analysis

引用

14th Asia Pacific Web Technology Conference, APWeb 2012

作者： Zhu, Qing Xing, Zhe Liang, Jingfan School of Information Renmin University of China Beijing 100872 China Key Laboratory for Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing 100872 China

ISBN: (纸本)9783642292521

The Web has become the popular place for people to purchase product and acquire services, so collaborative filtering is one of the most important algorithms applied in e-commerce recommendation systems. Unfortunately, it is widely recognized that the traditional recommendation methods are inefficient when the user rating data is extremely sparse. In order to overcome the limitations, good recommendation tools are needed to help Web customers determine the products and satisfaction services. In this paper, we propose a multi-dimensional adaptive recommendation algorithm by extending opinion analysis to improve top-k recommendation. In the first step, the novel algorithm that uses extened opinion analysis, creatively combines three dimensional recommendation models: user-based, item-based and opinion-based collaborative filtering. It successfully integrates opinion mining technology with collaborative filtering algorithm. In the second step, we configured the dynamic measurement would help us determine the weight of three dimensions: user-based, item-based and opinion-based analysis, and hence get the final prediction result. The experimental results show that multi-dimensional recommendation can effectively alleviate the dataset sparsity problem and achieve better prediction accuracy compared to other traditional collaborative recommendation algorithms. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

EEG-Based Joint Semi-supervised Learning for Major Depressive Disorder Detection 26th

EEG-Based Joint Semi-supervised Learning for Major Depressi...

引用

26th International Conference on Pattern Recognition, ICPR 2022

作者： Chen, Tao Zheng, Tong Shi, Jinlong Guo, Yanrong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9783031376597

Major Depressive Disorder (MDD) has been a major mental disease in recent years, imposing huge negative impacts on both our society and individuals. The current clinical MDD detection methods, such as self-report scales and interviews, often suffer from their subjectiveness. In contrast, electroencephalography (EEG) signals reflect brain activity and can be used as an effective information source for MDD detection. However, the learning-based MDD detection methods with EEG data usually neglect the valuable information contained in the unlabeled data, therefore possibly suffering from the label scarcity issue. In this context, we propose a simple EEG-based Joint Semi-supervised Learning (JSL) model for the MDD detection task, which fully leverages the information from unlabeled data. Specifically, by equipping the unlabeled samples with the intermediately predicted pseudo labels, the accurate position of the class-specific centroids in the feature space can be gradually refined. Based on that, the auxiliary labels based on a heuristic centroid-based classifier can be obtained, which plays an effective complementary role in predicting the sample labels. The experiments on a public dataset demonstrate the effectivenes s of our method, showing an obvious performance gain via using the proposed semi-supervised strategy. © 2023, Springer Nature Switzerland AG.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A Semi-supervised Bilingual Lexicon Induction Method for Distant Language Pairs Based on Bidirectional Adversarial Model 12

A Semi-supervised Bilingual Lexicon Induction Method for Dis...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Zhi, Wenwu Zhang, Yuhong Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Ministry of Education !!!School of Computer Science and Information Engineering @@@Hefei University of Technology Hefei China

ISBN: (纸本)9781665438582

Bilingual lexicon induction (BLI) can transfer knowledgefrom well- to under- resourced language, and has been widelyapplied to various NLP tasks. Recent work on BLI is projection-based that learns a mapping to connect source and target embedding spaces, with the isomorphism assumption. Unfortunately, the isomorphism assumption doesn't hold gener-ally, especially in typologically distant language pairs. Moreover, without supervised signals guiding, the training will further com-plicates BLI, making the performance of unsupervised methods unsatisfactory. To broke the restrict of isomorphism, we propose a semi-supervised method for distant BLI tasks, named A Semi-supervised Bilingual Lexicon Induction method in Latent Space based on Bidirectional Adversarial Model. First, two latent spaces are learned by two autoencoders for source and target domain independently to weaken the constraint of isomorphism in the embedding spaces. Then we add a few pairs of dictionary to learn the initial mapping to connect the Latent Space. Last, based on initial mapping, Cycle-Consistency is combined with Distance constraint constraint to maintain the geometry structure of both embedding spaces stable in the learning of bi-direction mapping based on adversarial model. By conducting extensive experiments, our method gets state-of-the-art results on most language pairs, especially with significant improvements on distant language pairs. © 2021 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：