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

Pacific-Asia Conference on Circuits, Communications and Systems, PACCS

作者： Fei Ren Hao Liang Liang Hu Wanli Zuo College of Computer Science and Technology Jilin University Changchun China Department of Information Changchun Taxation College Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

The Web has been dramatically deepened by the deep Web, which the traditional information fusion system shows disability to integrate. The myriad information hidden behind the deep Web attracts the considerable attention from the researchers. The key element in a deep Web information fusion system is the data source modeling problem, which determine the whole technical method of the whole system. The query interfaces provided by the deep Web are the clues to disclose the hidden schemas. But the complicated semantic relationships in the query interfaces lead to the low generality and ability of local as view (LAV) method in the traditional information fusion system. An approach of evaluating the semantic relationships between the attributes in the query interfaces by utilizing WordNet, a typical ontology technique, is presented in this paper. The semantic relationships between semantic related attributes are evaluated by the semantic calculating method of WordNet. The meaningless attributes is instantiated by instance information embedded in the interfaces in order to attach correlated semantic information. The experiment is carried out in the real life domains, and the result shows the efficiency of ontology based semantic evaluating method in LAV.

关键词： Ontologies databases educational institutions Computer science educational technology Search engines Circuits Laboratories knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

Using IACO and QPSO to solve spatial clustering with obstacles constraints

Using IACO and QPSO to solve spatial clustering with obstacl...

引用

IEEE International Conference on Automation and Logistics

作者： Xueping Zhang Hongmei Zhang Yanxia Zhu Yawei Liu Tengfei Yang Taogai Zhang Key Laboratory of Spatial Data Mining & Information Sharing of Ministry of Education Fuzhou University Fuzhou China School of Computer Science & Engineering Henan University of Technology Zhengzhou Henan China Department of Computer Science & Engineering Henan University of Engineering Zhengzhou China

ISBN: (纸本)9781424447947

Spatial clustering has been an active research area in the data mining community. Spatial clustering is not only an important effective method but also a prelude of other task for spatial data mining (SDM). In this paper, we propose an improved ant colony optimization (IACO) and quantum particle swarm optimization (QPSO) method for spatial clustering with obstacles constraints (SCOC). In the process of doing so, we first use IACO to obtain the shortest obstructed distance, and then we develop a novel QPKSCOC based on QPSO and K-Medoids to cluster spatial data with obstacles. The experimental results demonstrate that the proposed method, performs better than Improved K-Medoids SCOC in terms of quantization error and has higher constringency speed than Genetic K-Medoids SCOC.

关键词： Ant colony optimization data mining Particle swarm optimization Computer science Quantization Genetics Clustering algorithms Automation Logistics data engineering

来源：评论

学校读者我要写书评

暂无评论

ARRAY: A Non-application-Related, Secure, Wide-Area Disaster Recovery Storage System

ARRAY: A Non-application-Related, Secure, Wide-Area Disaster...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Lingfang Zeng Dan Feng Bharadwaj Veeravalli Qingsong Wei Division of Data Storage System Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Electrical and Computer Engineering National University of Singapore Singapore Data Storage Institute Singapore

With our society more information-driven, we have begun to distribute data in wide-area storage systems. At the same time, both physical failure and logic error have made it difficult to bring the necessary recovery to bear on remote data disaster, and understanding this proceeding. We describe ARRAY, a system architecture for data disaster recovery that combines reliability, storage space, and security to improve performance for data recovery applications. The paper presents an exhaustive analysis of the design space of ARRAY systems, focusing on the trade-offs between reliability, storage space, security, and performance that ARRAY must make. We present RSRAII (Replication-based Snapshot Redundant Array of Independent Imagefiles) which is a configurable RAID-like data erasure-coding, and also others benefits come from consolidation both erasure-coding and replication strategies. A novel algorithm is proposed to improve snapshot performance referred to as SMPDP (Snapshot based on Multi-Parallel Degree Pipeline).

关键词： Secure storage Network servers Bandwidth Redundancy data security Cities and towns Laboratories educational technology Hardware History

来源：评论

学校读者我要写书评

暂无评论

Privacy Parallel Algorithm for Mining Association Rules and its Application in HRM

Privacy Parallel Algorithm for Mining Association Rules and ...

引用

International Symposium on Computational Intelligence and Design, ISCID

作者： XuePing Zhang YanXia Zhu Nan Hua Key Laboratory of Spatial Data Mining & Information Sharing of Ministry of Education Fuzhou China College of Information Science and Engineering Henan University of Technology Zhengzhou China Technology Department Zhengzhou Super HW Network Technology Company Limited Zhengzhou China

Parallel association rules mining has been improved the efficiency of data mining, and meanwhile concerned with the privacy preserving problem. A simple and effective method of parallel association rules mining which based on privacy protection----parallel association rules mining algorithm with privacy preserving (PARMA-P) has been introduced in this paper. It could achieve effective concealment of frequent item-set and then the association rules by the means of using imported hash assignment strategy in frequent item sets of FP sub tree could be protected. It has been used in HRM of an enterprise and experiments show that the algorithm can be simple and effective in protection of data privacy.

关键词： Parallel algorithms data mining Association rules Human resource management Protection data privacy Space technology Information science educational technology Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

Escrow mechanism for personal security keys on IBE

引用

Tongxin Xuebao/Journal on Communications 2009年第11 A期30卷 75-80页

作者： Zou, Yue-Peng Ouyang, Dan-Tong He, Li-Li Bai, Hong-Tao College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

A new escrow mechanism for personal security keys on IBE was proposed. This mechanism constructed a security trust system composed of private key generator, key management center, and user security component to set up a personal security key escrow model, thus providing identity validation, confidentiality and integrality check for the application, backup, recovery, and renewal of the escrowed keys. The mechanism, taking advantage of the IBE, simplified the process of authentication and encryption, mede it possible for users to complete independently the escrow of personal security keys. Therefore, it is more practical than traditional key escrow schemes.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Prediction of Protein Domain Using Distance-Based Maximal Entropy

引用

Journal of Bionic engineering 2008年第3期5卷 215-223页

作者： Shu-xue Zou Yan-xin Huang Yan Wang Chun-guang Zhou Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 P. R. China

Detecting the boundaries of protein domains is an important and challenging task in both experimental and computational structural biology. In this paper, a promising method for detecting the domain structure of a protein from sequence information alone is presented. The method is based on analyzing multiple sequence alignments derived from a database search. Multiple measures are defined to quantify the domain information content of each position along the sequence. Then they are combined into a single predictor using support vector machine. What is more important, the domain detection is first taken as an imbal- anced data learning problem. A novel undersampling method is proposed on distance-based maximal entropy in the feature space of Support Vector Machine （SVM）. The overall precision is about 80%. Simulation results demonstrate that the method can help not only in predicting the complete 3D structure of a protein but also in the machine learning system on general im- balanced datasets.

关键词： protein domain boundary SVM imbalanced data learning distance-based maximal entropy

来源：评论

学校读者我要写书评

暂无评论

Novel trusted authentication and evaluation framework in VANET

引用

Tongxin Xuebao/Journal on Communications 2009年第1 A期30卷 107-113页

作者： Wu, Jing Liu, Yan-Heng Wang, Jian Li, Wei-Ping College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China Changchun Jilin University Information Technologies Co. Ltd. Changchun 130012 China

Vehicular ad hoc networks (VANET) have many new characteristics unlike tranditional network, such as centriclessness, mobility and multi-hop transmission, which invalidate conventional key managements. The fast development and successful application of trusted computing technology provide a potential solution to achieve effective authentication and trust evaluation. According to the VANET with self-organization, a new authentication and trust evaluation framework was proposed based on trusted computing technology, the concepts of "trusted attribute" and "trusted grade" were introduced, and the key management architecture as well as authentication process of mobile node were explained in detail. Moreover, the potential real application of the presented framework was discussed, and the trust evaluation method and its argumentation in the presented framework were given.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

S-SimRank: Combining Content and Link Information to Cluster Papers Effectively and Efficiently

S-SimRank: Combining Content and Link Information to Cluster...

引用

4th International Conference on Advanced data Mining and Applications

作者： Cai, Yuanzhe Li, Pei Liu, Hongyan He, Jun Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783540881919

Both Content analysis and link, analysis have its advantages in measuring relationships among documents. In this paper. we propose a new method to combine these two methods to compute the similarity of research papers so that we can do clustering of these papers more accurately. In order to improve the efficiency of similarity calculation, we develop a strategy to deal with the relationship graph separately, without affecting the accuracy. We also design an approach to assign different weights to different links to the papers, which can enhance the accuracy of similarity calculation. The experimental results conducted oil ACM data Set show that our new algorithm. S-SimRank, outperforms other algorithms.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: The IDS model adapt to load characteristic under IPv6/4 environment

RETRACTED ARTICLE: The IDS model adapt to load characteristi...

引用

2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008

作者： Wei, Chuyi Fang, Zhiyi Li, Wei Liu, Xiaonan Yang, Hongjun Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)9781424421084

Thih paper proposed an intrusion detection system framework adapt to load characteristic under IPv6/4 environment; it uses decision-tree-based classification method, under guidance of a certain flow, creates dynamically rule matching tree adapt to load characteristic, reduces greatly the rule set that per packet or event need to be detected, improves the detection efficiency, can be utilized to solve the high packetloss problem; this paper proposed to make use of Petri net to built a mode to the complicated aggressive behavior, form the complicated aggressive rule library, improve the detection accuracy rate; in view of IPv6 security problem, make use of Snort rule description language, construct the detection rule under IPv6 environment; finally construct the platform in the local area network, carry on the simulation experiment. The experiment proved fully the feasibility and validity of intrusion detective method adapt to load characteristic under IPv6/4 environment. © 2008 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Canonical Huffman code based full-text index

引用

Progress in Natural Science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b, Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a College of Computer Science and Technology, Jilin University, key laboratory of Symbol Computation and knowledge engineering of the ministry of education, Changchun 130012, China b Department of Computer Science, Jilin Technology and Business College, Changchun 130062, China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer Science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：