The Internal Conflict of a Belief Function
|
|
- Bernard Williamson
- 5 years ago
- Views:
Transcription
1 The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of generalized siple support functions (GSSFs) Reoving the single GSSF supporting the epty set we obtain the base of the belief function as the reaining GSSFs Cobining all GSSFs of the base set, we obtain a base belief function by definition We define the conflict in Depster s rule of the cobination of the base set as the internal conflict of the belief function Previously the conflict of Depster s rule has been used as a distance easure only between consonant belief functions on a conceptual level odeling the disagreeent between two sources Using the internal conflict of a belief function we are able to extend this also to non-consonant belief functions 1 Introduction In this paper we define and derive an internal conflict of a belief function within Depster-Shafer theory [1 3, 14] We decopose the belief function in question into a set of generalized siple support functions (GSSFs) Reoving the single GSSF supporting the epty set we obtain the base of the belief function as the reaining GSSFs Cobining all GSSFs of the base set, we obtain a base belief function by definition We define the conflict in Depster s rule of this cobination as the internal conflict of the belief function We propose that the base belief function is a better easure than the original belief function which can be obtained by cobining the base belief function with pure conflict, ie, {[ 1, ], [ 1( Θ), Θ ]} There are several different ways to anage a high conflict in cobination of belief functions within Depster-Shafer theory For an overview of different Johan Schubert Departent of Decision Support Systes, Division of Inforation and Aeronautical Systes, Swedish Defence Research Agency, SE Stockhol, Sweden e-ail: schubert@foise, This work was supported by the FOI research project Real-tie Siulation Supporting Effects-based Planning, which is funded by the R&D prograe of the Swedish Ared Forces T Denœux & M-H Masson (Eds): Belief Functions: Theory & Appl, AISC 164, pp springerlinkco Springer-Verlag Berlin Heidelberg 01
2 170 J Schubert alternatives to anage the cobination of conflicting belief functions, see articles by Sets [16] and Liu [7] For a recent survey of alternative distance between belief functions, see Joussele and Maupin [5] In section we review a ethod for decoposing a belief function into a set of GSSFs [15] In section 3 we derive the base set of a belief function and construct a base belief function fro the base set corresponding to the belief function under decoposition In section 4 we derive the internal conflict of the belief function and show how this extends the conflict fro being a distance easure only for consonant belief functions to a functioning distance easure also between non-consonant belief functions In section 5 we provide an exaple Finally, conclusions are drawn (section 6) Decoposing a Belief Function All belief functions can be decoposed into a set of GSSFs on a frae of discernent Θ using the ethod developed by Sets [15] A GSSF is either a traditional siple support function (SSF) [14] or an inverse siple support function (ISSF) [15] Let us begin by defining an ISSF: Definition 1 An inverse siple support function on a frae of discernent Θ is a function : Θ (, ) characterized by a weight w ( 1, ) and a focal eleent A Θ, such that ( Θ) w, A ( ) 1 w and X ( ) 0 when X { A, Θ } Let us recall the eaning of SSFs and ISSFs [15]: An SSF 1 ( A) [ 0, 1] represents a state of belief that You have soe reason to believe that the actual world is in A (and nothing ore) An ISSF ( ) (,0) A on the other hand, represents a state of belief that You have soe reason not to believe that the actual world is in A Note that not believing in A is different than believing in A c A siple exaple is one SSF 1 (A) 1/ 4 and ( ) 3/4 1 Θ, and one ISSF (A) 1/ 3 and ( ) 4/3 Θ Cobining these two functions yields a vacuous belief function 1 ( Θ) 1 The decoposition ethod is perfored in two steps eqs (1) and () First, for any non-dogatic belief function Bel 0, ie, where 0 ( Θ) > 0, calculate the coonality nuber for all focal eleents A by eq (1) We have Q0( A) 0( B) (1) B A For dogatic belief functions assign 0 ( Θ) ε > 0 and discount all other focal eleents proportionally Secondly, calculate i ( C) for all decoposed GSSFs, where C Θ including C, and i is the ith GSSF There will be one GSSF for each subset C
3 The Internal Conflict of a Belief Function 171 of the frae unless i ( C) happens to be zero In the general case we will have Θ GSSFs We get for all C Θ including C i ( C) 1 Q 0 ( A) 1 A C i ( Θ) 1 i ( C) ( ) A C + 1 () Θ where i [1, 1] Here, C Θ of is the ith subset of Θ in nuerical order i ( C) which also includes C, ie, {[ 1( ), ], [ 1( ), ]} of eq () Θ Θ is the first decoposed GSSF 3 Transforing a Belief Function into a Base Belief Function Using eqs (1) and () we ay decopose a belief function 0 into a set of GSSFs We call the non-conflict GSSFs of the decoposition the base of 0 Definition The base of a belief function 0 is the set of decoposed siple support and inverse siple support function { } Θ 1 i i (3) deliberately excluding 1 that supports only {, Θ }, where { } Θ 1 i i 1 (4) is the full set of Θ 1 siple support and inverse siple support function fro the decoposition of 0 by eqs (1) and () Definition 3 A base belief function of a belief function 0 is the belief function resulting fro the unnoralized cobination of the base of 0, ie, Definition 4 A base conflict of a belief function 0 is the obtained conflict of the first GSSF that supports {[ 1( ), ], [ 1( ), ]} { } i Θ 1 i Θ Θ of the decoposition of a belief function of 0 by eqs (1) and () (5) 1 With Θ {, abc, } the nuerical order of all subsets in Θ including is Θ {, {a}, {b}, {a, b}, {c}, {a, c}, {b, c}, {a, b, c}}
4 17 J Schubert Theore 1 A belief function 0 can be recovered by cobination of its corresponding base belief function with the base conflict 1, ie, 0 1 (6) Proof Iediate by definition and 3 Ñ 4 The Internal Conflict of a Belief Function The conflict received fro a cobination of belief functions by Depster s rule is not a easure of dissiilarity between the cobined belief functions Indeed, belief functions can be quite different and yet have zero conflict as intersection of their focal eleents are non-epty Instead the conflict of Depster s rule is best viewed as a different kind of distance easure; a easure of conceptual disagreeent between sources When they disagree highly it is a sign that soething is wrong It should be noted that there is at least two possible sources of conflict other than easureent errors We ay have odeling errors or faulty sources [4] Faulty sources are corrected by appropriate discounting (eg, [6, 1, 16]) while odeling errors are corrected by adopting an appropriate frae of discernent [13, 14] In this section we define and investigate an internal conflict of a belief function We further devise a way to obtain the internal conflict Definition 5 The internal conflict of a belief function 0 is the conflict received in the unnoralized cobination of the base of 0 to obtain the base belief function, ie, where { i } Θ 1 i (7) For siplicity, view the intersection of eq (7) as taking place in a Θ hyper cube of all Θ GSSFs Note that can take both positive and negative values Theore The internal conflict within a base belief function is strictly a function of conflicts between different GSSFs supporting subsets of the frae Proof Iediate by observation of the cobination in eq (7) as 1 with body of,, ( Θ), Θ is not included in the cobination Ñ evidence {[ 1 ] [ 1 ]} Theore 3 There exist an infinite size faily of unnoralized belief functions p { 0 p 1 (, ), p 1 } with an identical base belief function and identical internal conflict
5 The Internal Conflict of a Belief Function 173 Proof Let us generate a faily fro the base: Take any belief function 0 on a frae Θ of size n Θ Decopose 0 into its GSSFs Cobine { } n n i i using eq (7) into the base belief function Let us ignore the value obtained for 1 in the decoposition Instead, let 1 (, ), 1 1 The p faily of belief functions { 0 } is generated by cobining the base belief function with each of the { } The faily is of infinite size Ñ 1 When going in the other direction fro faily to base: Note, that in the special case of a noralized base belief function it can be recovered fro any faily eber by noralization If we cobine a non-consonant belief function with itself we should not be surprised that we receive a conflict A non-consonant belief function can be expressed as a construct fro the base set of that belief function If the belief function cobined with itself is constructed in two steps by first cobining all GSSFs pairwise with theselves, these Θ cobinations of GSSFs with identical focal sets are conflict free (excluding and Θ) Cobining the resulting Θ GSSFs in the second step obviously has epty intersections aong their focal eleents resulting in conflict Thus, the internal conflict received is a function of conflicts fro different GSSFs (excluding 1 ) that are used to construct the non-consonant belief function Thus, the conflict noticed in the cobination exists internally within non-consonant belief functions before cobination and is a consequence of the scattering of ass within the distribution This akes the internal conflict appropriate as a conceptual distance easure also between non-consonant belief functions as it easures the internal conflict in the cobination of GSSFs fro two different base sets corresponding to the two different base belief functions without the added pure conflict of 1 (supporting only and Θ) that is always included in the conflict obtained by Depster s rule Thus, fro theore and 3 follows that the internal conflict is an appropriate distance easure for all belief functions as it excludes the pure conflict of 1 (ie, also for non-consonant belief functions), where this distance easure sought after is a easure of conceptual disagreeent between sources When calculating the conceptual distance easure based on internal conflict between two belief functions we first transfor the two belief functions 0 and 0 to their base belief function for using eqs (1) and () to find the base set, this is followed by eq (5) to construct the base belief function, and We perfor a conjunctive cobination and find the internal conflict of the resulting base belief function using eq (7)
6 174 J Schubert This easure of internal conflict is the ost objective conflict easure since it excludes pure conflict and is iune to noralizations and incoing belief functions fro sources without any inforation on conflicts in earlier cobinations In the proble of partitioning ixed-up belief functions into subsets that correspond to different subprobles [8 11] we ay use the distance easure of internal conflict for all belief functions (ie, also for non-consonant belief functions) 5 An Exaple Let us study a siple exaple In this exaple we will represent all belief functions using nuerical ordering of focal eleents We assue a frae of discernent Θ { a, b} and a belief function 0 that is build up by cobination of two SSFs and 3 that are yet unknown to us, where We have, [ 0, 04, 0, 06 ], [ 0, 0, 04, 06] (8) [ 016, 04, 04, 036] (9) Using eqs (1) and (), 0 can be decoposed into the base SSFs and 3 Here, the base conflict is 0, ie, 1 in the decoposition of 0 is a vacuous SSF; 1 (Θ) 1 Fro the base set eq (8) we can construct the base belief function which in this case is identical to the belief function 0 If 0 is noralized then the situation is different Let us call this noralization We have, [ ] 0, 0857, 0857, 0486 (10) Decoposing we get [ ] n [ ] [ 0, 0, 04, 06] 1n 3n 01905, 0, 0, 11905, 0, 04, 0, 06, (11) which is the sae base for as in the decoposition of 0 Thus, 0 and has the sae base belief function, which is 0 However, we obtain an inverse base conflict of 1n when decoposing copared to 1 (Θ) 1 in the decoposition of 0 Furtherore, let us assue that we have a second belief function which is build up by cobination of two SSFs and 3 that are also unknown to us, where [ ] [ ] 0, 03, 0, 07, 0, 0, 03, 07 (1) 3 0
7 The Internal Conflict of a Belief Function 175 We have 0 3 [ 9, 01, 01, 049] (13) As above, using eqs (1) and () 0 can be decoposed into the base and 3 ( 1 is vacuous) Using eq (5) we construct the base belief function Finally, given both and we cobine the to obtain [ 03364, 0436, 0436, 01764] (14) We notice a conflict of in the cobination of and Assuing instead that we receive fro a source (let us then call it ) we can decopose it to obtain a pure base without any base conflict; [ ] [ ] [ 0, 0 ] 0, 0, 0, 1, 0, 058, 0, 04, 1 3 3,058,04 We should notice that the two base SSFs and 3 are theselves conflict free cobinations and 3 3 resulting in and 3, respectively Recobining and 3 yields a base belief function identical to 0 Thus, the conflict of 0 and the internal conflict of are identical in this case Had 0 been noralized the situation is soewhat different Let us call the noralization We have, It can be decoposed into [ ] (15) 0, 03671, 03671, 0658 (16) [ ] n [ ] [ 0, 0, 058, 04 ] 1n 3n , 0, 0, 1308, 0, 058, 0, 04, We observe that 0 and have the sae base set in that n and 3 3n Finally, let us study a cobination of a belief function with itself We cobine with itself We have, (17) [ 0695, 0399, 0399, 706] (18)
8 176 J Schubert where belief function Decoposing 0695 we get, is the internal conflict distance easure between the two [ ] n [ ] [ 0, 0, 0836, ] 1n 3n 1711, 0, 0, 711 0, 0836, 0, 01764, (19) As before we have a base set of two SSFs Here the base set of is and 3n, where n n n n, 3n 3n 3n (0) 6 Conclusions We conclude that the internal conflict of a non-consonant belief function is actually a function of conflicts between different GSSFs in the base set of that belief function Here all GSSFs that have identical focal eleents have zero conflict Thus, the internal conflict between two belief functions is an appropriate distance easure on a conceptual level that easures disagreeent between sources References 1 Depster, AP: Upper and lower probabilities induced by a ultiple valued apping The Annals of Matheatical Statistics 38, (1967) Depster, AP: A generalization of Bayesian inference Journal of the Royal Statistical Society B 30, (1968) 3 Depster, AP: The Depster-Shafer calculus for statisticians International Journal of Approxiate Reasoning 48, (8) 4 Haenni, R: Shedding new light on Zadeh s criticis of Depster s rule of cobination In: Proceedings of the Seventh International Conference on Inforation Fusion, pp (5) 5 Joussele, A-L, Maupin, P: Distances in evidence theory: Coprehensive survey and generalizations International Journal of Approxiate Reasoning 53, (01) 6 Klein, J, Colot, O: Autoatic discounting rate coputation using a dissent criterion In: Proceedings of the Workshop on the Theory of Belief Functions, pp 1 6 (paper 14) (010) 7 Liu, W: Analyzing the degree of conflict aong belief functions Artificial Intelligence 170, (6) 8 Schubert, J: On nonspecific evidence International Journal of Intelligent Systes 8, (1993) 9 Schubert, J: Clustering belief functions based on attracting and conflicting etalevel evidence using Potts spin ean field theory Inforation Fusion 5, (4)
9 The Internal Conflict of a Belief Function Schubert, J: Managing decoposed belief functions In: Bouchon-Meunier, B, Marsala, C, Rifqi, M, Yager, RR (eds) Uncertainty and Intelligent Inforation Systes, pp World Scientific Publishing Copany, Singapore (8) 11 Schubert, J: Clustering decoposed belief functions using generalized weights of conflict International Journal of Approxiate Reasoning 48, (8) 1 Schubert, J: Conflict anageent in Depster-Shafer theory using the degree of falsity International Journal of Approxiate Reasoning 5, (011) 13 Schubert, J: Constructing and evaluating alternative fraes of discernent International Journal of Approxiate Reasoning 53, (01) 14 Shafer, G: A Matheatical Theory of Evidence Princeton University Press, Princeton (1976) 15 Sets, P: The canonical decoposition of a weighted belief In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp (1995) 16 Sets, P: Analyzing the cobination of conflicting belief functions Inforation Fusion 8, (7)
Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More information1 Extended Boolean Model
1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationNovel Image Representation and Description Technique using Density Histogram of Feature Points
Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos
More informationCS 361 Meeting 8 9/24/18
CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationPERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL
IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant
More informationλ-harmonious Graph Colouring Lauren DeDieu
λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationThe Unit Bar Visibility Number of a Graph
The Unit Bar Visibility Nuber of a Graph Eily Gaub 1,4, Michelle Rose 2,4, and Paul S. Wenger,4 August 20, 2015 Abstract A t-unit-bar representation of a graph G is an assignent of sets of at ost t horizontal
More informationDETC2002/DAC DECOMPOSITION-BASED ASSEMBLY SYNTHESIS FOR IN-PROCESS DIMENSIONAL ADJUSTABILITY. Proceedings of DETC 02
Proceedings of DETC 0 ASME 00 Design Engineering Technical Conferences and Coputer and Inforation in Engineering Conference Montreal, Canada, Septeber 9-October, 00 DETC00/DAC-08 DECOMPOSITION-BASED ASSEMBLY
More informationReconstruction of Time Series using Optimal Ordering of ICA Components
Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationWavelets for Computer Graphics: A Primer Part 1
Wavelets for Coputer Graphics: A Prier Part Eric J. Stollnitz Tony D. DeRose David H. Salesin University of Washington Introduction Wavelets are a atheatical tool for hierarchically decoposing functions.
More informationMapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu
More informationGromov-Hausdorff Distance Between Metric Graphs
Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationDerivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router
Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationHeterogeneous Radial Basis Function Networks
Proceedings of the International Conference on Neural Networks (ICNN ), vol. 2, pp. 23-2, June. Heterogeneous Radial Basis Function Networks D. Randall Wilson, Tony R. Martinez e-ail: randy@axon.cs.byu.edu,
More informationVerifying the structure and behavior in UML/OCL models using satisfiability solvers
IET Cyber-Physical Systes: Theory & Applications Review Article Verifying the structure and behavior in UML/OCL odels using satisfiability solvers ISSN 2398-3396 Received on 20th October 2016 Revised on
More informationWeeks 1 3 Weeks 4 6 Unit/Topic Number and Operations in Base 10
Weeks 1 3 Weeks 4 6 Unit/Topic Nuber and Operations in Base 10 FLOYD COUNTY SCHOOLS CURRICULUM RESOURCES Building a Better Future for Every Child - Every Day! Suer 2013 Subject Content: Math Grade 3rd
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationData & Knowledge Engineering
Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID
More informationSherlock is Around: Detecting Network Failures with Local Evidence Fusion
Sherlock is Around: Detecting Network Failures with Local Evidence Fusion Qiang Ma, Kebin Liu 2, Xin Miao, Yunhao Liu,2 Departent of Coputer Science and Engineering, Hong Kong University of Science and
More informationThe research on end-effector position and orientation error distribution of SCARA industrial robot
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 Volue 3 Issue 6 ǁ June 2015 ǁ PP.13-20 The research on end-effector position and orientation
More informationGalois Homomorphic Fractal Approach for the Recognition of Emotion
Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,
More informationComparative Evaluation of Color-Based Video Signatures in the Presence of Various Distortion Types
Coparative Evaluation of Color-Based Video Signatures in the Presence of Various Distortion Types Aritz Sánchez de la Fuente, Patrick Ndjiki-Nya, Karsten Sühring, Tobias Hinz, Karsten üller, and Thoas
More informationCassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards
Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense
More informationLeveraging Relevance Cues for Improved Spoken Document Retrieval
Leveraging Relevance Cues for Iproved Spoken Docuent Retrieval Pei-Ning Chen 1, Kuan-Yu Chen 2 and Berlin Chen 1 National Taiwan Noral University, Taiwan 1 Institute of Inforation Science, Acadeia Sinica,
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More information6.1 Topological relations between two simple geometric objects
Chapter 5 proposed a spatial odel to represent the spatial extent of objects in urban areas. The purpose of the odel, as was clarified in Chapter 3, is ultifunctional, i.e. it has to be capable of supplying
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationDepth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method
Aerican Journal of Applied Sciences 1 (3): 209-214, 2004 ISSN 1546-9239 Science Publications, 2004 Depth Estiation of 2-D Magnetic Anoalous Sources by Using Euler Deconvolution Method 1,3 M.G. El Dawi,
More informationAutomatic Graph Drawing Algorithms
Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs
More informationPredicting x86 Program Runtime for Intel Processor
Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given
More informationA Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem
IE Vol. 7, No. 2, pp. 84-92, Septeber 2008. A Coparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Proble Ji Ung Sun School of Industrial and Managent Engineering Hankuk University
More informationMATRIX CALCULATION BACKWARD CHAINING IN RULE BASED EXPERT SYSTEM
4 th Research/Expert Conference with International Participation QUAITY 5, Fojnica, B&H, Noveber 9 -, 5 ATRIX CACUATION BACKWARD CHAINING IN RUE BASED EXPERT SYSTE sc aro Hell Universit of Split, Facult
More informationDesign and Implementation of an Acyclic Stable Matching Scheduler
Design and Ipleentation of an Acyclic Stable Matching Scheduler Enyue Lu Mei Yang Yi Zhang ands.q.zheng Dept. of Coputer Science Dept. of Coputer Science Dept. of Electrical Engineering University of Texas
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object
More informationA CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER
A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER VIOLETA TOMAŠEVIĆ, SLOBODAN BOJANIĆ 2 and OCTAVIO NIETO-TALADRIZ 2 The Mihajlo Pupin Institute, Volgina 5, 000 Belgrade, SERBIA AND MONTENEGRO 2 Technical University
More informationAffine Invariant Texture Analysis Based on Structural Properties 1
ACCV: The 5th Asian Conference on Coputer Vision, --5 January, Melbourne, Australia Affine Invariant Texture Analysis Based on tructural Properties Jianguo Zhang, Tieniu Tan National Laboratory of Pattern
More informationCollection Selection Based on Historical Performance for Efficient Processing
Collection Selection Based on Historical Perforance for Efficient Processing Christopher T. Fallen and Gregory B. Newby Arctic Region Supercoputing Center University of Alaska Fairbanks Fairbanks, Alaska
More informationEfficient and Strategyproof Spectrum Allocations in Multi-Channel Wireless Networks
Efficient and Strategyproof Spectru Allocations in Multi-Channel Wireless Networks Ping Xu, Xiang-Yang Li, Senior Meber, IEEE, ShaoJie Tang, and JiZhong Zhao Abstract In this paper, we study the spectru
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationDistributed Multicast Tree Construction in Wireless Sensor Networks
Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,
More informationDefining and Surveying Wireless Link Virtualization and Wireless Network Virtualization
1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,
More informationData Caching for Enhancing Anonymity
Data Caching for Enhancing Anonyity Rajiv Bagai and Bin Tang Departent of Electrical Engineering and Coputer Science Wichita State University Wichita, Kansas 67260 0083, USA Eail: {rajiv.bagai, bin.tang}@wichita.edu
More informationOptimal Route Queries with Arbitrary Order Constraints
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.?, NO.?,? 20?? 1 Optial Route Queries with Arbitrary Order Constraints Jing Li, Yin Yang, Nikos Maoulis Abstract Given a set of spatial points DS,
More informationUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization
More informationAnalysing Real-Time Communications: Controller Area Network (CAN) *
Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination
More informationJoint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points
Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More information(Geometric) Camera Calibration
(Geoetric) Caera Calibration CS635 Spring 217 Daniel G. Aliaga Departent of Coputer Science Purdue University Caera Calibration Caeras and CCDs Aberrations Perspective Projection Calibration Caeras First
More informationRule Extraction using Artificial Neural Networks
Rule Extraction using Artificial Neural Networks S. M. Karuzzaan 1 Ahed Ryadh Hasan 2 Abstract Artificial neural networks have been successfully applied to a variety of business application probles involving
More informationMirror Localization for a Catadioptric Imaging System by Projecting Parallel Lights
2007 IEEE International Conference on Robotics and Autoation Roa, Italy, 10-14 April 2007 FrC2.5 Mirror Localization for a Catadioptric Iaging Syste by Projecting Parallel Lights Ryusuke Sagawa, Nobuya
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Matheatics and Inforatics Volue 1, No. 1, (January 2011), pp. 55-70 ISSN 2093-9310 http://www.afi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungoon.co Multi-granulation rough set: fro
More informationELEN : Project Progress Report. Second Order Delay Computation for RC networks with Non-Tree Topology
ELEN 689-603: Project Progress eport Second Order Delay Coputation for C networks wi Non-Tree Topology ajeshwary Tayade 000 07 573 //003 PDF created wi pdffactory trial version www.pdffactory.co : Introduction
More informationCalculation of the blocking factor in heliostat fields
Available online at www.sciencedirect.co ScienceDirect Energy Procedia 57 (014 ) 91 300 013 ISES Solar World Congress Calculation of the blocking factor in heliostat fields Mustafa E. Elayeb a *, Rajab
More informationEFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B.
EFFICIENT VIDEO SEARCH USING IMAGE QUERIES A. Araujo1, M. Makar2, V. Chandrasekhar3, D. Chen1, S. Tsai1, H. Chen1, R. Angst1 and B. Girod1 1 Stanford University, USA 2 Qualco Inc., USA ABSTRACT We study
More informationGeometric Constraint Solver using Multivariate Rational Spline Functions
Geoetric onstraint Solver using Multivariate ational Spline Functions Gershon Elber Departent of oputer Science Technion srael nstitute of Technology Haifa 3000 srael E-ail: gershon@cstechnionacil Myung-Soo
More informationELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH
ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.
More informationReal-Time Detection of Invisible Spreaders
Real-Tie Detection of Invisible Spreaders MyungKeun Yoon Shigang Chen Departent of Coputer & Inforation Science & Engineering University of Florida, Gainesville, FL 3, USA {yoon, sgchen}@cise.ufl.edu Abstract
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu Clais, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More information3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric
More informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More informationShort Papers. Location- and Density-Based Hierarchical Clustering Using Similarity Analysis 1 INTRODUCTION
IEEE TRASACTIOS O PATTER AALYSIS AD MACHIE ITELLIGECE, VOL. 20, O. 9, SEPTEMBER 1998 1011 Short Papers Location- and Density-Based Hierarchical Clustering Using Siilarity Analysis Peter Bacsy and arendra
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More informationA Trajectory Splitting Model for Efficient Spatio-Temporal Indexing
A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada
More informationAGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM
International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,
More informationA Novel 2D Texture Classifier For Gray Level Images
2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan
More informationEvaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds
Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles
More informationGeometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem.
Noveber 13, 2016 Geoetry. The Method of the enter of Mass (ass points): Solving probles using the Law of Lever (ass points). Menelaus theore. Pappus theore. M d Theore (Law of Lever). Masses (weights)
More informationINTRINSIC DECOMPOSITION FOR STEREOSCOPIC IMAGES
INTRINSIC DECOMPOSITION FOR STEREOSCOPIC IMAGES Dehua Xie 1, Shuaicheng Liu 1, Kaio Lin 2, Shuyuan Zhu 1, and Bing Zeng 1 1 School of Electronic Engineering, University of Electronic Science and Technology
More informationAuthor. Published. Journal Title DOI. Copyright Statement. Downloaded from. Griffith Research Online. Kandjani, Hadi, Wen, Larry, Bernus, Peter
Enterprise Architecture Cybernetics for Global Mining Projects: Reducing the Structural Coplexity of Global Mining Supply Networks via Virtual Brokerage Author Kandjani, Hadi, Wen, Larry, Bernus, Peter
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationINSERTION SORT is O(n log n)
INSERTION SORT is On log n) Michael A. Bender Martín Farach-Colton Miguel A. Mosteiro Abstract Traditional INSERTION SORT runs in On 2 ) tie because each insertion takes On) tie. When people run INSERTION
More informationThe Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network
The Flaw Attack to the RTS/CTS Handshake Mechanis in Cluster-based Battlefield Self-organizing Network Zeao Zhao College of Counication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China National
More informationResource Optimization for Web Service Composition
Resource Optiization for Web Coposition Xia Gao, Ravi Jain, Zulfikar Razan, Ulas Kozat Abstract coposition recently eerged as a costeffective way to quickly create new services within a network. Soe research
More informationQuerying Uncertain Data with Aggregate Constraints
Querying Uncertain Data with Aggregate Constraints Mohan Yang 1,2, Haixun Wang 1, Haiquan Chen 3, Wei-Shinn Ku 3 1 Microsoft Research Asia, Beijing, China 2 Shanghai Jiao Tong University, Shanghai, China
More informationAn Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks
An Ad Hoc Adaptive Hashing Technique for Non-Uniforly Distributed IP Address Lookup in Coputer Networks Christopher Martinez Departent of Electrical and Coputer Engineering The University of Texas at San
More informationThe Hopcount to an Anycast Group
The Hopcount to an Anycast Group Piet Van Mieghe Delft University of Technology Abstract The probability density function of the nuber of hops to the ost nearby eber of the anycast group consisting of
More informationOptimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model
1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of
More informationShape Optimization of Quad Mesh Elements
Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationRegular and Irreguar m-polar Fuzzy Graphs
Global Journal of Matheatical Sciences: Theory and Practical. ISSN 0974-300 Volue 9, Nuber 07, pp. 39-5 International Research Publication House http://www.irphouse.co Regular and Irreguar -polar Fuzzy
More informationEnhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue
Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade
More informationClassification and Segmentation of Glaucomatous Image Using Probabilistic Neural Network (PNN), K-Means and Fuzzy C- Means(FCM)
IJSRD - International Journal for Scientific Research & Developent Vol., Issue 7, 03 ISSN (online): 3-063 Classification and Segentation of Glaucoatous Iage Using Probabilistic Neural Network (PNN), K-Means
More informationAn Architecture for a Distributed Deductive Database System
IEEE TENCON '93 / B eih An Architecture for a Distributed Deductive Database Syste M. K. Mohania N. L. Sarda bept. of Coputer Science and Engineering, Indian Institute of Technology, Bobay 400 076, INDIA
More informationMULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou
MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou Departent of Coputer Science and Inforation Engineering, National Chiayi
More informationGuillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for
Guillotine subdivisions approxiate polygonal subdivisions: Part III { Faster polynoial-tie approxiation schees for geoetric network optiization Joseph S. B. Mitchell y April 19, 1997; Last revision: May
More informationSecure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals
Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract
More informationMedical Biophysics 302E/335G/ st1-07 page 1
Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative
More informationIn Proceedings of the 11th Annual Conference on Artificial Intelligence (AAAI-93), pages , Washington, D.C.
In Proceedings of the 11th nnual Conference on rtificial Intelligence (I-93), pages 548-553, Washington, D.C., uly 11-15, 1993 Ecient Reasoning in Qualitative Probabilistic Networks Marek. Druzdzel Carnegie
More information3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search
436 Journal of Electrical Engineering & Technology, Vol. 3, No. 3, pp. 436~443, 008 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search Dong-Min
More information