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

International Conference on Computer Science and Software engineering

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

ISBN: (纸本)9781424439027

The e-commerce information on the surface Web is supported by the Deep Web, which can not be accessed directly by the search engines or the Web crawlers. The only way to access the backend database is through query interface. Extracting valid attributes from the query forms and automatic translating the source query into a target query is a solvable way for addressing the current limitations in accessing Deep Web data sources. To generate a valid query, we have to reconcile the key attributes and their semantic relation. We present our framework to solve the problem. To enrich the set of attributes contained in the semantic form, we use the WordNet as kinds of ontology technique and we try to find the semantic relation of the attributes in the same query from and different forms. Extensive experiments over real-word domains show the utility of our query translation framework.

关键词： Ontologies databases Computer science educational institutions Search engines data mining Laboratories knowledge engineering Computer science education Crawlers

来源：评论

学校读者我要写书评

暂无评论

GRAID: A Green RAID Storage Architecture with Improved Energy Efficiency and Reliability

GRAID: A Green RAID Storage Architecture with Improved Energ...

引用

International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Bo Mao Dan Feng Hong Jiang Suzhen Wu Jianxi Chen Lingfang Zeng College of Computer Science and Technology Huazhong University of Science and Technology China Key Laboratory of Data Storage Systems Ministry of Education of China China Department of Computer Science & Engineering University of Nebraska Lincoln USA

Existing power-aware optimization schemes for disk-array systems tend to strike a delicate balance between energy consumption and performance while ignoring reliability. To achieve a reasonably good trade-off among these three important design objectives in this paper we introduce an energy efficient disk array architecture, called a Green RAID (or GRAID), which extends the data mirroring redundancy of RAID 10 by incorporating a dedicated log disk. The goal of GRAID is to significantly improve energy efficiency or reliability of existing RAID-based systems without noticeably sacrificing their reliability or energy efficiency. The main idea behind GRAID is to update the mirroring disks only periodically while storing all updates since the last mirror-disk update in a log disk, thus being able to spin down all the mirroring disks (or half of the total disks) most of the time to a lower power mode to save energy without sacrificing reliability. Reliability analysis shows that the reliability of GRAID, in terms of MTTDL (Mean Time To data Loss), is only slightly worse than RAID 10. On the other hand, our prototype implementation of GRAID and performance evaluation show that GRAID's energy efficiency is significantly better than that of RAID 10 by up to 32.1% and an average of 25.4%.

关键词： Energy storage Energy efficiency Power system reliability Costs Computer science educational technology Redundancy Energy consumption Cooling Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Indexing Future Trajectories of Moving Objects in a Constrained Network

引用

Journal of Computer Science & Technology 2007年第2期22卷 245-251页

作者：陈继东孟小峰 School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China

Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future trajectories of the objects. In this paper, we propose an original data access method, the ANR-tree, which supports predictive queries. We focus on real life environments, where the objects move within constrained networks, such as vehicles on roads. We introduce a simulation-based prediction model based on graphs of cellular automata, which makes full use of the network constraints and the stochastic traffic behavior. Our technique differs strongly from the linear prediction model, which has low prediction accuracy and requires frequent updates when applied to real traffic with velocity changing frequently. The data structure extends the R-tree with adaptive units which group neighbor objects moving in the similar moving patterns. The predicted movement of the adaptive unit is not given by a single trajectory, but instead by two trajectory bounds based on different assumptions on the traffic conditions and obtained from the simulation. Our experiments, carried on two different datasets, show that the ANR-tree is essentially one order of magnitude more efficient than the TPR-tree, and is much more scalable.

关键词： database spatial database access methods moving objects

来源：评论

学校读者我要写书评

暂无评论

A New Authentication Protocol for Wireless Communication Network Based on IEEE802.16

A New Authentication Protocol for Wireless Communication Net...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Ruixue Li Zhiyi Fang Wei Cao Yumei Yin Peng Xu College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China College of Information Technology Liaodong University Dandong China Changchun Institute of Optics Fine Mechanics and Physics Chinese Academy and Sciences Changchun China

After analyzing the specific security requirements of the wireless communication network based on IEEE802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol for wireless mobile environment was proposed and designed. Then, its security was analyzed from the angle of technical realization and formal analysis to verify whether the original safety goals were achieved. Especially, formal analysis was mostly done. Finally, system testing was also carried out and the results were analyzed to verify function and performance of the new protocol.

关键词： Authentication Wireless application protocol Wireless communication Communication system security Information security data security Safety Access protocols Clocks Synchronization

来源：评论

学校读者我要写书评

暂无评论

CLASCN： Candidate Network Selection for Efficient Top-κ keyword Queries over databases

引用

Journal of Computer Science & Technology 2007年第2期22卷 197-207页

作者：张俊彭朝晖王珊聂惠静 School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 China Computer Science and Technology College Dalian Maritime University Dalian 116026 China

keyword Search Over Relational databases （KSORD） enables casual or Web users easily access databases through free-form keyword queries. Improving the performance of KSORD systems is a critical issue in this area. In this paper, a new approach CLASCN （Classification, Learning And Selection of Candidate Network） is developed to efficiently perform top-κ keyword queries in schema-graph-based online KSORD systems. In this approach, the Candidate Networks （CNs） from trained keyword queries or executed user queries are classified and stored in the databases, and top-κ results from the CNs are learned for constructing CN Language Models （CNLMs）. The CNLMs are used to compute the similarity scores between a new user query and the CNs from the query. The CNs with relatively large similarity score, which are the most promising ones to produce top-κ results, will be selected and performed. Currently, CLASCN is only applicable for past queries and New All-keyword-Used （NAU） queries which are frequently submitted queries. Extensive experiments also show the efficiency and effectiveness of our CLASCN approach.

关键词： relational database keyword search top-κ query candidate network

来源：评论

学校读者我要写书评

暂无评论

Inference and learning in hybrid probabilistic network

引用

中国高等学校学术文摘·计算机科学 2007年第4期1卷 429-435页

作者： WANG Limin WANG Xuecheng LI Xiongfei Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China The Institute of Information Spreading Engineering Changchun University of TechnologyChangchun 130012China

This paper proposed a novel hybrid probabilistic network,which is a good tradeoff between the model complexity and learnability in *** relaxes the conditional independence assumptions of Naive Bayes while still permitting efficient inference and *** studies on a set of natural domains prove its clear advantages with respect to the generalization ability.

关键词： hybrid probabilistic network conditional independence assumption Bayesian network probabilistic neural network

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Clustering Algorithm for Mining Communities in Signed Networks

引用

Journal of Computer Science & Technology 2007年第2期22卷 320-328页

作者：杨博刘大有 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

Signed network is an important kind of complex network, which includes both positive relations and negative relations. Communities of a signed network are defined as the groups of vertices, within which positive relations are dense and between which negative relations are also dense. Being able to identify communities of signed networks is helpful for analysis of such networks. Hitherto many algorithms for detecting network communities have been developed. However, most of them are designed exclusively for the networks including only positive relations and are not suitable for signed networks. So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. In this paper, we propose a heuristic algorithm to address this issue. Compared with major existing methods, our approach has three distinct features. First, it is very fast with a roughly linear time with respect to network size. Second, it exhibits a good clustering capability and especially can work well with complex networks without well-defined community structures. Finally, it is insensitive to its built-in parameters and requires no prior knowledge.

关键词： complex network signed network community clustering graph theory

来源：评论

学校读者我要写书评

暂无评论

Recognizing the agent's goals incrementally:planning graph as a basis

引用

中国高等学校学术文摘·计算机科学 2007年第1期1卷 26-36页

作者： SUN Jigui YIN Minghao College of Computer Science Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Computer Science Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Computer Northeast Normal UniversityChangchun 130024China

Plan recognition,the inverse problem of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the problem of acquisition and hand-coding a larger plan *** paper is aims to show that modern planning techniques can help build plan recognition systems without suffering such ***,we show that the planning graph,which is an important component of the classical planning system Graphplan,can be used as an implicit,dynamic planning library to represent actions,plans and *** also show that modern plan generating technology can be used to find valid plans in this *** this sense,this method can be regarded as a bridge that connects these two research *** and theoretical results also show that the method is efficient and scalable.

关键词： Graphplan plan recognition constraints automated planning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm with local search for advanced planning and scheduling

Genetic algorithm with local search for advanced planning an...

引用

3rd International Conference on Natural Computation, ICNC 2007

作者： Pu, Yan Dayou, Liu Donghui, Yuan Ji, Yu Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)0769528759

In this paper, a genetic algorithm approach with a novel mutation operator based on perturbation and local search has been proposed to solve an advanced planning and scheduling (APS) model in manufacturing supply chain, in which each customer order has a due date, each operation could be performed on alternative machines. The objective is to minimize the makespan of each customer order while ensuring the due date constraints. Various sizes of numerical experiments were carried out to demonstrate the efficiency of the proposed GA and the results indicate that the presented algorithm performs much better than previous work especially in large size problems. © 2007 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：