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 hin...
详细信息
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.
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...
详细信息
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.
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 ...
详细信息
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.
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...
详细信息
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 a...
详细信息
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.
作者:
Prof. Jian-Xin XuProf. Leonid FridmanDepartment 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
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 ...
详细信息
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
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...
详细信息
ISBN:
(纸本)9781424400546
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 inlining and specialization
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 m...
详细信息
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
暂无评论