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

Forward Gated-Diode Method for Extracting Gate Oxide Thickness and Body Doping Concentration

Forward Gated-Diode Method for Extracting Gate Oxide Thickne...

2010 10th IEEE International Conference on Solid-State and Integrated Circuit Technology(第十届固态和集成电路技术国际会议 ICSICT-2010)

作者： Xiufang Zhang Chenfei Zhang Chenyue Ma Frank He Zhiwei Liu The Key Laboratory of Integrated Microsystems School of Computer & Information Engineering Peking TSRC Institute of Microelectronics School of Electronic Engineering and Computer Science Peking U The Key Laboratory of Integrated Microsystems School of Computer & Information Engineering Peking Peking University Shenzhen SOC Key Laboratory PKU HKUST Shenzhen Institute W303 West Tower IER B

ISBN: (纸本)9781424457977

In this paper, the forward gated-diode method is used to extract the gate oxide thickness and doping concentration of MOS device simultaneously. The gate oxide thickness and body doping concentration are first extracted from the recombination-generation (RG) current, and then from the simulation result of ISE-Dessis. The results obtained from R-G method shows a good agreement with the simulation data.

关键词： simulated data gate oxide Simulation results METAL OXIDE SEMICONDUCTORS Doping in Sports doping (materials) Body Mindfulness

来源：评论

学校读者我要写书评

暂无评论

Basic frame of generalized evidence theory

引用

Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University 2010年第12期44卷 119-124页

作者： Deng, Yong Jiang, Wen Han, Deqiang College of Computer And Information Science Southwest University Chongqing 400715 China School of Electronics and Information Northwestern Polytechnical University Xi'an 710072 China Institute of Integrated Automation Xi'an Jiaotong University Xi'an 710049 China School of Electronic Information and Electrical Engineering Shanghai Jiaotong University Shanghai 200240 China

The basic assumption of classical Dempster-Shafer theory of evidence is that the frame of discernment is complete. However, the frame of discernment is often incomplete in real data fusion application systems. A generalized evidence theory (GET) is proposed to solve this problem in this paper. The generalized basic probability assignment (GBPA) is defined. The value assigned to the empty set shows the support degree to incomplete frame of discernment. A new combination rule, called generalized combination rule (GCR), is proposed to handle evidence combination. It is shown that the proposed combination rule satisfies both commutative law and associative law. Another desirable property of the proposed GET is that it will be reduced as the classical evidence theory when the GBPA to empty set is zero. Some numerical examples are used to show the efficiency of the proposed GET.

关键词： data fusion

来源：评论

学校读者我要写书评

暂无评论

Correction of field inhomogeneity effects on limited k-space MRSI data using anatomical constraints

Correction of field inhomogeneity effects on limited k-space...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： Xi Peng Hien Nguyen Justin Haldar Diego Hernando Xian-Pei Wang Zhi-Pei Liang School of Electronic Information Wuhan University of China Wuhan China Institute of Advanced Science and Technolohy University of Illinois Urbana-Champaign USA Department of Electrical and Computer Engineering and Backman Institute of Advanced Science and Technology University of Illinois Urbana-Champaign Urbana IL USA

Magnetic field inhomogeneity is a long-standing problem in magnetic resonance imaging (MRI) and spectroscopic imaging (MRSI). Specifically, in MRSI, field inhomogeneity, if not corrected, can cause frequency shifts, line broadening, and lineshape distortions in the spectral peaks. This paper addresses the problem of correcting the field inhomogeneity effects on limited k-space MRSI data. A penalized maximum-likelihood method is proposed, which enables the use of anatomical constraints for improving the correction performance with only limited k-space data. Simulation results are shown to demonstrate the effectiveness of the proposed method.

关键词： Nonhomogeneous media Magnetic resonance imaging Image reconstruction Encoding Spatial resolution Brain modeling

来源：评论

学校读者我要写书评

暂无评论

K-means based clustering on mobile usage for social network analysis purpose

K-means based clustering on mobile usage for social network ...

引用

International Conference on Advanced Information Management and Service

作者： Xu Yang Yapeng Wang Dan Wu Athen Ma MPI-QMUL Information Systems Research Centre Macao Polytechnic Institute Macao China International School Beijing University of Posts and Telecommunications Beijing China School of Electronic Engineering and Computer Science Queen''s Mary University of London London UK

The development of mobile network technology provides a great potential for social networking services. This paper studied data mining for social network analysis purpose, which aims at find people's social network patterns by analyzing the information about their mobile phone usage. In this research, the real database of MIT's Reality Mining project is employed. The classification model presented in this project provides a new approach to find the proximity between users - based on their registration frequencies to specific cellular towers associated their working places. K-means Algorithm is applied for clustering, and we find the result could achieve the highest accuracy 0.823 at the number groups k = 6. The clustering result successfully reflects the higher proximity (at work) for the intra-class subjects.

关键词： Poles and towers data mining Social network services Mobile communication Mobile handsets Classification algorithms Context

来源：评论

学校读者我要写书评

暂无评论

PoU based sharp features extraction from point cloud

PoU based sharp features extraction from point cloud

引用

International Conference on Mechanical and Electrical Technology (ICMET)

作者： Cao Juming Wushour Slam Liang Jin Liang Xinhe Zhang Dehai Liu Jianwei Yao Xinhui Department of computer science & technology Baoji University of Arts & Sciences Baoji China School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China Institute of Information & Mechatronics Research Xi'an Jiaotong University Xi'an China

Sharp features of 3D point clouds play an important role in many geometric computations and modeling application. In this paper, a novel modified Partition of Unity (PoU) Based Sharp feature extraction algorithm is proposed, which is directly operated on discrete point clouds. For every point in target point cloud, spherical neighborhood with radius δ is acquired with the help of KD-Tree and weighted average position of points within the δ-neighborhood is computed using modified PoU method. Distance which is the projection of the displace between original point and its Weighted average position along normal direction is defined as the criteria for a point belong to sharp feature or crease line. Experiments on both synthetic data and practical scanner point clouds indicate that our algorithm are both efficient and effective to the task of sharp feature extraction from point clouds. Our method is easy to be implemented and more sensitive to sharp features as well as its low computational complexity.

关键词： Complexity theory Computational modeling Educational institutions

来源：评论

学校读者我要写书评

暂无评论

KernelRank: Exploiting Semantic Linkage Kernels for Relevant Pages Finding

引用

电子学报(英文版) 2009年第3期18卷 405-410页

作者： WANG Yaowei SU Limin TIAN Yonghong Electrical Engineering Department Beijing Institute of Technology Beijing 100081 China Information School Beijing Union University Beijing 100100 China School of Electronic Engineering and Computer Science Peking University Beijing 100871 China

Relevant pages finding is to find a set of relevant pages that address the same topic as the given page. Hyperlink relationship is an important useful clue for this task. Some hyperlinks are useful, also some are irrelevant or noisy. Therefore, it is important to design efficient relevant pages finding methods that can work well in the real-world Web data. In this paper, we propose a relevant pages finding algorithm, KernelRank. This algorithm takes advantage of linkage kernels to reveal latent semantic relationships among pages and to identify relevant pages precisely and effectively. Experiments are conducted on WT10G and the results show that the KernelRank algorithm is feasible and effective.

关键词：网页地址语义连杆网络数据现实世界超链接算法页面

来源：评论

学校读者我要写书评

暂无评论

Open framework middleware for intelligent WSN topology adaption in smart buildings

Open framework middleware for intelligent WSN topology adapt...

引用

2009 International Conference on Ultra Modern Telecommunications and Workshops

作者： Brennan, Rob Tai, Wei O'Sullivan, Declan Aslam, Muhammad S. Rea, Susan Pesch, Dirk Knowledge and Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Ireland Centre for Adaptive Wireless Systems Department of Electronic Engineering Cork Institute of Technology Ireland

ISBN: (纸本)9781424439416

Modern smart buildings utilize sensor networks for facilities management applications such as energy monitoring. However as buildings become progressively more embedded with sensor networks, the challenge of managing and maintaining the sensor networks themselves becomes ever more significant. As a cost-sensitive activity, facilities management deployments are less likely to deploy node redundancy and specialized technical staff to maintain these networks. Hence there are strong requirements for the network to efficiently self-diagnose, self-heal and integrate with standard buildings management systems. This paper introduces a solution for WSN management in smart buildings that addresses these issues. It is based on the deployment of the Open Framework Middleware for sensor networks coupled with a structured knowledge and rule-based fault analysis engine to perform network event correlation and root cause analysis. The system also explicitly interfaces with a Building Management System (BMS) or the scheduling of network maintenance activities such as sensor battery replacement. ©2009 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

RFID information acquisition: An analysis and comparison between ONS and LDAP

RFID information acquisition: An analysis and comparison bet...

引用

1st International Conference on Information science and engineering, ICISE2009

作者： Zheng, Fangwei Huang, Jeffrey Zhang, Yuwei School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Computer and Communication Sciences Swiss Federal Institute of Technology in Lausanne Lausanne Switzerland School of Electronics and Engineering Beijing Jiaotong University Beijing China

ISBN: (纸本)9780769538877

RFID is regarded as a link between the virtual world and the real world, and it's a key problem to acquire RFID-related information effectively. EPCglobal proposed a service called ONS to solve this problem, but ONS has weakness in the granularity of resolving, data manageability, application flexibility and security. This paper gives detailed analysis of these weaknesses and introduced a new RFID information acquisition mechanism based on LDAP. Advantages of this new mechanism are also explored in this paper. ©2009 IEEE.

关键词： Radio frequency identification (RFID)

来源：评论

学校读者我要写书评

暂无评论

Study to multi-twin support vector machines and its applications in speaker recognition

Study to multi-twin support vector machines and its applicat...

引用

2009 International Conference on Computational Intelligence and Software engineering, CiSE 2009

作者： Wu, Zhendong Yang, Chengfu Institute of Computer Science Sichuan Normal University Chendu Sichuan 610066 China Computational Intelligence Laboratory School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China Sichuan University of Arts and Science Dazhou 635000 China

ISBN: (纸本)9781424445073

This paper proposed a new algorithm named multi-twin support vector machines (MTSVM). At the same time, its application in speaker recognition was studied. The MTSVM tried to find nonparallel plane for every class which the data in the same class are closer to, and the data in the other classes are as far as possible. The MTSVM is different from the normal one-to-all multi-class twin support vector machines (TSVM) where the constrains from other classes are distributed in one quadratic programming problem (QPP). However, in MTSVM, the constraint from every other class is acted on the QPP separately. The feasibility and validity of MTSVM in artificial data and Chains Corpus for speaker recognition are showed in a series of experiments.

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Knowledge reduction of covering approximation space

Knowledge reduction of covering approximation space

引用

作者： Hu, Jun Wang, Guoyin School of Electronic Engineering XiDian University Xi'an Shaanxi 710071 China Institute of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing 400065 China

ISBN: (纸本)3642020968

Knowledge reduction is a key issue in data mining. In order to simplify the covering approximation space and mining rules from it, Zhu proposed a reduction of covering approximation space which does not rely on any prior given concept or decision. Unfortunately, it could only reduce absolutely redundant knowledge. To reduce relatively redundant knowledge with respect to a given concept or decision, the problem of relative reduction is studied in this paper. The condition in which an element of a covering is relatively reducible is discussed. By deleting all relatively reducible elements of a covering approximation space, one can get the relative reduction of the original covering approximation space. Moreover, one can find that the covering lower and upper approximations in the reduced space are the same as in the original covering space. That is to say, it does not decrease the classification ability of a covering approximation space to reduce the relatively reducible elements in it. In addition, combining absolute reduction and relative reduction, an algorithm for knowledge reduction of covering approximation space is developed. It can reduce not only absolutely redundant knowledge, but also relatively redundant knowledge. It is significant for the following-up steps of data mining. © 2009 Springer Berlin Heidelberg.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：