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

TRANSDUCERS 2007 - 2007 International Solid-State Sensors, Actuators and Microsystems Conference, Volume 3 of 5

作者： P. Ruther S. Spinner M. Cornils O. Paul Microsystem Materials Laboratory Department of Microsystems Engineering (IMTEK) University of Freiburg Germany Computer Architecture Group Institute for Computer Science University of Freiburg Germany

The paper reports on a tactile force sensor for the dimensional metrology of deep narrow drillings. The sensor consists of an up to 7-mm-long cantilever with a width of 150 μm suspended by a thin silicon membrane hinge comprising an implanted piezoresistive stress sensor. The device is microstructured using deep reactive etching of single-crystal silicon. A quadratic p-well with four peripheral p{sup}+-contacts serves as stress sensor element. To investigate and improve the stress sensitivity of these elements, 90×90 μm{sup}2 p-wells comprising non-conducting islands of different sizes were implemented. In comparison to sensor elements without island, the introduction of a non-conducting region of 60×60 μm{sup}2 improves the sensitivity by 41% consistent with Finite Element simulations. Depending on the size of the island, force sensitivities between 7.74 mV/V/mN and 10.9 mV/V/mN were achieved.

关键词： Tactile sensor Piezoresistive force sensor Pseudo-Hall effect

来源：评论

学校读者我要写书评

暂无评论

REQUIREMENTS FOR AN EVENT-BASED SIMULATION PACKAGE FOR GRID SYSTEMS

引用

Journal of Interconnection Networks 2007年第2期8卷 163-178页

作者： FATOS XHAFA JAVIER CARRETERO LEONARD BAROLLI ARJAN DURRESI Polytechnic University of Catalonia Department of Languages and Informatics Systems C/Jordi Girona 1-3 08034 Barcelona Spain . Polytechnic University of Catalonia Department of Computer Architecture C/Jordi Girona 1-3 08034 Barcelona Spain Department of Information and Communication Engineering Fukuoka Institute of Technology (FIT) 3-30-1 Wajiro-higashi Higashi-ku Fukuoka 811-0295 Japan Department of Computer Science Louisiana State University 298 Coates Hall Baton Rouge LA 70803 USA

In this paper we present a study on the requirements for the design and implementation of simulation packages for Grid systems. Grids are emerging as new distributed computing systems whose main objective is to manage and allocate geographically distributed computing resources to applications and users in an efficient and transparent manner. Grid systems are at present very difficult and complex to use for experimental studies of large-scale distributed applications. Although the field of simulation of distributed computing systems is mature, recent developments in large-scale distributed systems are raising needs not present in the simulation of the traditional distributed systems. Motivated by this, we present in this work a set of basic requirements that any simulation package for Grid computing should offer. This set of functionalities is obtained after a careful review of most important existing Grid simulation packages and includes new requirements not considered in such simulation packages. Based on the identified set of requirements, a Grid simulator is developed and exemplified for the Grid scheduling problem.

关键词： Grid systems event-based simulation requirements scheduling

来源：评论

学校读者我要写书评

暂无评论

腰椎活动节段精确有限元模型的建立(英文)

引用

航天医学与医学工程 2007年第2期20卷 79-86页

作者：刘耀升陈其昕李方财唐小君方杰廖胜辉余世策浙江大学医学院附属第二医院骨科研究所浙江杭州310009 State Key Laboratory of CAD and CG Department of Computer Science and EngineeringZhejiang University Structural Engineering Institute College of Architecture EngineeringZhejiang University

目的采用一种新型CAD方法用CT资料精确建立腰椎L4-L5节段三维非线性有限元模型。方法用一种改良的“非种子区域分割方法”提取腰椎目标区域得到二值图像;再用反应腰椎曲度的“最佳切割平面”从初始表面模型获得非平行的切割轮廓线并建... 详细信息

目的采用一种新型CAD方法用CT资料精确建立腰椎L4-L5节段三维非线性有限元模型。方法用一种改良的“非种子区域分割方法”提取腰椎目标区域得到二值图像;再用反应腰椎曲度的“最佳切割平面”从初始表面模型获得非平行的切割轮廓线并建立“分段线性子空间”;后者经仿射变换到“规则子空间”后快速重构腰椎曲面,最后经逆变换恢复原三维空间的形状特征。将L4-L5节段表面模型所有结点的坐标数据和三角面片信息导入ANSYS进行网格划分。结果所构建的有限元模型包含L4-L5节段所有重要解剖结构,压缩、屈曲、伸直载荷下有限元模型的预测结果与实验生物力学结果相符合。结论包含先进算法的CAD技术实现了腰椎复杂几何模型的快速、精确建模。

关键词：生物力学腰椎有限元模型建模算法

来源：评论

学校读者我要写书评

暂无评论

Time synchronization improvement strategy for wireless sensor networks

引用

Jisuanji Xuebao/Chinese Journal of computers 2007年第4期30卷 514-523页

作者： Xu, Chao-Nong Zhao, Lei Xu, Yong-Jun Li, Xiao-Wei Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China School of Computer Science and Information Technology Hefei University of Technology Hefei 230009 China Graduate University Chinese Academy of Sciences Beijing 100039 China

Taking the similarity between NTP (Network Time Protocol) and time synchronization protocol in WSN (Wireless Sensor Networks) into consideration, the authors propose a strategy of introducing simplified algorithms in NTP such as clock filtering, clock selection and clock combining algorithm into WSN to improve synchronization precision. As a proof, a simplified clock combining algorithm in NTP is introduced into BTS(Broadcast Time Synchronization) protocol. Simulation result reveals that in a 8-hop network consist of 81 Mica2 sensor nodes, the synchronization error of every sensor node varies from 67.70% to 91.58% of that in BTS, except for some resister nodes whose synchronization errors keep unchanged. For all sensor nodes with same hop distance from the time beacon node, the ratio of their average synchronization error to hop distance switches from 19.8 to 15.5 μS per hop. Furthermore, these improvements cost no extra wireless transmissions. Theoretical analysis shows that these improvements are due to the decrease of the standard deviation of the node's time offset with the time beacon, which is the result of the applying time combination algorithm.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Annotating user-defined abstractions for optimization 20

Annotating user-defined abstractions for optimization

引用

20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006

作者： Quinlan, Dan Schordan, Markus Vuduc, Richard Yi, Qing Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94550 United States Institute of Computer Languages Vienna University of Technology Vienna Austria Dept. of Computer Science University of Texas at San Antonio San Antonio TX 78249 United States

ISBN: (纸本)1424400546

Although conventional compilers implement a wide range of optimization techniques, they frequently miss opportunities to optimize the use of abstractions, largely because they are not designed to recognize and use the relevant semantic information about such abstractions. In this position paper, we propose a set of annotations to help communicate high-level semantic information about abstractions to the compiler, thereby enabling the large body of traditional compiler optimizations to be applied to the use of those abstractions. Our annotations explicitly describe properties of abstractions that are needed to guarantee the applicability and profitability of a broad variety of such optimizations, including memoization, reordering, data layout transformations, and Mining and specialization. © 2006 IEEE.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Hunting Trojan Horses

Hunting Trojan Horses

引用

ASID'06: 1st Workshop on Architectural and System Support for Improving Software Dependability

作者： Moffie, Micha Cheng, Winnie Kaeli, David Zhao, Qin Computer Architecture Research Laboratory Northeastern University Boston MA 02115 United States Computer Science and Artificial Intelligence Lab. Massachusetts Institute of Technology Cambridge MA 02139 United States Singapore-MIT Alliance National University of Singapore Singapore 117576 Singapore

ISBN: (纸本)1595935762

HTH (Hunting Trojan Horses) is a security framework developed for detecting difficult types of intrusions. HTH is intended as a complement to anti-virus software in that it targets unknown and zero-day Trojan Horses and Backdoors. In order to accurately identify these types of attacks HTH utilizes runtime information available during execution. The information collected includes fine-grained information flow, program execution flow and resources *** this paper we present Harrier, an Application Security Monitor at the heart of our HTH framework. Harrier is an efficient run-time monitor that dynamically collects execution-related data. Harrier is capable of collecting information across different abstraction levels including architectural, system and library APIs. To date, Harrier is 3-4 times faster than comparable information flow tracking *** the collected information, Harrier allows for accurate identification of abnormal program behavior. Preliminary results show a good detection rate with a low rate of false positives. Copyright 2006 ACM.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Special Issue on Variable Structure System Control — New Designs and Applications

引用

Asian Journal of Control 2008年第4期5卷

作者： Prof. Jian-Xin Xu Prof. Leonid Fridman Department of Electrical and Computer Eng. National University of Singapore 4 Engineering Drive 3 Singapore 117576 Tel +65 6874-2566 Fax +65 6779-1103 Dr Jian-Xin Xu received his Bachelor degree from Zhejiang University China in 1982. He attended the University of Tokyo Japan where he received his Master's and Ph.D. degrees in 1986 and 1989 respectively. All his degrees are in Electrical Engineering. He worked for one year in the Hitachi research Laboratory Japan and for more than one year in Ohio State University U.S.A. as a Visiting Scholar. In 1991 he joined the National University of Singapore and is currently an associate professor in the Department of Electrical Engineering. His research interests lie in the fields of learning control variable structure control fuzzy logic control discontinuous signal processing and applications to motion control and process control problems. He is the associate editor of Asian Journal of Control member of TC on variable structure systems and sliding mode control of IEEE Control Systems Society and a senior member of IEEE. He has produced more than 90 peer-refereed journal papers near 160 technical papers in conference proceedings and authored/edited 4 books. Division de Estudios de Posgrado Facultad de Ingenieria National Autonomous University of Mexico DEP-FI UNAM Edificio “A” Circuito Exterior Ciudad Universitaria A. P. 70–256 C.P.04510 Mexico D.F. Mexico Tel +52 55 56223014 Fax +52 55 56161719 Dr. Leonid M. Fridman received his M.S in mathematics from Kuibyshev (Samara) State University Russia Ph.D. in Applied Mathematics from Institute of Control Science (Moscow) and Dr. of Science degrees in Control Science from Moscow State University of Mathematics and Electronics in 1976 1988 and 1998 respectively. In 1976–1999 Dr. Fridman was with the Department of Mathematics at the Samara State Architecture and Civil Engineering Academy Samara Russia. In 2000–2002 he was with the Department of Postgraduate Study and Investigations at the Chihuahu

来源：评论

学校读者我要写书评

暂无评论

An Efficient Pricing Based Protocol for Broadcasting in Wireless Ad hoc Networks

An Efficient Pricing Based Protocol for Broadcasting in Wire...

引用

International Conference on Communication Systems Software and Middleware (COMSWARE)

作者： N.R. Suri Y. Narahari D. Manjunath Department of Computer Science and Automation Indian Institute of Science Bangalore India Networks Architecture Laboratory Electrical and Communications Engineering Indian Institute of Science Bangalore India

In many applications of wireless ad hoc networks, wireless nodes are owned by rational and intelligent users. In this paper, we call nodes selfish if they are owned by independent users and their only objective is to maximize their individual goals. In such situations, it may not be possible to use the existing protocols for wireless ad hoc networks as these protocols assume that nodes follow the prescribed protocol without deviation. Stimulating cooperation among these nodes is an interesting and challenging problem. Providing incentives and pricing the transactions are well known approaches to stimulate cooperation. In this paper, we present a game theoretic framework for truthful broadcast protocol and strategy proof pricing mechanism called immediate predecessor node pricing mechanism (IPNPM). The phrase strategy proof here means that truth revelation of cost is a weakly dominant-strategy (in game theoretic terms) for each node. In order to steer our mechanism-design approach towards practical implementation, we compute the payments to nodes using a distributed algorithm. We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. The features of the proposed broadcast protocol are reliability and a significantly reduced number of packet forwards compared to the number of network nodes, which in turn leads to less system-wide power consumption to broadcast a single packet. Our simulation results show the efficacy of the proposed broadcast protocol

关键词： Pricing Wireless application protocol Broadcasting Mobile ad hoc networks Game theory Power system reliability Intelligent networks Costs Distributed computing Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Annotating user-defined abstractions for optimization 06

Annotating user-defined abstractions for optimization

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： D. Quinlan M. Schordan R. Vuduc Qing Yi Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA USA Institute of Computer Languages University of Technology Vienna Vienna Austria Department of Computer Science University of Texas San Antonio San Antonio TX USA

ISBN: (纸本)9781424400546

关键词： Optimizing compilers Design optimization Scientific computing Laboratories Profitability computer languages computer science Costs US Department of Energy Containers

来源：评论

学校读者我要写书评

暂无评论

A profile-based protein sequence alignment algorithm for a domain clustering database

A profile-based protein sequence alignment algorithm for a d...

引用

IEEE Symposium on Computational Intelligence and Bioinformatics and Computational Biology (CIBCB)

作者： Lin Xu Fa Zhang Zhiyong Liu Graduate School of Chinese Academy of Sciences China Key Laboratory of Computer System and architecture Institute of Computing Technology Chinese Academy and Sciences China National Natural Science Foundation China

Aiming at the two main shortcomings in Homology Modeling, we have designed and established a domain clustering database. Searching the database is a fundamental work for it. However, current alignment algorithms are mainly based on the sequences, ignoring the structure conservation in domain. This paper proposed a profile-based alignment which considers the structure information into the profile, based on the character of our domain database. We designed an experiment within the database. The results show that both the quality and sensitivity of our scheme are better than pure Smith-Waterman and sequence-based profile algorithms. We strongly believe that this work can help to improve the protein structure prediction

关键词： Protein sequence Clustering algorithms Databases Sequences Heuristic algorithms Laboratories computer architecture Algorithm design and analysis Computational efficiency Acceleration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：