Computing the weights of criteria with interval-valued fuzzy sets for MCDM problems Chen-Tung Chen 1, Kuan-Hung Lin 2, Hui-Ling Cheng 3

Size: px
Start display at page:

Download "Computing the weights of criteria with interval-valued fuzzy sets for MCDM problems Chen-Tung Chen 1, Kuan-Hung Lin 2, Hui-Ling Cheng 3"

Transcription

1 Compting the weights of criteria with interval-valed fzzy sets for MCDM problems Chen-ng Chen Kan-Hng in 2 Hi-ing Cheng 3 Department of Information Management National nited niversity aiwan 2 Specialist 2 Qanta Compter Inc 2 en Hwa 2nd Road Keishan aoyan aiwan 3 Coege of General Edcation Hng Kang niversity aiwan Abstract In the real world many inflenced factors or criteria shold be considered in the mltiple criteria decisionmaking (MCDM) process Face to the ncertain environment the decision makers or experts always cannot express their opinions exactly in the decision-making process nder this sitation interval-valed fzzy sets are sitable sed to represent the sbective dgments of decision makers In this paper the fzzy AHP method is applied to compte the fzzy weights of each criterion based on the interval-valed fzzy sets he proposed method can provide a more flexible way for decision makers to express their sbective opinions A systematic method is presented here to compte the fzzy weights of criteria for dealing with a MCDM problem An example is presented to istrate the comptational procedre of the proposed method Conclsions and ftre research direction wi be discssed at the end of this paper Keywords MCDM Interval-valed fzzy set Fzzy AHP I INRODCION Decision making is one of the most complex administrative processes in management area (Ashtiani et al 2009) In some sitations becase of time pressre lack of knowledge and the decision maker s limited attention and information processing capabilities (X 2006) the decision maker cannot make the optimal decision easily In fact both qalitative and qantitative criteria shold be considered simltaneosly (Erol and Ferre Jr 2003) in the decision making process It cas mltiple criteria decision making (MCDM) process Saaty (980) proposed analytic hierarchy process (AHP) method for determining the weights of criteria in a MCDM problem by a hierarchical strctre and systematization According to the pairwise comparison reslt the weight of each criterion can be compted for a hierarchical problem strctre De to the sbective dgments of the decision makers are often ncertain in determining the pairwise comparisons the fzzy AHP are proposed to overcome the drawback (Bckley 985; Bckley et al 200) he fzzy AHP aowed the experts to se fzzy ratios in place of exact ratios to make the pairwise comparisons Based on the concepts there are varios fzzy AHP methods have been developed sch as the geometric mean method (Bckley 985) the ambda-max method (Cstora and Bckley 200) fzzy logarithmic least sqares method (ang et al 2006) the linear goal programming method (Jng 20) and the logarithmic fzzy preference programming method (Rezaei et al 203) However it is often difficlt for experts to exactly qantify their opinions as a crisp nmber in decision making process herefore the reasonable way is to represent the degree of certainty by an interval (Ashtiani et al 2009; Vahdani et al 200) he membership vale express as an interval vale can more fit the real world sitations Interval-valed fzzy nmbers have been applied in many fields sch as R&D leader selection (Ashtiani et al 2009) risk analysis (ei and Chen 2009) enterprise partner selection (Ye 200) traditional spplier selection (Chen 20) bs enterprise performance evalation (Ko and iang 202) etc herefore interval-valed fzzy sets are sitable sed to represent the fzziness of membership vale of sbective opinions In this paper a novel method is proposed by combining interval-valed fzzy set with fzzy AHP to determine the fzzy weights of each criterion he organization of this paper is described as foows In section 2 we wi present some notations of basic definitions and operators sch as trianglar fzzy nmber α-ct of fzzy nmber defzzified method and interval valed fzzy sets he proposed method wi be discssed at the section 3 For istrating the proposed method clearly an example wi be implemented Finay the conclsion and ftre research are smmarized at the end of this paper II 2 rianglar fzzy nmber FZZY NMBERS AND INGISIC VARIABES rianglar fzzy nmber (FN) can be defined as l m ) where l m hen l > 0 then is a positive FN Page 5

2 (PFN) (Zimmerman 99; Chen 2000) he membership fnction of positive FN can be defined as foow x l l x m m l x ( x) m x () m 0 otherwis he α-ct is sed to transform a fzzy set into crisp interval (Zimmerman 99) he α-ct can define as foow [( m l) l ( m) ] 0 (2) In a short it can be represented as [ l ] If is a trianglar fzzy nmber the area measrement method can be defined as (Yager 98) I( ) ( I ( ) I ( ))/ 2 (3) R where the I ( ) represents the area bonded by the left-shape fnction of the area inclde the x-axis the y-axis the horizontal line α= and the line ( x) he I R ( ) represents the area bonded by the right-shape fnction the area inclde the x-axis the y-axis the horizontal line by α= and the line R ( x) 22 Interval-valed fzzy set he definition of interval-valed fzzy set can be described as foow (Ashtiani et al 2009; Chen 202) {( x[ ( x) ( x)])} : X [0] x X (4) Yao and in (2002) presented the interval-valed trianglar fzzy nmber [ ] [( m ; )( l m ; )] (shown as Fig ) where the membership and the denotes the lower limit degree of membership and the denotes the pper limit degree of ( x) 0 l m FIG INERVA-VAED RIANGAR FZZY NMBER In order to express the fzziness more exactly Ashtiani et al (2009) and Vahdani et al (200) sed trianglar intervalvaled fzzy nmbers to represent the opinions of decision-makers In many cases an expert cannot exactly express the opinion by a crisp membership vale nder this sitation the interval-valed fzzy nmber can express the ncertain opinion as an interval vale he membership vale of x can be extended as [ ( x) ( x)] In this paper we sppose that the lower limit degree of membership and pper limit degree of membership at m are eqal to It represents a normal interval-valed trianglar fzzy nmber (IFVNs) Page 52

3 Assme that there are two interval-valed trianglar fzzy nmbers and 2 where ([ ] [ ] and 2 ([ 2 l2] m2[ 2 2] the arithmetic operations can be calclated as foows (Ko and iang 202) 2 ([ 2 l2] m2[ 2 2]) (5) 2 ([ 2 2] m2[ l2 2]) (6) 2 ([ 2 l2] m2[ 2 2]) (7) 2 ([ 2 2] m2[ l2 2]) (8) III PROPOSED MEHOD Based on interval-valed fzzy sets the ambda-max method (Cstora and Bckley 200) is applied to compte the fzzy weight of each criterion he comptational procedre is shown as foows Step Establish hierarchical strctre Establish a hierarchical framework of decision-making problem ithin the hierarchical framework there may contain several criterion and sb-criterion Step 2 he expert ses the interval-valed lingistic variable to make the pairwise comparison in the criteria and sb-criteria levels Step 3 sing interval-valed fzzy AHP the weights of criteria and sb-criteria can be compted and expressed as intervalvaled fzzy nmbers he comptational procedre of calclation steps as foow ) Constrct the fzzy positive reciprocal matrix he experts are aowed to se interval-valed fzzy ratios (see able ) in place of exact ratios he i i can now be interval-valed fzzy nmbers in any positive reciprocal matrix he fzzy positive reciprocal matrix is defined as [ i ] nn where i i i i 2 n If i ([ l] m[ ]) then ([ ] m [ l i ]) ABE INGISIC VARIABE FOR IMPORANCE Symbol ingistic variables Interval-vale fzzy nmber Extremely Eqal Importance ([] []) Eqal Importance ([] [23]) Intermediate vales ([] 2 [34]) eak Importance ([2] 3 [45]) Intermediate vales ([23] 4 [56]) Essential Importance ([34] 5 [67]) Intermediate vales ([45] 6 [78]) Very Strong Importance ([56] 7 [89]) Intermediate vales ([67] 8 [99]) Absolte Importance ([78] 9 [99]) i Page 53

4 2) Compte the interval-valed fzzy weights of criteria According to the ambda-max method (Cstora and Bckley 200) a seqence of fzzy positive reciprocal matrix is applied to determine the relative weights of each criterion he procedre of a calclation steps as foow a et α = sing α-ct to obtain m t im nn matrix and determine the fzzy weight b et α = 0 sing α-ct to obtain the n n it represent the decision-makers give the crisp positive reciprocal for i 2 n m 0 t i m im 0 t i nn 0 t i nn and 0 l t il n n accordance with the fzzy positive reciprocal matrix Next compting the fzzy weights l and where i l il i and i i 2 n c In order to make sre the fzzy weights are sti normal fzzy sets the foowing formla is sed to adst these im weights First we can determine lower bonds trianglar fzzy weights as Ql min{ i n} and Q im max{ i n} i il in he constants Q l and Q are sed to calclate the new weight as il Q l il and i Q i Second we se the new fzzy weight of lower limit and pper limit to determine the pper bonds trianglar fzzy weights il i as Q min{ i n} and Q max{ i n} i hen the constants and i Q i Q and i Q are sed to determine the new pper bonds trianglar fzzy weights as i Q i i l il i i Finay we can get the new fzzy weights [ ] [ ] [ ] and [ ] for i=2 n d o integrate l m and i i il im i i we can obtain the positive trianglar fzzy weight matrix for decisionmakers he fzzy weights of i-th criterion can be represented as ([ ] [ ]) e Defzzy the interval-valed fzzy weights Applying the area measrement method (Yager 98) to transfer the interval-valed fzzy nmber into interval vale as min max [ ] where represents the interval weight of criterion the lower limit of the interval and max min 2 m represents the pper limit of the interval 4 2 m l represents the 4 3) Repeating the process of step (B) the weights of sb-criteria can be compted with respect to each criterion IV NMERICA EXAMPE Sppose that a company desires to select an information system to serve their cstomer A committee of three decisionmakers (or experts) (p p 2 p 3 ) has been formed to evalate the importance of each criterion After the reviewing by the committee three criteria and nine sb-criteria (C C 2 C 33 ) are considered to select the sitable vendor he comptation process of proposed method is shown as foows Step According to the description the hierarchical strctre of problem is shown as Fig2 Step 2 Each expert ses the interval-vale lingistic variables to make the pairwise comparisons among criteria as able 2 Page 54

5 Sitable vendor Cost C Secrity C 2 Software C Hareware C 2 abor C 3 Control C 2 Privacy C 22 Reliability C 23 Operatio n C 3 Scalability C 3 Interoperability C 32 Performance C 33 P P 2 P 3 FIG 2 HE EVAAION SRCRE ABE 2 PAIRISE COMPARISONS OF HREE EXPERS C C 2 C 3 C C 2 C 3 C 2 C 22 C 23 C 3 C 32 C 33 C C - - C 2 - C 3 - C C 2 - C C 32 C 3 - C 3 C 23 C C C 2 C 3 C C 2 C 3 C 2 C 22 C 23 C 3 C 32 C 33 C C - - C 2 - C 3 C 2 - C 2 - C 22 C 32 - C C 3 C C C C 2 C 3 C C 2 C 3 C 2 C 22 C 23 C 3 C 32 C 33 C - - C C 2 C C 2 - C 2 - C 22 - C 32 - C 3 C C C 33 Step 3 Compte the interval-valed fzzy weights of criteria i he fzzy positive reciprocal matrix is shown as able 2 ii According to the fzzy reciprocal matrix for three criteria the criteria weights of the expert P can be compted as foows 2 4 () et α = sing α-ct to obtain m / 2 and determine the fzzy weight as m [ ] / 4 (2) et α = 0 sing α-ct to obtain the positive reciprocal matrix as / / / 4 / 3 / l / 3 / 2 / 5 6 Next we can compte the fzzy weights of each matrix as 0 [ ] l 0 [ ] 0 [ ] 0 [ ] (3) In order to make sre the weights are sti normal fzzy sets first we adst lower bonds trianglar fzzy weights and find the constants Q l =0849 and Q =056 And then obtain the new weights l [ ] and Page 55

6 [ ] Next we adst pper bonds trianglar fzzy weights and find the constants Q =0763 and Q =236 hen obtain the new weights [ ] and [ ] l (4) o combine the weight matrix [ ] [ ] we can obtain the interval-valed fzzy weight of expert P for three criteria as ([ ]0584[ ]) m 2 ([084084]084[ ]) 3 ([044073]0232[ ]) (5) Integrate the interval-valed fzzy weights of three experts; the area measrement method is applied to transform the interval-valed fzzy set into interval vale he weights of criteria can be compted as =[ ] 2=[ ] and 3 =[ ] iii he comptational procedres of sb-criteria weights are istrated as step B and the reslt can be shown as able 3 ABE 3 HE EIGHS OF SB-CRIERIA Sb-criteria eights Sb-criteria eights Sb-criteria eights C [ ] C 2 [ ] C 3 [ ] C 2 [ ] C 22 [ ] C 32 [ ] C 3 [ ] C 23 [ ] C 33 [ ] V CONCSIONS AND FRE RESEARCH In general many qantitative and qalitative factors wi inflence the expert to make a decision in the decision-making process nder this sitation decision makers always difficlt to express their opinions by the membership vale exactly herefore the interval-valed fzzy sets are sitable to express the sbective opinion of each decision maker in a decision environment In this paper the fzzy AHP method is extended to compte the fzzy weights of a criteria based on the interval-vale fzzy sets Applying the proposed method a systematic way is presented here to compte the fzzy weights of criteria In the ftre a decision analysis system wi be designed and developed based on this proposed method to redce the comptational time and improve the decision-making qality ACKNOEDGEMEN his work was spported partiay by Ministry of Science and echnology aiwan he proect No is MOS H MY2 REFERENCES [] B Ashtiani F Haghighirad A Maki and G A Montazer Extension of fzzy OPSIS method based on interval-valed fzzy sets Applied Soft Compting Vol pp [2] J J Bckley Fzzy hierarchical analysis Fzzy Sets and Systems Vo7 985 pp [3] J JBckley Fering and Y Hayashi Fzzy hierarchical analysis revisited Fzzy Sets and Systems Vo pp [4] C Chen Extensions of the OPSIS for grop decision-making nder fzzy environment Fzzy sets and systems Vo4 No 2000 pp-9 [5] Y Chen Optimistic and pessimistic decision making with dissonance redction sing interval-valed fzzy sets Information Sciences Vo8 No3 20 pp [6] Y Chen Comparative analysis of SA and OPSIS based on interval-valed fzzy sets: Discssions on score fnctions and weight constraints Expert Systems with Applications Vol39 No2 202 pp [7] R Cstora and J J Bckley Fzzy hierarchical analysis: the ambda-max method Fzzy Sets and Systems Vo pp8-95 [8] I Erol and Jr G Ferre A methodology for selection problems with mltiple conflicting obectives and both qalitative and qantitative criteria International Jornal of Prodction Economics Vol86 No pp87-99 [9] H Jng A fzzy AHP GP approach for integrated prodction-planning considering manfactring partners Expert systems with Applications Vol38 No5 20 pp Page 56

7 [0] M S Ko and G S iang A soft compting method of performance evalation with MCDM based on interval-valed fzzy nmbers Applied Soft Compting Vo2 No 202 pp [] J Rezaei R Ortt and V Scholten An improved fzzy preference programming to evalate entreprenership orientation Applied Soft Compting Vo3 No5 203 pp [2] Saaty he Analytic Hierarchy Process New York: McGraw-Hi 980 [3] B VahdaniH Hadipor J S Sadaghiani and M Amiri Extension of VIKOR method based on interval-valed fzzy sets he International Jornal of Advanced Manfactring echnology Vol47 No pp [4] Y M ang Elhag and Z Ha A modified fzzy logarithmic least sqares method for fzzy analytic hierarchy process Fzzy Sets and Systems Vo57 No pp [5] Z S X Indced ncertain lingistic OA operators applied to grop decision making Information Fsion Vol pp [6] R R Yager A procedre for ordering fzzy sbsets of the nit interval Information Sciences Vol24 98 pp43-6 [7] J S Yao and F in Constrcting a fzzy flow-shop seqencing model based on statistical data International Jornal of Approximate Reasoning Vol pp [8] F Ye An extended OPSIS method with interval-valed intitionistic fzzy nmbers for virtal enterprise partner selection Expert Systems with Applications Vol37 No0 200 pp [9] H J Zimmerman Fzzy Set heory and its Applications Boston: Klwer Academic Pblishers 99 Page 57

COMPOSITION OF STABLE SET POLYHEDRA

COMPOSITION OF STABLE SET POLYHEDRA COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining

More information

An Optimization of Granular Network by Evolutionary Methods

An Optimization of Granular Network by Evolutionary Methods An Optimization of Granlar Networ by Evoltionary Methods YUN-HEE HAN, KEUN-CHANG KWAK* Dept. of Control, Instrmentation, and Robot Engineering Chosn University 375 Seos-dong, Dong-g, Gwangj, 50-759 Soth

More information

Uncertainty Determination for Dimensional Measurements with Computed Tomography

Uncertainty Determination for Dimensional Measurements with Computed Tomography Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association

More information

Minimal Edge Addition for Network Controllability

Minimal Edge Addition for Network Controllability This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,

More information

Real-time mean-shift based tracker for thermal vision systems

Real-time mean-shift based tracker for thermal vision systems 9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University

More information

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands

More information

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing 1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity

More information

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search

More information

IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION

IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra

More information

EEC 483 Computer Organization

EEC 483 Computer Organization EEC 483 Compter Organization Chapter 4.4 A Simple Implementation Scheme Chans Y The Big Pictre The Five Classic Components of a Compter Processor Control emory Inpt path Otpt path & Control 2 path and

More information

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX

More information

Prof. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:

Prof. Kozyrakis. 1. (10 points) Consider the following fragment of Java code: EE8 Winter 25 Homework #2 Soltions De Thrsday, Feb 2, 5 P. ( points) Consider the following fragment of Java code: for (i=; i

More information

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in

More information

Switched state-feedback controllers with multi-estimators for MIMO systems

Switched state-feedback controllers with multi-estimators for MIMO systems Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November - 6 89 witched state-feedback controllers with mlti-estimators for MIMO sstems LIBOR

More information

Image Compression Compression Fundamentals

Image Compression Compression Fundamentals Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers

More information

Compound Catadioptric Stereo Sensor for Omnidirectional Object Detection

Compound Catadioptric Stereo Sensor for Omnidirectional Object Detection Compond Catadioptric Stereo Sensor for mnidirectional bject Detection Ryske Sagawa Naoki Krita Tomio Echigo Yasshi Yagi The Institte of Scientific and Indstrial Research, saka University 8-1 Mihogaoka,

More information

Constructing and Comparing User Mobility Profiles for Location-based Services

Constructing and Comparing User Mobility Profiles for Location-based Services Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,

More information

Advanced Techniques for Predicting Mechanical Product Design via COMSOL Multiphysics

Advanced Techniques for Predicting Mechanical Product Design via COMSOL Multiphysics Advanced Techniqes for Predicting Mechanical Prodct Design via COMSOL Mltiphsics Shobing Zhang 1 1 CAEaid, Inc. *Corresponding athor: 184 Jeffs Ln, Astin, TX 78717, shobing.hang@caeaid.com Abstract: Mechanical

More information

Evaluating Influence Diagrams

Evaluating Influence Diagrams Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will

More information

Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications

Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,

More information

Networks An introduction to microcomputer networking concepts

Networks An introduction to microcomputer networking concepts Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES

More information

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining

More information

The extra single-cycle adders

The extra single-cycle adders lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since

More information

Object Pose from a Single Image

Object Pose from a Single Image Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the

More information

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN:

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: 1137-3601 revista@aepia.org Asociación Española para la Inteligencia Artificial España Zaballos, Lis J.; Henning, Gabriela

More information

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition

More information

Computer-Aided Mechanical Design Using Configuration Spaces

Computer-Aided Mechanical Design Using Configuration Spaces Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)

More information

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,

More information

SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization

SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng

More information

A choice relation framework for supporting category-partition test case generation

A choice relation framework for supporting category-partition test case generation Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593

More information

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali

More information

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna

More information

PROGRAM LICENSE AGREEMENT LIMITED WARRANTY... 4 Trademarks Contents Preface... 11

PROGRAM LICENSE AGREEMENT LIMITED WARRANTY... 4 Trademarks Contents Preface... 11 . Contents PROGRAM LICENSE AGREEMENT... LIMITED WARRANTY... 4 Trademarks... 6. Contents... 8 Preface... 2. Overview... 3 2. Jst one other important thing... 3 2.2 Abot the ser manal... 4 2.3 Manal System

More information

Method to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot

Method to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,

More information

Vessel Tracking for Retina Images Based on Fuzzy Ant Colony Algorithm

Vessel Tracking for Retina Images Based on Fuzzy Ant Colony Algorithm Vessel Tracking for Retina Images Based on Fzzy Ant Colony Algorithm Sina Hooshyar a, Rasol Khayati b and Reza Rezai c a,b,c Department of Biomedical Engineering, Engineering Faclty, Shahed University,

More information

A sufficient condition for spiral cone beam long object imaging via backprojection

A sufficient condition for spiral cone beam long object imaging via backprojection A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral

More information

A coordination method for fuzzy multi-objective optimization of system reliability

A coordination method for fuzzy multi-objective optimization of system reliability Jornal o Intelligent & Fzzy Systems 16 (2005 213 220 213 IOS Press A coordination method or zzy mlti-obective optimization o system reliability Hong-Zhong Hang a,, Wei-Dong W b and Chn-Sheng Li b a School

More information

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions Towards Understanding Bilevel Mlti-objective Optimization with Deterministic Lower Level Decisions Ankr Sinha Ankr.Sinha@aalto.fi Department of Information and Service Economy, Aalto University School

More information

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies

More information

ASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES

ASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES ASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES Workgrop Metrology of CNRS research network 2519 a MCIMS, Presented by Larent Robert and Jean-José Orte b a http://www.ifma.fr/lami/gdr2519/ b CROMeP,

More information

Date: December 5, 1999 Dist'n: T1E1.4

Date: December 5, 1999 Dist'n: T1E1.4 12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:

More information

REDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION

REDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION REDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION Jdith Redi, Paolo Gastaldo, Rodolfo Znino, and Ingrid Heyndericx (+) University of Genoa, DIBE, Via Opera Pia a - 645 Genova

More information

IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING

IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING International Jornal of Modern Engineering Research (IJMER) www.imer.com Vol.1, Isse1, pp-134-139 ISSN: 2249-6645 IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING

More information

Normalized averaging using adaptive applicability functions with application in image reconstruction from sparsely and randomly sampled data

Normalized averaging using adaptive applicability functions with application in image reconstruction from sparsely and randomly sampled data Normalized averaging sing adaptive applicability fnctions with application in image reconstrction from sparsely and randomly sampled data Tan Q. Pham, Lcas J. van Vliet Pattern Recognition Grop, Faclty

More information

(2, 4) Tree Example (2, 4) Tree: Insertion

(2, 4) Tree Example (2, 4) Tree: Insertion Presentation for se with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 B-Trees and External Memory (2, 4) Trees Each internal node has 2 to 4 children:

More information

The Disciplined Flood Protocol in Sensor Networks

The Disciplined Flood Protocol in Sensor Networks The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab

More information

On total regularity of the join of two interval valued fuzzy graphs

On total regularity of the join of two interval valued fuzzy graphs International Jornal of Scientific and Research Pblications, Volme 6, Isse 12, December 2016 45 On total reglarity of the join of two interval valed fzzy graphs Soriar Sebastian 1 and Ann Mary Philip 2

More information

Alliances and Bisection Width for Planar Graphs

Alliances and Bisection Width for Planar Graphs Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.

More information

Dynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un

Dynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un Dynamic Maintenance of Majority Information in Constant Time per Update? Gdmnd S. Frandsen and Sven Skym BRICS 1 Department of Compter Science, University of arhs, Ny Mnkegade, DK-8000 arhs C, Denmark

More information

TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS

TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS TOWARD AN UNCERTAINTY PRINCIPLE FOR WEIGHTED GRAPHS Bastien Pasdelop, Réda Alami, Vincent Gripon Telecom Bretagne UMR CNRS Lab-STICC name.srname@telecom-bretagne.e Michael Rabbat McGill University ECE

More information

Combined cine- and tagged-mri for tracking landmarks on the tongue surface

Combined cine- and tagged-mri for tracking landmarks on the tongue surface INTERSPEECH 2015 Combined cine- and tagged-mri for tracking landmarks on the tonge srface Honghao Bao 1, Wenhan L 1, Kiyoshi Honda 2,*, Jiango Wei 1, Qiang Fang 3, Jianw Dang 2, 4 1 School of Compter Software,

More information

Fast Obstacle Detection using Flow/Depth Constraint

Fast Obstacle Detection using Flow/Depth Constraint Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl

More information

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,

More information

Integration of Fuzzy Shannon s Entropy with fuzzy TOPSIS for industrial robotic system selection

Integration of Fuzzy Shannon s Entropy with fuzzy TOPSIS for industrial robotic system selection JIEM, 2012 5(1):102-114 Online ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.397 Integration of Fuzzy Shannon s Entropy with fuzzy TOPSIS for industrial robotic system selection

More information

Data/Metadata Data and Data Transformations

Data/Metadata Data and Data Transformations A Framework for Classifying Scientic Metadata Helena Galhardas, Eric Simon and Anthony Tomasic INRIA Domaine de Volcea - Rocqencort 7853 Le Chesnay France email: First-Name.Last-Name@inria.fr Abstract

More information

Blended Deformable Models

Blended Deformable Models Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University

More information

3-D SURFACE ROUGHNESS PROFILE OF 316-STAINLESS STEEL USING VERTICAL SCANNING INTERFEROMETRY WITH A SUPERLUMINESCENT DIODE

3-D SURFACE ROUGHNESS PROFILE OF 316-STAINLESS STEEL USING VERTICAL SCANNING INTERFEROMETRY WITH A SUPERLUMINESCENT DIODE IMEKO 1 TC3, TC5 and TC Conferences Metrology in Modern Context November 5, 1, Pattaya, Chonbri, Thailand 3-D SURFACE ROUGHNESS PROFILE OF 316-STAINLESS STEEL USING VERTICAL SCANNING INTERFEROMETRY WITH

More information

Topic Continuity for Web Document Categorization and Ranking

Topic Continuity for Web Document Categorization and Ranking Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:

More information

EXAMINATIONS 2003 END-YEAR COMP 203. Computer Organisation

EXAMINATIONS 2003 END-YEAR COMP 203. Computer Organisation EXAINATIONS 2003 COP203 END-YEAR Compter Organisation Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. There are 180 possible marks on the eam. Calclators and foreign langage dictionaries

More information

Subgraph Matching with Set Similarity in a Large Graph Database

Subgraph Matching with Set Similarity in a Large Graph Database 1 Sbgraph Matching with Set Similarity in a Large Graph Database Liang Hong, Lei Zo, Xiang Lian, Philip S. Y Abstract In real-world graphs sch as social networks, Semantic Web and biological networks,

More information

SELECTION OF PRODUCTS BASED ON CUSTOMER PREFERENCES APPLYING FUZZY LOGIC

SELECTION OF PRODUCTS BASED ON CUSTOMER PREFERENCES APPLYING FUZZY LOGIC Original Article Proceedings of IDMME - Virtal Concept 28 Being, China, October 8, 28 SELECTION OF PRODUCTS BASED ON CUSTOMER PREFERENCES APPLYING FUZZY LOGIC Marco Barajas, Brno Agard 2 () : Départeent

More information

Efficient Scheduling for Periodic Aggregation Queries in Multihop Sensor Networks

Efficient Scheduling for Periodic Aggregation Queries in Multihop Sensor Networks 1 Efficient Schedling for Periodic Aggregation Qeries in Mltihop Sensor Networks XiaoHa X, Shaojie Tang, Member, IEEE, XiangYang Li, Senior Member, IEEE Abstract In this work, we stdy periodic qery schedling

More information

Hardware Design Tips. Outline

Hardware Design Tips. Outline Hardware Design Tips EE 36 University of Hawaii EE 36 Fall 23 University of Hawaii Otline Verilog: some sbleties Simlators Test Benching Implementing the IPS Actally a simplified 6 bit version EE 36 Fall

More information

Tdb: A Source-level Debugger for Dynamically Translated Programs

Tdb: A Source-level Debugger for Dynamically Translated Programs Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,

More information

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion

More information

Multi-lingual Multi-media Information Retrieval System

Multi-lingual Multi-media Information Retrieval System Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,

More information

A Dynamic Bandwidth Allocation Mechanism for Slotted Ring Networks*

A Dynamic Bandwidth Allocation Mechanism for Slotted Ring Networks* A Dynamic Bandwidth Aocation Mechanism for Sotted Ring Networs* L. OROZCO-BARBOSA University of Ottawa, Schoo of nformation Technoogy and Engineering 161 Lois Paster, St. Ottawa, ON, K1N 6N5 CANADA Abstract

More information

Fault Tolerance in Hypercubes

Fault Tolerance in Hypercubes Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different

More information

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations. Ofer Arieli and Arnon Avron

Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations. Ofer Arieli and Arnon Avron Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plasible Relations Ofer Arieli and Arnon Avron Department of Compter Science, School of Mathematical Sciences, Tel-Aviv University,

More information

EEC 483 Computer Organization. Branch (Control) Hazards

EEC 483 Computer Organization. Branch (Control) Hazards EEC 483 Compter Organization Section 4.8 Branch Hazards Section 4.9 Exceptions Chans Y Branch (Control) Hazards While execting a previos branch, next instrction address might not yet be known. s n i o

More information

MTL 776: Graph Algorithms. B S Panda MZ 194

MTL 776: Graph Algorithms. B S Panda MZ 194 MTL 776: Graph Algorithms B S Panda MZ 194 bspanda@maths.iitd.ac.in bspanda1@gmail.com Lectre-1: Plan Definitions Types Terminology Sb-graphs Special types of Graphs Representations Graph Isomorphism Definitions

More information

CAPL Scripting Quickstart

CAPL Scripting Quickstart CAPL Scripting Qickstart CAPL (Commnication Access Programming Langage) For CANalyzer and CANoe V1.01 2015-12-03 Agenda Important information before getting started 3 Visal Seqencer (GUI based programming

More information

A GENERIC MODEL OF A BASE-ISOLATED BUILDING

A GENERIC MODEL OF A BASE-ISOLATED BUILDING Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes

More information

Mathematica(l) Roller Coasters

Mathematica(l) Roller Coasters Mathematica(l) Roller Coasters Selwyn Hollis Department of Mathematics Armstrong Atlantic State University Savannah, GA 31419 shollis@armstrong.ed à Introdction Mathematica animations that simlate roller

More information

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz

More information

Digital Image Processing Chapter 5: Image Restoration

Digital Image Processing Chapter 5: Image Restoration Digital Image Processing Chapter 5: Image Restoration Concept of Image Restoration Image restoration is to restore a degraded image back to the original image while image enhancement is to maniplate the

More information

Chapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind

Chapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind Pipelining hink of sing machines in landry services Chapter 6 nhancing Performance with Pipelining 6 P 7 8 9 A ime ask A B C ot pipelined Assme 3 min. each task wash, dry, fold, store and that separate

More information

CS 153 Design of Operating Systems

CS 153 Design of Operating Systems CS 53 Design of Operating Systems Spring 8 Lectre 9: Locality and Cache Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Some slides modified from originals

More information

An Extended Fault-Tolerant Link-State Routing Protocol in the Internet

An Extended Fault-Tolerant Link-State Routing Protocol in the Internet An Extended Falt-Tolerant Link-State Roting Protocol in the Internet Jie W, Xiaola Lin, Jiannong Cao z, and Weijia Jia x Department of Compter Science and Engineering Florida Atlantic Uniersit Boca Raton,

More information

Pipelining. Chapter 4

Pipelining. Chapter 4 Pipelining Chapter 4 ake processor rns faster Pipelining is an implementation techniqe in which mltiple instrctions are overlapped in eection Key of making processor fast Pipelining Single cycle path we

More information

POWER-OF-2 BOUNDARIES

POWER-OF-2 BOUNDARIES Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of

More information

Constructing Multiple Light Multicast Trees in WDM Optical Networks

Constructing Multiple Light Multicast Trees in WDM Optical Networks Constrcting Mltiple Light Mlticast Trees in WDM Optical Networks Weifa Liang Department of Compter Science Astralian National University Canberra ACT 0200 Astralia wliang@csaneda Abstract Mlticast roting

More information

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information

More information

On the complexity of Submap Isomorphism

On the complexity of Submap Isomorphism On the compleit of Sbmap Isomorphism Christine Solnon 1,2, Gillame Damiand 1,2, Colin de la Higera 3, and Jean-Christophe Janodet 4 1 INSA de Lon, LIRIS, UMR 5205 CNRS, 69621 Villerbanne, France 2 Université

More information

Discretized Approximations for POMDP with Average Cost

Discretized Approximations for POMDP with Average Cost Discretized Approximations for POMDP with Average Cost Hizhen Y Lab for Information and Decisions EECS Dept., MIT Cambridge, MA 0239 Dimitri P. Bertsekas Lab for Information and Decisions EECS Dept., MIT

More information

Optimization and Translation of Tableau-Proofs. Abstract: Dierent kinds of logical calculi have dierent advantages and disadvantages.

Optimization and Translation of Tableau-Proofs. Abstract: Dierent kinds of logical calculi have dierent advantages and disadvantages. J. Inform. Process. Cybernet. EIK?? (199?), (formerly: Elektron. Inform.verarb. Kybernet.) Optimization and Translation of Tablea-Proofs into Resoltion By Andreas Wolf, Berlin Abstract: Dierent kinds of

More information

DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES

DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES Binh-Son Ha 1 Imari Sato 2 Kok-Lim Low 1 1 National University of Singapore 2 National Institte of Informatics, Tokyo, Japan ABSTRACT Dal

More information

Blurred Palmprint Recognition Based on Relative Invariant Structure Feature

Blurred Palmprint Recognition Based on Relative Invariant Structure Feature 5 International Conference on Comptational Science and Comptational Intelligence Blrred Palmprint Recognition Based on Relative Invariant Strctre Featre Gang Wang, Weibo Wei*, Zhenkan Pan College of Information

More information

Master for Co-Simulation Using FMI

Master for Co-Simulation Using FMI Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany

More information

Ma Lesson 18 Section 1.7

Ma Lesson 18 Section 1.7 Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,

More information

This chapter is based on the following sources, which are all recommended reading:

This chapter is based on the following sources, which are all recommended reading: Bioinformatics I, WS 09-10, D. Hson, December 7, 2009 105 6 Fast String Matching This chapter is based on the following sorces, which are all recommended reading: 1. An earlier version of this chapter

More information

Smoothing Low SNR Molecular Images Via Anisotropic Median-Diffusion

Smoothing Low SNR Molecular Images Via Anisotropic Median-Diffusion Smoothing Low SNR Moleclar Images Via Anisotropic Median-Diffsion Jian Ling 1, Member, IEEE, and Alan C. Bovik 2, Fellow, IEEE 1 Sothwest Research Institte Bioengineering Department 6220 Clebra Road San

More information

Hardware-Accelerated Free-Form Deformation

Hardware-Accelerated Free-Form Deformation Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric

More information

THE Unit Commitment problem (UCP) is the problem of

THE Unit Commitment problem (UCP) is the problem of IEEE TRANS IN POWER SYSTEMS 1 A new MILP-based approach for Unit Commitment in power prodction planning. Ana Viana and João Pedro Pedroso Abstract This paper presents a novel, iterative optimisation algorithm

More information

Cautionary Aspects of Cross Layer Design: Context, Architecture and Interactions

Cautionary Aspects of Cross Layer Design: Context, Architecture and Interactions Cationary Aspects of Cross Layer Design: Context, Architectre and Interactions Vikas Kawadia and P. R. Kmar Dept. of Electrical and Compter Engineering, and Coordinated Science Lab University of Illinois,

More information

Image-Based Floor Segmentation in Visual Inertial Navigation

Image-Based Floor Segmentation in Visual Inertial Navigation -Based Floor Segmentation in Visal Inertial Navigation Gillem Casas Barceló, Ghazaleh Panahandeh, and Magns Jansson KTH Royal Institte of Technology ACCESS Linnaes Center Email: {gcb,ghpa,janssonm}@kth.se

More information

Measurement Based Intelligent Prefetch and Cache Technique in Web

Measurement Based Intelligent Prefetch and Cache Technique in Web Measrement ased Intellient Prefetch and Cache Techniqe in Web Zhen Zhao, Jie Yan, Son Wan, Gan Zhan, Yantai Sh Department of Compter Science, Tianin University, Tianin 30007, P.R.China Tel.: +86--7404394,

More information

Fast Ray Tetrahedron Intersection using Plücker Coordinates

Fast Ray Tetrahedron Intersection using Plücker Coordinates Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,

More information

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment

More information

Continuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function

Continuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction

More information