Waleed K. Al-Assadi. Anura P. Jayasumana. Yashwant K. Malaiya y. February Colorado State University

Size: px
Start display at page:

Download "Waleed K. Al-Assadi. Anura P. Jayasumana. Yashwant K. Malaiya y. February Colorado State University"

Transcription

1 Dierential I DDQ Testable Static RAM Architecture Walee K. Al-Assai Anura P. Jayasumana Yashwant K. Malaiya y Technical Report CS February 1996 Department of Electrical Engineering/ y Department of Computer Science Colorao State University Fort Collins, CO 0523

2 Dierential I DDQ Testable Static RAM Architecture W. K. Al-Assai, A. P. Jayasumana, an Y. K. Malaiya y Electrical Engineering Department y Computer Science Department Colorao State University Fort Collins, CO 0523 Abstract A testable esign that enhances the I DDQ testability of ranom access memories (SRAMs) for o-line testing is propose. Increase accuracy an test spee can be achieve by memory array partitioning. Comaparision of I DDQ values from two blocks is performe uring parallel write/rea operations to memory locations of the two blocks. Simultaneous write/rea operations to all locations within physically interleave block can signicantly enhance the test spee as well as fault activation. 1 Introuction With the increasing complexity of semiconuctor memories, the nature of the failure moes have become more complex an subtle [1, 2]. Failure moes such as gate-oxie shorts, briging efects, parasitic transistor leakage, efective p-n junctions, an transistors with incorrect threshol voltages, o not aect the logical behavior. Such faults may pass the functional an logical testing, but may malfunction overtime, causing reliability hazars. Many of those faults cause elevate quiescentpower supply current(i DDQ ), whichistypically several orers of magnitue greater than the I DDQ of a fault-free evice. In static ranom-access memories (SRAMs), most of the I DDQ testable faults are activate uring the write/rea cycles [3, 4, 5, 6]. In [3], an analysis of the eectiveness of the I DDQ testing has been one using SRAM of K X -bit wors manufacture by Philips, using Inuctive Fault Analysis technique. The results show that a high fault coverage is achieve when I DDQ testing is performe in combination with functional testing. In [7], experimental results were reporte on eploying current testing to etect efects that cause ata retention This work was supporte partly by a BMDO fune project monitore by ONR.

3 problems. The iea of I DDQ testing is expane for fault localization in [6]. In [], a testable SRAM structure was propose for observing the internal switching behavior of the memory cells. The propose structure provies a high coverage of isturb-type pattern sensitive faults. In [4], the etaile fault moel of the 6-transistor memory cell was investigate for possible transistor level faults. It was shown that intra-cell efects can cause inter-cell faults in the memory array, such as coupling faults. Such faults were shown to cause elevate I DDQ when activate. In [5] a testable esign for memory array was shown to enhance I DDQ testing by allowing parallel access to the whole memory cells uring the write cycle. The above work clearly establishes the promise of I DDQ testing for SRAMs. However, it oes not establish testability requirements that can improve the eectiveness of current testing. In aition the above work oes not aress the problem of current measurements an the eects of the size of the circuit uner test on the accuracy an testing spee. In this paper, we propose a testable scheme for o-line testing that enhances the I DDQ testability for CMOS SRAMs. The propose scheme partitions the memory arrayinto ientical partitions each with its own operational groun noe (GND(O)). Quiescentpower supply currents can be monitore uring parallel access of locations or subset of locations (blocks) of each partition. Test spee is enhance by comparing currents in the two partitions using a built-in current comparator (BICC). This paper is an extension of the ierential concept propose in [9]. In that work, a testable esign for a wor-organize SRAM architecture, which is a special case of SRAMs, was presente. 2 Dierential I DDQ Testing of SRAMs The propose scheme is intene to minimize the impact of the conventional built-in current sensor (BICS) circuit on spee testing, by using a current comparator. The memory array is partitione physically into ientical partitions each with its own operational groun noe (GND(O)). The partitioning is one uring the esign phase. The number of partitions epen on the size of the memory array. In most SRAM architectures, bits are physically separate such that iniviual bits belonging to several logical wors may resie on a segment on the same chip, i.e. a segment i hols bit i of each wor. Hence a partition in Figure 1 may represent a segment or several segments of the same chip, connecte to a certain GND(O) noe. GND(O) noes are use uring normal operations, thus bypassing the current comparator. During the test moe, the GND(O) noes are open, an the test groun GND(T) noe (groun noe of the current comparators) will be the common groun noe for the circuit, i.e. the tester will consier GND(T) as the groun noe. Ientical partition sizes imply similar groun line capacitance values for each partition. A built-in current comparator (BICC) is use to compare the quiescent power supply

4 currents of two partitions uring the testing moe while accessing their locations simultaneously. A sensor similar to the Dierential BIC (D-BIC) propose in [10] may be use as the BICC. With the D-BIC, testing is performe in two phases. The circuit is partitione into two ientical parts CUT1 an CUT2. Test vectors are applie to CUT1 an the current is compare to a reference current value in one phase. Then in the secon phase, CUT2 is similarly teste. When using BICC, testing is performe in one phase, such that if the ierence between the currents of two partitions (e.g. ji1-i2j in Figure 1) excees a suitably chosen I th, the ag line is raise inicating a fault. If several BICCs are use, the ag signals can be connecte to an OR gate to generate apass/fail signal. If the ierence is less than I th, no fault is etecte. However, this may occur in case of faults riving similar currents in each partition. To overcome this problem, each partition can be ivie into blocks. A block is a subset of contiguous or interleave memory locations. Testing can be employe by simultaneously accessing two ientical blocks, each belonging to a separate partition. Reucing the size of the accesse array will allow the resolution to be maintaine. In aition, reucing the size of the partition will ensure that leakage currents will not a up to the point where they become comparable to the abnormal quiescent current expecte of a fault. Therefore the accuracy an testing spee is expecte to improve signicantly. VDD Chip bounary Partition 1 Partition 2 Partition (i-1) Partition (i) Block Block Block Block GND(O) I I I 1 2 i I i+1 GND(O) C Current Comparator C C Current Comparator C I th GND(T) Flag Flag GND(T) I th GND(O) GND(O) Pass/Fail GND(O): Operational Groun Noe GND(T): Test Groun Noe Figure 1: Principle of I DDQ comparison

5 3 Partitioning an Decoer Design In this section we propose a I DDQ testable esign for a SRAM architecture. Physical separation of the bits reuces the likelyhoo of an alpha particle erasing more than one bit of a logical wor, thus allowing eective single-bit error correction an enhances reliability. In this work we assume the the architecture shown in Figure 2. When the logical wor length is `' bits, the memory array is compose of `' of segments. Each segment hols one bit of each logical wor. A segment ecoer is require to route input ata to ierent segments. Data in 0 1 Data-in register Segment ecoer Bit rivers Bit rivers Bit rivers W 0 W1 Aress lines 0 1 bit 0 of all logical wors S 0 bit 1 of all logical wors bit of all logical wors S 1 S W p Decoer lines Bit rivers an sense amplifiers Output register Data out Figure 2: A SRAM Architecture ToachieveaI DDQ testable scheme with high test accuracy an spee with small harware overhea, esign moications are require to meet three basic goals [9]: 1 Ecient partitioning of memory array into ientical blocks of a reasonable size. 2 Block write/rea operations uring the testing moe to access locations within a block in each partition in parallel. 3 Ecient BICC circuit with high sensitivity an accurate I th selection. The rst an secon goals are achieve by certain moications to aress an segment ecoers, an memory array. Consier the memory array of K X -bit wors shown in Figure 3. This array is compose of eight segments. The three most signifacent bits (a 10,a 12 ) of the row register are use for the segments ecoer. The remaining bits (a 0, a 9 ) are use for the 1K aress ecoer.

6 Test signal (t) W/R Data-in register a a 0 1 a 12 a 11 a 10 3-to- ecoer segment ecoel A0 A1 A7 A0 A1 A7 t c t c tc Bit rives a 0 a 1 Block 0 Block 1 Block 2 Block 3 Aress register to- 1K ecoer bits 0 bits 1 bits bits bits bits bits bits bits a 10 a a S 0 S 1 S S 2 3 S 4 S 5 S 6 S 7 GND2(O) GND1(O) Figure 3: The I DDQ K X testable SRAM If we are assuming only one BICC is use, i.e. the array can only be partitione into two partitions, then two GND(O) noes are require. Segments are ivie equally among the GND(O) noes. Segments S 0, S 2, S 4, an S 6 are connecte to a one GND(O) noe an the other segments are connecte to the other GND(O) noe. However, epening on the size of the memory array, more than two partitions may be require. If four partitions are to be use, then two segments are connecte to a GND(O) noe (i.e. four GND(O) noes) an two BICCs are require. For the example uner consieration, let us assume two partitions. A test signal (t) is require such that uring normal operation moe t=0. During test moe when t=1, memory cells in both partitions are accesse simultaneously for

7 parallel write/rea operations. The segment ecoer is moie by aing the test signal (t). The write operation is performe when W=R signal is low. The most crucial issue is the aress ecoer moications that allow selective access to several physically contiguous or physically interleave memory locations simultaneously. The conventional aress ecoer is moie to allow two moes of operation, normal an testing. To achieve high test spee, the process of current comparisons is neee to be limite to a minimum number, which implies minimum number of comparan blocks neee (goal 1 above). For the example uner consieration, we assume that each of the 1K X cell segment can only be ivie into four blocks. In general it can be more than four blocks epening on the size of the memory array. During the normal operation moe (t=0), the ecoer works normally an is able to activate only one wor line for each write or rea operation. During the testing moe (t=1), the ecoer is able to activate one block of locations simulatenously. To achieve this moe of operation, the two least signicant bits a 0 an a 1 of the aress register, an the test signal (t) are use to perform block selection uring the testing moe as shown in Figure 3. Another test signal t c is require to perform state-coupling test. Moications to the bit rivers are shown in Figure 4. Bit rivers are moie such that when t c = 1, test vectors of interchangeably complemente bits like ( ) vector can be written to each physical wor. Consier Figure 4 for the write operation to segment 0. When t c = 1, ecoer output lines A 1, A 3, A 5, an A 7 are activating their corresponing bit rivers to allow complement of the input bit to be written to the corresponing memory cells of the segment. This applie for each segment. However, the ecoer works normally when t c =0. In the test moe, each partition contains four blocks. Physical locations of the four blocks are interleave with each other. The remaining higher orer bits are to select the locations within the block in the normal moe of operation. The operation is such that uring the testing moe, the AND gate that correspons to a combination of (a 0 ;a 1 ) is active,thus the corresponing 1K aress lines of the aress ecoer are active. These active lines of the aress ecoer are going to select 1K interleave wors (a block) in each partition. These two blocks are accesse simulatenously. The currents from both blocks are compare while parallel write/rea operations are performe into both blocks. From this esign shown in Figure 3, only one block is selecte from each partition for current comaparision.

8 Test signal (t) W/R a 10 a 11 a 12 Segment ecoer A 0 A1 0 Data-in 7 A 7 A 0 A 2 t c t c A1 A 7 Bit Bit Bit Bit Bit Bit Bit Bit Segment 0 Figure 4: Bit-rive Moications 4 Test Scheme Faults that enhance I DDQ are mainly transition faults, state coupling an briging faults, an neighborhoo pattern sensitive faults. To etect state coupling an briging faults, all states of two ajacent cells i an j in a segment shoul be consiere [11]. The testing sequence contains a set of parallel write/rea operations to the blocks, such that if a test vector v is applie to block i, then v is applie to block (i + 1). A minimal test sequence contains two patterns each of ( ) an ( ) test vectors. The proceure is to apply a pattern without activating t c signal. Then the same pattern is applie when t c is activate. For example, when t c is active an test vector ( ) is applie, then vector ( ) is written to the array. However, when vector ( ) is applie while t c is active, vector ( ) will be written to the array. This test sequence is capable of etecting stuck-at an a large fraction of state coupling an briging faults. For each test vector applie, four block write operations an four block rea operations are require as shown:

9 Write: block 0 ( ) Write: block 1 ( ) Write: block 2 ( ) Write: block 3 ( ) Rea : block 0 Rea : block 1 Rea : block 2 Rea : block 3 The above sequence is repeate for t c =1. Ift c is not use, it will take times as long to write a pattern like ( ) to a physical wor. Although neighborhoo pattern sensitive faults are consiere complex faults an require a series of write/rea operations into small sets of interleave locations, the sequence above is capable of etecting some of those faults. From above, it is clear that 16 parallel write/rea operations are require to test the SRAM for the faults assume. This scheme may not cover some non I DDQ testable failure moes which may nee to be consiere separately. Several of the well known SRAM testing algorithms have a complexity proportional to n, where n is the number of memory locations. With the testable scheme propose, the complexity of testing is proportional to b, where b is the number of blocks. Since b n, the testing process is speee-up proportional to (n/b). However the accuracy of testing epens also on the performance an sensitivity of the comparator BICS use for current monitoring. 5 Conclusions We have extene the ierential concept in [9] for a general I DDQ testable SRAM esign. The propose scheme employs memory array partitioning an parallel write/rea operations, uring which several faults are activate with elevate quiescent power supply current. The currents are compare in one phase for each opearion. This enhances the testability such that testing can be performe in a signicantly shorter time. A possible test sequence is presente. However, several questions remain unanswere in this area. For example, how to make optimal partitioning such that it will not a more harware overhea, an accoringly how to make the selection of the of the threshol current I th. References [1] C. A. Papachristou an N. B. Sahgal, \An Improve Metho for Detecting Functional Faults in Semiconuctor Ranom Access Memories," IEEE Trans. on Computers, vol. c-34, no. 2, pp , February 195.

10 [2] R. Rajsuman an K. Rajkanan, \An Architecture to Test Ranom Access Memories," Proc. 4th. Int'l. VLSI Design Conf., pp , Bangalore, Inia, January [3] R. Meershoek, B. Verhest, R. McInerney an L. Thijssen, \ Functional an I DDQ Testing on a Static RAM," Proc. Int'l Test Conf., pp , [4] W. K. Al-Assai, Y. K. Malaiya, an A. P. Jayasumana, \Moeling of Intra-Cell Defects in CMOS SRAM," Recors of the 1993 IEEE International Workshop on Memory Testing, pp. 7-1, August [5] H. Yokoyama, H. Tamamoto an Y. Narita, \A Current Testing for CMOS Static RAMs," Recors of the 1993 IEEE Int'l Workshop on Memory Testing, pp , August [6] C. Elm an D. Tavangarian, \Fault Detection an Fault Localization Using I DDQ -Testing in Parallel Testable FAST-SRAMs," Proc. IEEE VLSI Test Symp., pp , April [7] C. Kuo, T. Toms, B. T. Neel, J. Jelemensky, E. A. Carter, an P. Smith, \Soft-Defect Detection (SDD) Technique for a High-Reliability CMOS RAM," IEEE Journal of Soli- State Circuits, vol. 25, no.1, pp , February [] S. T. Su an R. Z. Makki, \Testing of Static Ranom Access Memories by Monitoring Dynamic Poer Supply Current," Journal of Electronic Testing: Theory an Applications, vol. 3, no. 3, August 1992, pp [9] W. K. Al-Assai, A. P. Jayasumana an. K. Malaiya, \ A Bipartite, Dierential I DDQ Testable Static RAM Design," Recors of the 1995 IEEE International Workshop on Memory Technology, Design an Testing, pp , August [10] A. D. Singh an J. P. Hurst, \Incorporating IDDQ Testing in BIST: Improve Coverage through Test Diversity," Proc. IEEE VLSI Test Symp., pp , April [11] R. Dekker, F. Beenker, an L. Thijssen, \A Realistic Fault Moel an Test Algorithms for Static Ranom Access Memories," IEEE Transaction on Computer-Aie Design, vol. 9, no.6, June 1990, pp

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER

EFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In

More information

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

More information

d 3 d 4 d d d d d d d d d d d 1 d d d d d d

d 3 d 4 d d d d d d d d d d d 1 d d d d d d Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching

More information

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

Chapter 9 Memory Management

Chapter 9 Memory Management Contents 1. Introuction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threas 6. CPU Scheuling 7. Process Synchronization 8. Dealocks 9. Memory Management 10.Virtual Memory

More information

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art

More information

Study of Network Optimization Method Based on ACL

Study of Network Optimization Method Based on ACL Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

6.823 Computer System Architecture. Problem Set #3 Spring 2002

6.823 Computer System Architecture. Problem Set #3 Spring 2002 6.823 Computer System Architecture Problem Set #3 Spring 2002 Stuents are strongly encourage to collaborate in groups of up to three people. A group shoul han in only one copy of the solution to the problem

More information

Indexing the Edges A simple and yet efficient approach to high-dimensional indexing

Indexing the Edges A simple and yet efficient approach to high-dimensional indexing Inexing the Eges A simple an yet efficient approach to high-imensional inexing Beng Chin Ooi Kian-Lee Tan Cui Yu Stephane Bressan Department of Computer Science National University of Singapore 3 Science

More information

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks

Architecture Design of Mobile Access Coordinated Wireless Sensor Networks Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,

More information

Politecnico di Torino. Porto Institutional Repository

Politecnico di Torino. Porto Institutional Repository Politecnico i Torino Porto Institutional Repository [Proceeing] Automatic March tests generation for multi-port SRAMs Original Citation: Benso A., Bosio A., i Carlo S., i Natale G., Prinetto P. (26). Automatic

More information

PART 2. Organization Of An Operating System

PART 2. Organization Of An Operating System PART 2 Organization Of An Operating System CS 503 - PART 2 1 2010 Services An OS Supplies Support for concurrent execution Facilities for process synchronization Inter-process communication mechanisms

More information

VLSI Test Technology and Reliability (ET4076)

VLSI Test Technology and Reliability (ET4076) VLSI Test Technology and Reliability (ET4076) Lecture 8(2) I DDQ Current Testing (Chapter 13) Said Hamdioui Computer Engineering Lab Delft University of Technology 2009-2010 1 Learning aims Describe the

More information

Very Large Scale Integration (VLSI)

Very Large Scale Integration (VLSI) Very Large Scale Integration (VLSI) Lecture 10 Dr. Ahmed H. Madian Ah_madian@hotmail.com Dr. Ahmed H. Madian-VLSI 1 Content Manufacturing Defects Wafer defects Chip defects Board defects system defects

More information

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,

More information

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks 01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University

More information

CordEx. >> Operating instructions. English

CordEx. >> Operating instructions. English CorEx >> Operating instructions English Symbols use in this manual Important information concerning your safety is specifically marke. Follow these instructions closely to prevent accients an amage to

More information

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao

More information

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose

More information

Image Segmentation using K-means clustering and Thresholding

Image Segmentation using K-means clustering and Thresholding Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,

More information

A Framework for Dialogue Detection in Movies

A Framework for Dialogue Detection in Movies A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki

More information

Overview. Operating Systems I. Simple Memory Management. Simple Memory Management. Multiprocessing w/fixed Partitions.

Overview. Operating Systems I. Simple Memory Management. Simple Memory Management. Multiprocessing w/fixed Partitions. Overview Operating Systems I Management Provie Services processes files Manage Devices processor memory isk Simple Management One process in memory, using it all each program nees I/O rivers until 96 I/O

More information

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite

More information

Optimal Clustering and Statistical Identification of Defective ICs using I DDQ Testing

Optimal Clustering and Statistical Identification of Defective ICs using I DDQ Testing Optimal Clustering and Statistical Identification of Defective ICs using I DDQ Testing A. Rao +, A.P. Jayasumana * and Y.K. Malaiya* *Colorado State University, Fort Collins, CO 8523 + PalmChip Corporation,

More information

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency

Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science

More information

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2

Intensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2 This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar

More information

N-Model Tests for VLSI Circuits

N-Model Tests for VLSI Circuits 40th Southeastern Symposium on System Theory University of New Orleans New Orleans, LA, USA, March 16-18, 2008 MC3.6 N-Model Tests for VLSI Circuits Nitin Yogi and Vishwani D. Agrawal Auburn University,

More information

Comparison of Methods for Increasing the Performance of a DUA Computation

Comparison of Methods for Increasing the Performance of a DUA Computation Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,

More information

Analysis of half-space range search using the k-d search skip list. Here we analyse the expected time for half-space

Analysis of half-space range search using the k-d search skip list. Here we analyse the expected time for half-space Analysis of half-space range search using the k- search skip list Mario A. Lopez Brafor G. Nickerson y 1 Abstract We analyse the average cost of half-space range reporting for the k- search skip list.

More information

Impact of cache interferences on usual numerical dense loop. nests. O. Temam C. Fricker W. Jalby. University of Leiden INRIA University of Versailles

Impact of cache interferences on usual numerical dense loop. nests. O. Temam C. Fricker W. Jalby. University of Leiden INRIA University of Versailles Impact of cache interferences on usual numerical ense loop nests O. Temam C. Fricker W. Jalby University of Leien INRIA University of Versailles Niels Bohrweg 1 Domaine e Voluceau MASI 2333 CA Leien 78153

More information

Fast Fractal Image Compression using PSO Based Optimization Techniques

Fast Fractal Image Compression using PSO Based Optimization Techniques Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting

More information

Test and Testability Techniques for Open Defects in RAM Address Decoders

Test and Testability Techniques for Open Defects in RAM Address Decoders Test and Testability Techniques for Open Defects in RM ddress Decoders Manoj Sachdev WY 4.1; Philips Research Laboratories, Prof. Holst laan 4; 5656 Eindhoven; The Netherlands; email: sachdev@natlab.research.philips.com

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

IMPLEMENTATION OF A FAST MPEG-2 COMPLIANT HUFFMAN DECODER

IMPLEMENTATION OF A FAST MPEG-2 COMPLIANT HUFFMAN DECODER IMPLEMENTATION OF A FAST MPEG-2 COMPLIANT HUFFMAN ECOER Mikael Karlsson Rudberg (mikaelr@isy.liu.se) and Lars Wanhammar (larsw@isy.liu.se) epartment of Electrical Engineering, Linköping University, S-581

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mit.eu 6.854J / 18.415J Avance Algorithms Fall 2008 For inormation about citing these materials or our Terms o Use, visit: http://ocw.mit.eu/terms. 18.415/6.854 Avance Algorithms

More information

Robust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks

Robust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,

More information

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract

William S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract Optimization Methos for Calculating Design Imprecision y William S. Law Eri K. Antonsson Engineering Design Research Laboratory Division of Engineering an Applie Science California Institute of Technology

More information

Coupling the User Interfaces of a Multiuser Program

Coupling the User Interfaces of a Multiuser Program Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces

More information

Department of Computer Science, POSTECH, Pohang , Korea. (x 0 (t); y 0 (t)) 6= (0; 0) and N(t) is well dened on the

Department of Computer Science, POSTECH, Pohang , Korea. (x 0 (t); y 0 (t)) 6= (0; 0) and N(t) is well dened on the Comparing Oset Curve Approximation Methos Gershon er +, In-Kwon, an Myung-Soo Kim + Department of Computer Science, Technion, IIT, Haifa 32000, Israel Department of Computer Science, POSTECH, Pohang 790-784,

More information

APPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly

APPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -

More information

Improving Spatial Reuse of IEEE Based Ad Hoc Networks

Improving Spatial Reuse of IEEE Based Ad Hoc Networks mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos

More information

I DT MC. Operating Manual SINAMICS S120. Verification of Performance Level e in accordance with EN ISO

I DT MC. Operating Manual SINAMICS S120. Verification of Performance Level e in accordance with EN ISO I DT MC Operating Manual SINAMICS S20 Verification of Performance Level e in accorance with EN ISO 3849- Document Project Status: release Organization: I DT MC Baseline:.2 Location: Erl. F80 Date: 24.09.2009

More information

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:

More information

Supporting Fully Adaptive Routing in InfiniBand Networks

Supporting Fully Adaptive Routing in InfiniBand Networks XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar

More information

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,

More information

Modeling and Simulation of Microcode-based Built-In Self Test for Multi-Operation Memory Test Algorithms

Modeling and Simulation of Microcode-based Built-In Self Test for Multi-Operation Memory Test Algorithms IJCSI International Journal of Computer Science Issues, Vol. 7, Issue 3,. 2, May 2010 36 Modeling and Simulation of Microcode-based Built-In Self Test for Multi-Operation Memory Test Algorithms Dr. R.K.

More information

Characterizing Decoding Robustness under Parametric Channel Uncertainty

Characterizing Decoding Robustness under Parametric Channel Uncertainty Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric

More information

filtering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember

filtering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember 107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,

More information

Online Testing of Word-oriented RAMs by an Accumulator-based Compaction Scheme in Symmetric Transparent Built-In Self Test (BIST)

Online Testing of Word-oriented RAMs by an Accumulator-based Compaction Scheme in Symmetric Transparent Built-In Self Test (BIST) Online Testing of Word-oriented RAMs by an Accumulator-based Compaction Scheme in Symmetric Transparent Built-In Self Test (BIST) Sharvani Yedulapuram #1, Chakradhar Adupa *2 # Electronics and Communication

More information

A Plane Tracker for AEC-automation Applications

A Plane Tracker for AEC-automation Applications A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)

More information

Message Transport With The User Datagram Protocol

Message Transport With The User Datagram Protocol Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer

More information

Estimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction

Estimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction c 2000 SPIE. Personal use of this material is permitte. However, permission to reprint/republish this material for avertising or promotional purposes or for creating new collective works for resale or

More information

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu

More information

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural

More information

Parts Assembly by Throwing Manipulation with a One-Joint Arm

Parts Assembly by Throwing Manipulation with a One-Joint Arm 21 IEEE/RSJ International Conference on Intelligent Robots an Systems, Taipei, Taiwan, October, 21. Parts Assembly by Throwing Manipulation with a One-Joint Arm Hieyuki Miyashita, Tasuku Yamawaki an Masahito

More information

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT

More information

A Duality Based Approach for Realtime TV-L 1 Optical Flow

A Duality Based Approach for Realtime TV-L 1 Optical Flow A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos

More information

RAM Testing Algorithms for Detection Multiple Linked Faults

RAM Testing Algorithms for Detection Multiple Linked Faults RAM Testing Algorithms for Detection Multiple Linked Faults V.G. Mikitjuk, V.N. Yarmolik, A.J. van de Goor* Belorussian State Univ. of Informatics and Radioelectronics, P.Brovki 6, Minsk, Belarus *Delft

More information

Low Power Cache Design. Angel Chen Joe Gambino

Low Power Cache Design. Angel Chen Joe Gambino Low Power Cache Design Angel Chen Joe Gambino Agenda Why is low power important? How does cache contribute to the power consumption of a processor? What are some design challenges for low power caches?

More information

Design Management Using Dynamically Defined Flows

Design Management Using Dynamically Defined Flows Design Management Using Dynamically Deine Flows Peter R. Sutton*, Jay B. Brockman** an Stephen W. Director* *Department o Electrical an Computer Engineering, Carnegie Mellon University, Pittsburgh, PA

More information

Improving Performance of Sparse Matrix-Vector Multiplication

Improving Performance of Sparse Matrix-Vector Multiplication Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign

More information

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

More information

A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity

A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity Worl Applie Sciences Journal 16 (10): 1387-1392, 2012 ISSN 1818-4952 IDOSI Publications, 2012 A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Base on Gravity Aliasghar Rahmani Hosseinabai,

More information

Design of Policy-Aware Differentially Private Algorithms

Design of Policy-Aware Differentially Private Algorithms Design of Policy-Aware Differentially Private Algorithms Samuel Haney Due University Durham, NC, USA shaney@cs.ue.eu Ashwin Machanavajjhala Due University Durham, NC, USA ashwin@cs.ue.eu Bolin Ding Microsoft

More information

FX3U-CAN USER'S MANUAL

FX3U-CAN USER'S MANUAL FX3U-CAN USER'S MANUAL Safety Precautions (Rea these precautions before use.) Before installation, operation, maintenance or inspection of this prouct, thoroughly rea through an unerstan this manual an

More information

Frequency Domain Parameter Estimation of a Synchronous Generator Using Bi-objective Genetic Algorithms

Frequency Domain Parameter Estimation of a Synchronous Generator Using Bi-objective Genetic Algorithms Proceeings of the 7th WSEAS International Conference on Simulation, Moelling an Optimization, Beijing, China, September 15-17, 2007 429 Frequenc Domain Parameter Estimation of a Snchronous Generator Using

More information

When Clusters Meet Partitions: Dennis J.-H. Huang and Andrew B. Kahng. UCLA Computer Science Department, Los Angeles, CA USA

When Clusters Meet Partitions: Dennis J.-H. Huang and Andrew B. Kahng. UCLA Computer Science Department, Los Angeles, CA USA When Clusters Meet Partitions: New Density-Base Methos for Circuit Decomposition Dennis J.-H. Huang an Anrew B. Kahng UCLA Computer Science Department, Los Angeles, CA 90024-596 USA jenhsin@cs.ucla.eu,

More information

SE-330 SERIES (NEW REVISION) IEC INTERFACE

SE-330 SERIES (NEW REVISION) IEC INTERFACE Tel: +1-800-832-3873 E-mail: techline@littelfuse.com www.littelfuse.com/se-330 SE-330 SERIES (NEW REVISION) IEC 61850 INTERFACE Revision 0-C-121117 Copyright 2018 Littelfuse Startco Lt. All rights reserve.

More information

Wireless Sensing and Structural Control Strategies

Wireless Sensing and Structural Control Strategies Wireless Sensing an Structural Control Strategies Kincho H. Law 1, Anrew Swartz 2, Jerome P. Lynch 3, Yang Wang 4 1 Dept. of Civil an Env. Engineering, Stanfor University, Stanfor, CA 94305, USA 2 Dept.

More information

HOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM

HOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM HOW O SECURTY TECHNOLOGES NTERACT WTH EACH OTHER TO CREATE VALUE? THE ANALYSS O REWALL AN NTRUSON ETECTON SYSTEM Huseyin CAVUSOGLU Srinivasan RAGHUNATHAN Hasan CAVUSOGLU Tulane University University of

More information

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract

The Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie

More information

Binning of Devices with X-IDDQ

Binning of Devices with X-IDDQ Binning of Devices with X-IDDQ Prasanna M. Ramakrishna Masters Thesis Graduate Committee Dr. Anura P. Jayasumana Adviser Dr. Yashwant K. Malaiya Co-Adviser Dr. Steven C. Reising Member Dept. of Electrical

More information

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control

Almost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract

More information

FX3U-CAN USER'S MANUAL

FX3U-CAN USER'S MANUAL FX3U-CAN USER'S MANUAL Safety Precautions (Rea these precautions before use.) Before installation, operation, maintenance or inspection of this prouct, thoroughly rea through an unerstan this manual an

More information

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization 1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24

More information

Driving Toward Higher I DDQ Test Quality for Sequential Circuits: A Generalized Fault Model and Its ATPG

Driving Toward Higher I DDQ Test Quality for Sequential Circuits: A Generalized Fault Model and Its ATPG Driving Toward Higher I DDQ Test Quality for Sequential Circuits: A Generalized Fault Model and Its ATPG Hisashi Kondo Kwang-Ting Cheng y Kawasaki Steel Corp., LSI Division Electrical and Computer Engineering

More information

Algorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times

Algorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times Algorithm for Intermoal Optimal Multiestination Tour with Dynamic Travel Times Neema Nassir, Alireza Khani, Mark Hickman, an Hyunsoo Noh This paper presents an efficient algorithm that fins the intermoal

More information

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks 0 0 0 0 0 0 0 0 on-uniform Sensor Deployment in Mobile Wireless Sensor etworks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University Boca Raton,

More information

ACE: And/Or-parallel Copying-based Execution of Logic Programs

ACE: And/Or-parallel Copying-based Execution of Logic Programs ACE: An/Or-parallel Copying-base Execution of Logic Programs Gopal GuptaJ Manuel Hermenegilo* Enrico PontelliJ an Vítor Santos Costa' Abstract In this paper we present a novel execution moel for parallel

More information

Appearance Sensing distance Output configuration Operation mode Model. Appearance Sensing distance Output configuration Operation mode Model

Appearance Sensing distance Output configuration Operation mode Model. Appearance Sensing distance Output configuration Operation mode Model Spatter-resistant Proximity Sensor EEQ CSM_EEQ_DS_E Spatter-resistant Fluororesincoate Proximity Sensor Superior spatter resistance. Long Sensing-istance s ae for sensing istances up to mm. DC -Wire s.

More information

On the Placement of Internet Taps in Wireless Neighborhood Networks

On the Placement of Internet Taps in Wireless Neighborhood Networks 1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that

More information

Fault Simulation with Parallel Critical Path Tracing for Combinational Circuits Using Structurally Synthesized BDDs

Fault Simulation with Parallel Critical Path Tracing for Combinational Circuits Using Structurally Synthesized BDDs Fault Simulation with Parallel Critical Path Tracing for Combinational Circuits Using Structurall Snthesize BDDs Sergei Devaze, Jaan Rai, Artur Jutman, Raimun Ubar Tallinn Universit of Technolog, Estonia

More information

A Formal Model and Efficient Traversal Algorithm for Generating Testbenches for Verification of IEEE Standard Floating Point Division

A Formal Model and Efficient Traversal Algorithm for Generating Testbenches for Verification of IEEE Standard Floating Point Division A Formal Moel an Efficient Traversal Algorithm for Generating Testbenches for Verification of IEEE Stanar Floating Point Division Davi W. Matula, Lee D. McFearin Department of Computer Science an Engineering

More information

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks

EDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks sensors Article EDOVE: Energy an Depth Variance-Base Opportunistic Voi Avoiance Scheme for Unerwater Acoustic Sensor Networks Safar Hussain Bouk 1, *, Sye Hassan Ahme 2, Kyung-Joon Park 1 an Yongsoon Eun

More information

E2EM-X4X1 2M *2 E2EM-X4X2 2M Shielded E2EM-X8X1 2M *2 E2EM-X8X2 2M *1 M30 15 mm E2EM-X15X1 2M *2 E2EM-X15X2 2M

E2EM-X4X1 2M *2 E2EM-X4X2 2M Shielded E2EM-X8X1 2M *2 E2EM-X8X2 2M *1 M30 15 mm E2EM-X15X1 2M *2 E2EM-X15X2 2M Long-istance Proximity Sensor EEM CSM_EEM_DS_E_7_ Long-istance Proximity Sensor Long-istance etection at up to mm enables secure mounting with reuce problems ue to workpiece collisions. No polarity for

More information

Animated Surface Pasting

Animated Surface Pasting Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

P. Fua and Y. G. Leclerc. SRI International. 333 Ravenswood Avenue, Menlo Park, CA

P. Fua and Y. G. Leclerc. SRI International. 333 Ravenswood Avenue, Menlo Park, CA Moel Driven Ege Detection P. Fua an Y. G. Leclerc SI International 333 avenswoo Avenue, Menlo Park, CA 9425 (fua@ai.sri.com leclerc@ai.sri.com) Machine Vision an Applications, 3, 199 Abstract Stanar ege

More information

Rough Set Approach for Classification of Breast Cancer Mammogram Images

Rough Set Approach for Classification of Breast Cancer Mammogram Images Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems

More information

Improving Memory Repair by Selective Row Partitioning

Improving Memory Repair by Selective Row Partitioning 200 24th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems Improving Memory Repair by Selective Row Partitioning Muhammad Tauseef Rab, Asad Amin Bawa, and Nur A. Touba Computer

More information

Accelerating the Single Cluster PHD Filter with a GPU Implementation

Accelerating the Single Cluster PHD Filter with a GPU Implementation Accelerating the Single Cluster PHD Filter with a GPU Implementation Chee Sing Lee, José Franco, Jérémie Houssineau, Daniel Clar Abstract The SC-PHD filter is an algorithm which was esigne to solve a class

More information

TESTING OF FAULTS IN VLSI CIRCUITS USING ONLINE BIST TECHNIQUE BASED ON WINDOW OF VECTORS

TESTING OF FAULTS IN VLSI CIRCUITS USING ONLINE BIST TECHNIQUE BASED ON WINDOW OF VECTORS TESTING OF FAULTS IN VLSI CIRCUITS USING ONLINE BIST TECHNIQUE BASED ON WINDOW OF VECTORS Navaneetha Velammal M. 1, Nirmal Kumar P. 2 and Getzie Prija A. 1 1 Department of Electronics and Communications

More information

An Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach

An Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach An Energy Efficient Routing for Wireless Sensor Networks: Hierarchical Approach Nishi Sharma, Vanna Verma Abstract Wireless sensor networks (WSNs) is one of the emerging fiel of research in recent era

More information

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations

More information

Learning Polynomial Functions. by Feature Construction

Learning Polynomial Functions. by Feature Construction I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate

More information

The Journal of Systems and Software

The Journal of Systems and Software The Journal of Systems an Software 83 (010) 1864 187 Contents lists available at ScienceDirect The Journal of Systems an Software journal homepage: www.elsevier.com/locate/jss Embeing capacity raising

More information

Disjoint Multipath Routing in Dual Homing Networks using Colored Trees

Disjoint Multipath Routing in Dual Homing Networks using Colored Trees Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,

More information