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

3rd Electronics System Integration Technology Conference, ESTC 2010

作者： Han, Younggun Koganemaru, Masaaki Ikeda, Toru Miyazaki, Noriyuki Choi, Woon Tomokage, Hajime Knowledge Cluster Initiative Researcher Fukuoka Science and Technology Foundation 3-8-33 Momochihama Sawara-ku Fukuoka 814-0001 Japan Mechanics and Electronics Research Institute Fukuoka Industrial Technology Center 3-6-1 Norimatsu Yahatanishi-ku Kitakyushu 807-0831 Japan Department of Mechanical Engineering and Science Graduate School of Engineering Kyoto University Yoshida-Honmachi Sakyo-ku Kyoto 606-8501 Japan Department of Electronics Engineering and Computer Science Fukuoka University 8-19-1 Nanakuma Jonan-ku Fukuoka 814-0189 Japan

ISBN: (纸本)9781424485536

The effects of uniaxial mechanical stress on the radio frequency (RF) performance of n- and p-metal-oxide-semiconductor field effect transistors (MOSFETs) fabricated on (100) Si wafer are investigated up to 10 GHz. Uniaxial mechanical stress is applied to the MOSFETs parallel to the direction of drain current flow using a four-point bending fixture. Under tensile stress, the gate transconductance (gm) increases in the n-MOSFETs while it decreases in the p-MOSFETs, whereas the results were vice versa for compressive stress. These tendencies are same to the effects of uniaxial mechanical stress on direct current (DC) transconductance of the MOSFETs, therefore, it is considered that the gm with RF is dependent on stress-induced sub-band splitting of Si. The total gate capacitance (CG) extracted from scattering parameters increases (decreases) under tensile (compressive) stress for both n- and p-MOSFETs, which is explained by the variation of the effective mass perpendicular to the Si/SiO2 interface. The cut-off frequencies (fT) estimated from the gm and the CG varies in inverse proportion to the gate capacitance variation.

关键词： MOSFET devices

来源：评论

学校读者我要写书评

暂无评论

A Multi-heuristic Cooperative Ant Colony System for Optimizing Elimination Ordering of Bayesian Networks

A Multi-heuristic Cooperative Ant Colony System for Optimizi...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Xuchu Dong Dantong Ouyang Yuxin Ye Haihong Yu Yonggang Zhang Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun Jilin China

To solve the problem of searching for an optimal elimination ordering of Bayesian networks, a novel effective heuristic, MinSum Weight, and an ACS approach incorporated with multi-heuristic mechanism are proposed. The ACS approach named MHC-ACS utilizes a set of heuristics to direct the ants moving in the search space. The cooperation of multiple heuristics helps ants explore more regions. Moreover, the most appropriate heuristic will be identified and be reinforced with the evolution of the whole system. Experiments demonstrate that MHC-ACS has a better performance than other swarm intelligence methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Describing the semantic relation of the deep web query interfaces using ontology extended LAV

Journal of Software

引用

Journal of Software 2010年第1期5卷 89-98页

作者： Liang, Hao Zuo, Wan-Li Ren, Fei Department of Computer Science and Technology Jilin University Jilin Changchun China Department of Information Changchun Taxation College Jilin Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun China

The key element in a Deep Web information fusion system is the data source modeling problem, which is the determinant technical factor 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 lower generality and ability of local as view (LAV) method in the traditional information fusion system. An approach of extracting attributes and semantic relationships from the interfaces utilizing Ontology is present in this paper, and WordNet is introduced as an Ontology instrument. The semantic relationships between semantic related attributes are evaluated by the WordNet. The meaningless attributes are instantiated by instance information embedded in the interfaces. A semantic matrix is generated and used to evaluate the semantic related groups in the specific domains. The expression ability of LAV is extended by the mapping and matching mechanism based on the semantic related groups. The experiment is carried out on the famous dataset, and the results show the efficiency of Ontology extended LAV of building mappings between local schemas and mediator schema. © 2010 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Global Top-k Aggregate Queries Based on X-tuple in Uncertain Database

Global Top-k Aggregate Queries Based on X-tuple in Uncertain...

引用

International Conference on Advanced Information Networking and Applications Workshops (AINAW)

作者： Dexi Liu Changxuan Wan Naixue Xiong Jong Hyuk Park Sang-Soo Yeoe School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA USA Department of Computer Science and Engineering Seoul National University of Technology Seoul South Korea Division of Computer Engineering Mokwon University Daejeon South Korea

ISBN: (纸本)9781424467013;9780769540191

A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.

关键词： Aggregates Databases knowledge engineering Query processing computer networks Power engineering computing Data engineering Power engineering and energy Dynamic programming Radar imaging

来源：评论

学校读者我要写书评

暂无评论

Performance study on logging to another main memory database

Performance study on logging to another main memory database

引用

International Conference on New Trends in Information and Service science, NISS

作者： Xiongpai Qin Xiaoyun Zhou Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China Department of Computer Science and Technology Xuzhou Normal University Jiangsu 221008 China

In update intensive main memory database applications, huge volume of log records is generated, to maintain the ACID properties of the database system, the log records should be persistent efficiently. Delegating logging of one main memory database to another main memory database is proposed. The scheme is elaborated in detail in terms of architecture, logging & safeness levels, checkpointing, and recovery. Strict durability and relax durability are provided. When some form of non-volatile memory is used to temporarily holding log records, not only logging efficiency is improved, but also the scheme could guarantee full ACID of the system. We also propose using parallel logging to speedup log persistence by writing logs to multiple disks in parallel. Since interconnection network techniques progress by leaps and bounds, the scheme eliminates the concern about whether the system's overall performance may be slowed down by bandwidth and latency limitations. Experiment results demonstrate the feasibility of the proposal.

关键词： Checkpointing Database systems Transaction databases Network servers Availability Nonvolatile memory Writing Communication industry Defense industry Wood industry

来源：评论

学校读者我要写书评

暂无评论

Two Novel Semantics of Top-k Queries Processing in Uncertain Database

Two Novel Semantics of Top-k Queries Processing in Uncertain...

引用

International Conference on computer and Information Technology (CIT)

作者： Dexi Liu Changxuan Wan N. Xiong Laurence T. Yang Lei Chen School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA USA Department of Computer Science Saint Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong China

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Top-k queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this x-tuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain x-kRanks queries (U-x-kRanks) and Global x-Top-k queries (G-x-Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.

关键词： Semantics Upper bound Heuristic algorithms Query processing Equations Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Multi-language Ontology-Based Search Engine

Multi-language Ontology-Based Search Engine

引用

International Conference on Advances in computer-Human Interaction

作者： Leyla Zhuhadar Olfa Nasraoui Robert Wyatt Elizabeth Romero Knowledge Discovery and Web Mining Laboratory Department of Computer Engineering and Computer Science University of Louisville KY USA The Office of Distance Learning Division of Extended Learning and Outreach Western Kentucky University KY USA

ISBN: (纸本)9781424456932;9780769539577

One of the first Multi-Language Information Retrieval (MLIR) systems was implemented in 1969 by Gerard Salton who enhanced his SMART system to retrieve multilingual documents in two languages, English and German. However, the research field of MLIR is still struggling since the majority of information retrieval systems are monolingual and more precisely English-based, even though only 6% of the world's population native language have as English [14]. This paper presents a Multi-Language Information Retrieval (MLIR) approach that falls into the area of Domain Specific Information Retrieval (E-learning being the domain). The approach we followed is a synergistic approach between (1) Thesaurus-based Approach and (2) Corpus-based Approach. This research has been implemented on a real platform called HyperManyMedia 1 at Western Kentucky University.

关键词： Ontologies Search engines Information retrieval Natural languages Electronic learning System testing Web mining knowledge engineering computer science computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

MMIR: Mining Multi-scale Intervention Rules in Sub-Complex System

MMIR: Mining Multi-scale Intervention Rules in Sub-Complex S...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Zheng Jiaoling Tang Changjie Qiao Shaojie Yang Ning Wang Yue Chen Yu Zhu Jun Department of Software Engineering Chengdu University of Information and Technology Chengdu China Institute of Database and Knowledge Engineering School of Computer Science Sichuan University Chengdu China School of Information Science and Technology Southwest Jiaotong University Chengdu China

Intervention analysis is the common method to reveal relationships between objects in human as well as biological society. Data mining research community is just starting to pay attention to intervention analysis. As the traditional association rules are not successful at measuring intervention, this paper tries to mining intervention rules from time series data of sub-complex system. The main contributions of this study include: (1) introduces a new concept of intervention rules. It can quantitatively detect at what scale, how intensive and how long the intervention does make sense; (2) conduct wavelet transform on time series. The decomposition scale can denotes the intervention scale; (3) proposes a new concept named directional correlation to measure intervention intensity; (4) calculates the intervention intensity between time series data with different time delays. The time delay can uncover after how long the intervention takes place; (5) conducts experiments on real datasets. The results show that intervention rules do exist at different decomposition scale of the original data. Moreover, the number of rules discovered by multi-scale analyzing methods is always 4 or 5 times more than those found by single scale methods. And the stability of rules discovered by the improved multi-scale mining algorithm MMIR* is always 100%, while the stability of rules discovered by the basic multi-scale mining algorithm MMIR fluctuate around 70%.

关键词： Heart rate Data mining Delay effects Stability Frequency Association rules Time measurement Control systems Databases knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

SPARQL2XQuery 2.0: Supporting Semantic-based queries over XML data

SPARQL2XQuery 2.0: Supporting Semantic-based queries over XM...

引用

International Workshop on Semantic Media Adaptation and Personalization (SMAP)

作者： Ioannis Stavrakantonakis Chrisa Tsinaraki Nikos Bikakis Nektarios Gioldasis Stavros Christodoulakis MUSIC/TUC Technical University of Crete Greece Department of Information Engineering and Computer Science University of Trento Italy Knowledge and Database Systems Laboratory National and Technical University of Athens Greece

The dominant standards in multimedia content and service description, namely the MPEG-7 and the MPEG-21, have been expressed in XML Schema syntax. In addition, ontologies that capture the semantics of these standards have been developed using the semantic web languages. Since different communities in the industry and the academia work and are familiar with the Semantic Web environment or the XML environment, a Schema mapping framework and a Query mapping framework are needed that will allow querying multimedia content and service descriptions in a uniform way in both the XML and Semantic Web environments. We present in this paper SPARQL2XQuery 2.0, a framework that allows expressing semantic queries on top of XML data through the translation of SPARQL queries in XQuery syntax. SPARQL2XQuery 2.0 may work with both existing ontologies and with automatically produced ones, formed according to our XS2-OWL 2.0 transformation model. XS2-OWL 2.0 exploits the OWL 2.0 semantics and supports the new XML constructs introduced by XML Schema 1.1.

关键词： XML Ontologies OWL Syntactics Semantics Resource description framework

来源：评论

学校读者我要写书评

暂无评论

Semantic Subspace Learning with conditional significance vectors

Semantic Subspace Learning with conditional significance vec...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Nandita Tripathi Stefan Wermter Chihli Hung Michael Oakes Department of Computing Engineering and Technology University of Sunderland Sunderland UK Institute for Knowledge Technology Department of Computer Science University of Hamburg Hamburg Germany Department of Information Management Chung Yuan Christian University Chungli Taiwan

Subspace detection and processing is receiving more attention nowadays as a method to speed up search and reduce processing overload. Subspace Learning algorithms try to detect low dimensional subspaces in the data which minimize the intra-class separation while maximizing the inter-class separation. In this paper we present a novel technique using the maximum significance value to detect a semantic subspace. We further modify the document vector using conditional significance to represent the subspace. This enhances the distinction between classes within the subspace. We compare our method against TFIDF with PCA and show that it consistently outperforms the baseline with a large margin when tested with a wide variety of learning algorithms. Our results show that the combination of subspace detection and conditional significance vectors improves subspace learning.

关键词： Classification algorithms Semantics Training Support vector machine classification Principal component analysis Prediction algorithms Testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：