Testing Structural Properties in Textual Data: Beyond Document Grammars

Size: px
Start display at page:

Download "Testing Structural Properties in Textual Data: Beyond Document Grammars"

Transcription

1 Teting Structural Propertie in Textual Data: Beyond Document Grammar Felix Saaki and Jen Pönninghau Univerity of Bielefeld, Germany Abtract Schema language concentrate on grammatical contraint on document tructure, i.e. hierarchical relation between element in a tree-like tructure. In thi paper, we complement thi concept with a methodology for defining and applying tructural contraint from the perpective of a ingle element. Thee contraint can be ued in addition to the exiting contraint of a document grammar. There i no need to change the document grammar. Uing a hierarchy of decription of uch contraint allow for a claification of element. Thee are important feature for tak uch a viualizing, modelling, querying, and checking conitency in textual data. A document containing decription of uch contraint we call a context pecification document (CSD). We decribe the baic idea of a CSD, it formal propertie, the path language we are currently uing, and related approache. Then we how how to create and ue a CSD. We give two example application for a CSD. Modelling co-referential relation between textual unit with a CSD can help to maintain conitency in textual data and to explore the linguitic propertie of co-reference. In the area of textual, non-hierarchical annotation, everal annotation can be held in one document and interrelated by the CSD. In the future we want to explore the relation and interaction between the underlying path language of the CSD and document grammar. Correpondence: Felix Saaki, Univerity of Bielefeld, Faculty of Linguitic and Literature, Computational Linguitic and Text- Technology, Bielefeld, Germany. felix.aaki@uni-bielefeld.de 1 Introduction Thi paper decribe reearch carried out in the project Secondary information tructuring and comparative dicoure analyi (SEKIMO), which i part of the reearch group Text-technological modelling of information and i funded by the German Reearch Council (DFG). In our project, we ue XML document grammar, i.e. DTD (Bray et al., 2000), XML Schema (Thompon et al., 2001), and Relax NG (Clark and Murata, 2001) to formalize and interrelate linguitic phenomena in typologically divere language. The document grammar differ in what they decribe, i.e. morpho-yntactic tructure, emantic relation, and dicoure function, and in the granularity of the decription, i.e. there are language or dialogue Literary and Linguitic Computing, Vol. 18, No. 1 ALLC 2003; all right reerved 89

2 F. Saaki and J. Pönninghau type pecific document grammar on the one hand and document grammar of a more general kind on the other hand. At the level of econdary information tructuring, we interrelate the document grammar, ometime creating intermediate document grammar to connect the pecific and general level of linguitic decription. All document grammar are developed on the bai of and applied to dialogue and text corpora in different language. (For more information about the project, ee Schema language uually define grammatical contraint on document tructure, i.e. hierarchical relation between element in a tree-like tructure. Epecially, but not only for the linguitic phenomena we want to decribe, it eem ueful to complement the concept of hierarchical validation with a methodology for defining and applying other tructural contraint, a there are everal limitation in implementing appropriate document grammar. The main benefit of thi methodology are: addition of contraint that are hard to expre uing chema language; independent formulation of contraint; adding new contraint doe not require change to document chema; claification of information item; aigning clae baed on fulfilment of contraint. We will exemplify thi in reference to the document hown in Fig. 1, which i baed on the Englih part of the MULTEXT-EAST corpu (Ide and Véroni, 1994). Fig. 1 Annotation of a paragraph from Literary and Linguitic Computing, Vol. 18, No. 1, 2003

3 Teting Structural Propertie in Textual Data Hierarchical contraint for the name element are, for example, that it ha to occur inide a entence, here tagged a. Thee contraint can alo be decribed in term of contextual contraint for name, i.e. it ancetor ha to be an element. The hierarchical and the contextual contraint are hown in Fig. 2. In the left-hand part of Fig. 2 there i the hierarchical contraint for name element, i.e. they occur in the content model of entence. In the right-hand part the relation between name and i decribed a a contextual feature of name, hown by arrow pointing from name element to element. Thi feature i hared by all name element. Other feature are hared by only ome name element. For example, the firt occurrence of name i at the beginning of a entence. The ame i true for the fourth occurrence of name, hown by the dark background of the two element. They can be further claified: the firt name i inide a entence, which i at the beginning of a paragraph p, the fourth name i inide a ubequent entence. In other word, the contextual feature of element can be organized in term of a cla tructure, with clae containing general propertie and ubclae that define more pecific propertie. For tak uch a viualizing, modelling, querying, and checking conitency of text, it might be very ueful to decribe the contextual feature of element and arrange them in a cla tructure. A document containing uch decription we call a context pecification document (CSD). In thi paper we will dicu the baic idea of a CSD and decribe how to create and ue a CSD. We will then give two example application for a CSD, namely modelling co-reference in a language-pecific or general fahion, and interrelating different annotation of text. 2 What i a CSD? 2.1 Formal propertie of a CSD A CSD i an XML document that model a hierarchical organized et of clae given by context decription. In the terminology of a CSD, a corpu corpu p... p... name name name name name q q q name name name name name q q q Fig. 2 Hierarchical and contextual contraint on element. Literary and Linguitic Computing, Vol. 18, No. 1,

4 F. Saaki and J. Pönninghau context i a et of element node within an XML document that hare ome pecific tructural property. The hierarchy i contructed by ubetting context. The hierarchy of context clae require each ubcla to decribe a ubcontext of the upercla, i.e. the tructural tet performed ha to be more pecific. Subclae of the ame upercla are not required to form a proper decompoition, o there may be ome ubcontext haring everal node. In our example of the name element in Fig. 2, the general context decription i that their ancetor i an element. The firt occurrence of name and it fourth occurrence can be decribed a a ubcla, becaue they are the firt child of an element. The firt occurrence of name form another ubcla, becaue it i at the beginning of an element that i at the beginning of a paragraph p. We have choen caterpillar expreion a decribed by Brüggemann- Klein and Wood (2000) to formalize the tructural propertie that form the et of context-node. A caterpillar expreion i a regular expreion over an alphabet of ymbol for move (left, right, up, firtchild, latchild), name of element, and everal ymbol for poitional tet (iroot, ileaf, ifirt, ilat). Only element node are ubject to a caterpillar expreion and it evaluation. For example, in Fig. 2, the fourth occurrence of name i the firt child of, o it i matched by a caterpillar expreion uch a ifirt. The textual data from where (ee Fig. 1) preceding the name element i not ubject to the evaluation of the caterpillar expreion. We will not give a lengthy decription of the exact emantic of thee expreion but will concentrate on their application to markup over textual data. The interpretation of each ymbol can be graped intuitively, when we imagine a caterpillar crawling in the element tree. The ymbol right map to true and a change of the current node of the caterpillar to the right ibling, if there exit uch a right ibling. Otherwie, the move evaluate to fale and the current-node remain the ame. Other move, uch a upor left are defined analogouly. Element name and poitional tet are Boolean predicate (e.g. ifirt) and check the current-node for pecific propertie, e.g. ifirt evaluate to true, if the current-node i the firt child of it parent. A caterpillar expreion evaluate to true with repect to ome arbitrary initial node, i.e. the teted node belong to the context, if there i a mapping of the expreion to a equence of ucceful move and tet in the element tree. 2.2 Related approache CSD might reemble Schematron (Jelliffe, 2001), a both can be ued to partially validate document via decription of permiible path for element, but in fact CSD differ from thi approach in everal apect. Firt, Schematron ue XPath (Clark and DeRoe, 1999) to pecify the path, which i more expreive than caterpillar expreion. Undoubtedly thi eae decribing context. However, we are intereted not only in modelling context but alo in comparing and relating contextdecription to document grammar o a to be able to compare their 92 Literary and Linguitic Computing, Vol. 18, No. 1, 2003

5 Teting Structural Propertie in Textual Data trength and weaknee for (linguitic) modelling. Hence, le expreive language eem to be better uited. Second, Schematron almot only deal with reporting fail tet, wherea CSD i epecially deigned for claification of node, i.e. to aign the et of context the node belong to. We can think of CSD a a mean for weak typing a it can be found in everal query language. Certainly, one can mimic thi uing Schematron named pattern, but at the expene of loing ome level of abtraction. Neverthele, CSD and Schematron hare the capability to decribe and validate document baed on an open, node-centric view intead of the top-down hierarchical approach forced by document grammar. CSD can alo be compared with the declaration of feature tructure in the Text Encoding Initiative (TEI; Sperberg-McQueen and Burnard 1994). The baic idea i the ame, namely, to ue an additional document to pecify propertie of the baic data in form of contraint. Similar to Schematron, the expreive power of the TEI feature tructure i much higher than that of caterpillar expreion. However, a mentioned above, for our theoretical interet in the relation between grammatical and path expreible contraint a retriction to a le expreive language eem to be worth while. 2.3 How to write a CSD The tructure of the CSD and the output document of proceing i formulated uing the DTD formalim. An intance of a CSD i illutrated in Fig. 3. A CSD i aware of namepace, whoe tuple of prefix and URI can be introduced in the namepace element inide the namepacelit. The tet for element then may ue thee prefixe. A a CSD validate or querie partial document tructure, we need to define only thoe element that we conider relevant to the proce of querying or validation (ee below). Thi i pecified by the cope attribute, which i attached to the upercla element. The value of cope can be a ingle element name or a white-pace eparated lit of element name. A CSD that define context for the element name (ee Fig. 2) therefore contain a upercla element with an attribute cope= name para.... Next we contruct caterpillar expreion. A poible tart node of a Fig. 3 The general tructure of a CSD given by example. Literary and Linguitic Computing, Vol. 18, No. 1,

6 F. Saaki and J. Pönninghau caterpillar i taken from the cope attribute. For each move or tet of a caterpillar, we ue the appropriate CSD element, i.e. up, right, left, firt, lat, iroot, ileaf, ifirt, ilat. 1 The name of an element i teted by element name= ome element name. For example, we can tet whether an element i the ancetor of the name element by uing an expreion uch a up,. The CSD element zeroormore repreent the Kleene-tar operator, e.g. known from DTD. The element right and name a the content of zeroormore mean zero or more occurrence of the element name to the right of the current node. Thi caterpillar expreion would match for all occurrence of the name element in Fig. 2. Now we contruct the hierarchy of caterpillar expreion. The clae are arranged in an inheritance tructure, i.e. the teted propertie of a certain cla n are common to all ubclae neted in n. Figure 4 how the cla tructure we have decribed o far for the name element. With thi CSD, we are able to claify the firt occurrence of name a a member of the cla name-ub2, the fourth occurrence of name a a member of the cla name-ub1, and the other occurrence a a member of namegeneral. It hould be noted that the common ubequence of the caterpillar expreion are omitted a they are implied by the cla hierarchy. 2.4 How can a CSD be ued? Two contruct in the CSD in Fig. 3 have not been explained o far, i.e. the mode attribute on the cd element and the ufficient attribute on ome of the cla intance. Thee attribute are important parameter a we apply the CSD to a document intance. We can either tet if a document intance i valid with repect to ome context pecification or query for the et of clae matched by certain element node. The mode attribute and it permiible value validate veru query determine the mode of proceing. Context (clae) can be tated to be neceary but not ufficient for validating or querying a node. The ufficient attribute i attached to 1 Experienced uer may give path expreion a attribute value uing concie notation. Fig. 4 The cla tructure of a CSD decribing contextual propertie of the name element in Fig Literary and Linguitic Computing, Vol. 18, No. 1, 2003

7 Teting Structural Propertie in Textual Data a cla if thi cla lead to a poitive reult in the query or validation. For example, if we are intereted in querying name element in our example document (ee Fig. 1) that are at the beginning of a entence, we would attach the ufficient attribute only to the name-ub1 cla and et the mode to query. If we imply want to enure that all name are inide entence, we would attach the ufficient attribute to the namegeneral cla and et the mode to validate. In ome cae it might be ueful to et validity contraint for certain element node in the document intance to enure that a pecific element matche a pecific cla. For thi purpoe we introduced the cd: caterpillar attribute defined in the namepace text-technology.de/cd. Thi attribute can be attached to element in the document intance. The CSD-proceor will generate an error for thi element if it i not in accordance with the cla pecified in the value of cd:caterpillar. In our example, we could attach the cd:caterpillar attribute with the value name-ub2 to the firt occurrence of the name element, to enure that it i alway in the firt entence. The following lit ummarize how to create and ue a CSD: chooe one or more XML document to be validated or queried; chooe an element name or a group of element name; write caterpillar expreion to be matched by the element; contruct a cla hierarchy for the caterpillar expreion; chooe clae to be ufficient for validation or query; write a CSD; optionally, attach the cd:caterpillar attribute to certain node in the document intance(); chooe a proceing-mode for the CSD, i.e. validate or query. 2.5 Poible reult of applying a CSD to a document intance After proceing a document intance in query mode, an output document i generated (Fig. 5). The output document contain a collection of nodelit element, one for each upercla defined in the CSD. The cope attribute of each Fig. 5 The output document of a query. Literary and Linguitic Computing, Vol. 18, No. 1,

8 F. Saaki and J. Pönninghau nodelit carrie the ame value a in the CSD. The location of the document intance i contained in the url attribute of the document element. Each nodelit conit of at leat one node, pecifying an abolute path to the repective node in the document intance. The path i expreed in XPath-Syntax, o the output document can be eaily proceed, e.g. with XSLT (Clark, 1999). For each ufficient cla matched by the node, there i a cla element holding the name of that cla and an optional comment taken from the CSD. The reult of validating a document intance i either true or fale. A document i erroneou if any node in the intance named by the cope attribute doe not match any cla regarded a ufficient, or if the cla named by the cd:caterpillar attribute i not a member of the et of matching clae. That i, the correponding caterpillar expreion of the given cla evaluate to fale for that pecific node. Suppoe we attach the cd:caterpillar attribute with the value name-ub2 to the econd occurrence of name, then an error would occur becaue the expreion up ifirt i not true for thi node. 3 Example Application for a CSD 3.1 Modelling of co-reference In Saaki et al. (2002), we preent an approach toward a formal decription of co-reference in different language, uing the expreive power of document grammar. There we create general and language-pecific document grammar for language corpora. In thi paper we will not give a detailed decription of thi approach, but try to exemplify how the decription of element clae in contextually pecified document tructure might contribute to a claification of co-referential relation, complementing the approach of document grammar. Let u conider the example in Fig. 6, which i a lightly modified verion of the example in Fig. 1. The noun phrae Minitry of Truth, tagged a name, co-refer with the pronoun it, which i tagged a pron in the econd entence. Minitrue alo co-refer with the noun minitrue in the ame entence, which i tagged a name. In the third entence, there i another pronoun pron, which refer to the three quotation q. Figure 7 how the tructural propertie of the three co-referential unit and a correponding CSD. Minitrue can be related to Minitry of Truth with the caterpillar expreion left name. The firt occurrence of the pronoun pron can by related to Minitry of Truth with another caterpillar expreion up up ifirt* name. And the econd pronoun pron can be related to the three quotation q via the caterpillar expreion (right* q)*. The viualization of the CSD how how thee tructural pecification can be claified. Thi example how how one might ue a CSD in the field of linguitic. It can be a tarting point to decribe tructural propertie of 96 Literary and Linguitic Computing, Vol. 18, No. 1, 2003

9 Teting Structural Propertie in Textual Data Fig. 6 Co-referential unit. certain co-referential phenomena and to allow u to tet them with annotated textual data beyond the practical limitation of document grammar in a general and more or le (language) pecific fahion. 3.2 Interrelating different annotation of text There ha been a long continuing dicuion on how to repreent concurrent hierarchie in document tructure. One ource of thi dicuion i the OHCO hypothei that text i a ordered hierarchy of content object. There are many weak and trong verion of thi hypothei. Some worker (Caton, 2002) even claim that the idea of text a a hierarchical tructure i jut one plauible view among other. We do not claim to be able to contribute new idea for thi dicuion or a olution for the problem. What we want to try i to interrelate different annotation with a CSD. We repreent one primary annotation in the ordinary XML document tructure and another annotation, in the ame document, with anchor element. A type can be aigned to thee anchor via the cd:caterpillar attribute, and the repective clae in the CSD can pecify the tructural contraint for the anchor. Figure 8 how an example of a primary annotation from a linguitic Literary and Linguitic Computing, Vol. 18, No. 1,

10 F. Saaki and J. Pönninghau corpu p... coref-general (up*, left*, right*, ifirt*, name*, q*)* pron pron ub1 left, name ub2 up*, ifirt*, name ub3 (right*, q)* name name name name name q q q perpective, which mark entence with tag, and a econdary annotation, which mark line with line-begin and line-end. With the CSD, it i poible to pecify different type of relation between the annotation of entence and line. We can define a cla normalline for general line, which follow immediately a line-end element. The repective caterpillar expreion for thi cla i left line-end. The ubcla lat-line-begin ha the caterpillar expreion right* line-end ilat up corpu. There i alo a cla that cannot be ubumed under the normalline cla. Thi cla i called identicaltosentence and ha the caterpillar expreion ilat up. Thi methodology i cloely related to olution for the problem of overlapping hierarchie, a propoed by the TEI. One of the TEI olution i the contruction of virtual joint for fragmentary element. A CSD can be ued for thi purpoe a well, but alo, a in our example, to decribe variou clae for the intance of the econdary annotation. Thee then can be ued to tet hypothee about the relation between two different annotation of text. Our methodology ha ome drawback, epecially the fact that o far it i not yet poible to generate the caterpillar expreion automatically. Neverthele, it can be ued to validate a hypothei about the relation between different annotation of the ame textual data. Fig. 7 Structural propertie of co-referential unit in Fig. 6 and a correponding CSD. 4 Summary and Future Work In thi paper, we have decribed the motivation for the contextual pecification of element and their repreentation in a cla tructure. We have preented the main apect of CSD a a framework and ome example. Two application in the domain of co-reference and the modelling of different annotation of text howed the potential of CSD. A prototype of a CSD proceor ha been implemented in the Python programming language. In the future we will continue reearch on everal ubject. A decribed, currently we follow Brüggemann-Klein 98 Literary and Linguitic Computing, Vol. 18, No. 1, 2003

11 Teting Structural Propertie in Textual Data Fig. 8 An annotation of line and entence. and Wood in retricting the operator to equence, bracket, and Kleenetar. However, we expect optionality? to be highly valuable to impoe locality contraint (e.g. at mot three node to the left? left? left?) and therefore conider extending our notion of caterpillar expreion in that ene. A CSD ue but doe not depend on a pecific path language, it i eay to integrate, for example, XPath or other (path) language with minor modification to the CSD-DTD, a path expreion may be given a attribute value a well. Furthermore, we want to explore in more detail the relation between a CSD baed on caterpillar expreion and document grammar. And lat but not leat, we want to Literary and Linguitic Computing, Vol. 18, No. 1,

12 F. Saaki and J. Pönninghau ue the CSD to model linguitic phenomena on large corpora a another approach to econdary information tructuring. Reference Bray, T., Paoli, J., Sperberg-McQueen, C. M., and Maler, E. (2000). Extenible Markup Language (XML) 1.0, 2nd edn. W3C Recommendation, 6 October (acceed 6 April 2003). Brüggemann-Klein, A. and Wood, D. (2000). Caterpillar: a context pecification technique. Markup Language: Theory & Practice, 2(1): Caton, P. (2002). Markup current imbalance. Markup Language: Theory & Practice, 3(1): Clark, J. (1999). XSL Tranformation (XSLT). W3C Recommendation, 16 November (acceed 6 April 2003). Clark, J. and DeRoe, S. (1999). XML Path Language (XPath). W3C Recommendation, 16 November (acceed 6 April 2003). Clark, J. and Murata, M. (2001). Relax NG Specification. OASIS Committee Specification, 3 December relax-ng/pec html (acceed 6 April 2003). Ide, N. and Véroni, J. (1994). Multext (multilingual tool and corpora). Proceeding of the 15th CoLing, Kyoto. Sheffield: ICCL (International Committee on Computational Linguitic), pp Jelliffe, R. (2001). Schematron an XML tructure validation language uing pattern in tree. (acceed 6 April 2003). Saaki, F., Wegener, C., Witt, A., Metzing, D., and Pönninghau, J. (2002). Coreference annotation and reource: a multilingual corpu of typologically divere language. Proceeding of the 3rd International Conference on Language Reource and Evaluation (LREC-2002), La Palma. Pari: ELRA (European Language Reource Aociation), pp Sperberg-McQueen, M. and Burnard, L. (ed) (1994). Guideline for Electronic Text Encoding and Interchange (TEI P3). Chicago/Oxford: ACH/ACL/ALLC. Thompon, H., Beech, D., Maloney, M., and Mendelohn, N. (2001). XML Schema Part 1: Structure. W3C Recommendation, 2 May w3.org/tr/xmlchema-1 (acceed 6 April 2003). 100 Literary and Linguitic Computing, Vol. 18, No. 1, 2003

Edits in Xylia Validity Preserving Editing of XML Documents

Edits in Xylia Validity Preserving Editing of XML Documents dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,

More information

Lecture 14: Minimum Spanning Tree I

Lecture 14: Minimum Spanning Tree I COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce

More information

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz

Operational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,

More information

Minimum congestion spanning trees in bipartite and random graphs

Minimum congestion spanning trees in bipartite and random graphs Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two

More information

Chapter S:II (continued)

Chapter S:II (continued) Chapter S:II (continued) II. Baic Search Algorithm Sytematic Search Graph Theory Baic State Space Search Depth-Firt Search Backtracking Breadth-Firt Search Uniform-Cot Search AND-OR Graph Baic Depth-Firt

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog

More information

Service and Network Management Interworking in Future Wireless Systems

Service and Network Management Interworking in Future Wireless Systems Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering

More information

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router

Distributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To

More information

How to. write a paper. The basics writing a solid paper Different communities/different standards Common errors

How to. write a paper. The basics writing a solid paper Different communities/different standards Common errors How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling

More information

Advanced Encryption Standard and Modes of Operation

Advanced Encryption Standard and Modes of Operation Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES

More information

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder

Computer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal

More information

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS

A SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt

More information

An Intro to LP and the Simplex Algorithm. Primal Simplex

An Intro to LP and the Simplex Algorithm. Primal Simplex An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n

More information

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.

Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart. Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut

More information

SIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial

SIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented

More information

arxiv: v1 [cs.ds] 27 Feb 2018

arxiv: v1 [cs.ds] 27 Feb 2018 Incremental Strong Connectivity and 2-Connectivity in Directed Graph Louka Georgiadi 1, Giueppe F. Italiano 2, and Niko Parotidi 2 arxiv:1802.10189v1 [c.ds] 27 Feb 2018 1 Univerity of Ioannina, Greece.

More information

np vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi

np vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,

More information

else end while End References

else end while End References 621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized

More information

Analyzing Hydra Historical Statistics Part 2

Analyzing Hydra Historical Statistics Part 2 Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the

More information

AUTOMATIC TEST CASE GENERATION USING UML MODELS

AUTOMATIC TEST CASE GENERATION USING UML MODELS Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,

More information

xy-monotone path existence queries in a rectilinear environment

xy-monotone path existence queries in a rectilinear environment CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of

More information

Routing Definition 4.1

Routing Definition 4.1 4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing

More information

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE

Keywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent

More information

3D SMAP Algorithm. April 11, 2012

3D SMAP Algorithm. April 11, 2012 3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative

More information

SIMIT 7. Profinet IO Gateway. User Manual

SIMIT 7. Profinet IO Gateway. User Manual SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion

More information

Laboratory Exercise 6

Laboratory Exercise 6 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented

More information

New Structural Decomposition Techniques for Constraint Satisfaction Problems

New Structural Decomposition Techniques for Constraint Satisfaction Problems New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.

More information

A User-Attention Based Focus Detection Framework and Its Applications

A User-Attention Based Focus Detection Framework and Its Applications A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information

More information

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X

Topics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term

More information

Course Project: Adders, Subtractors, and Multipliers a

Course Project: Adders, Subtractors, and Multipliers a In the name Allah Department of Computer Engineering 215 Spring emeter Computer Architecture Coure Intructor: Dr. Mahdi Abbai Coure Project: Adder, Subtractor, and Multiplier a a The purpoe of thi p roject

More information

ADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR

ADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR ADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR A. P. Mullery and R. F. Schauer Thoma J. Waton Reearch Center International Buine Machine Corporation Yorktown Height, New York R. Rice International Buine Machine

More information

Temporal Abstract Interpretation. To have a continuum of program analysis techniques ranging from model-checking to static analysis.

Temporal Abstract Interpretation. To have a continuum of program analysis techniques ranging from model-checking to static analysis. Temporal Abtract Interpretation Patrick COUSOT DI, École normale upérieure 45 rue d Ulm 75230 Pari cedex 05, France mailto:patrick.couot@en.fr http://www.di.en.fr/ couot and Radhia COUSOT LIX École polytechnique

More information

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.

Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck. Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization

More information

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc

MAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic

More information

Aspects of Formal and Graphical Design of a Bus System

Aspects of Formal and Graphical Design of a Bus System Apect of Formal and Graphical Deign of a Bu Sytem Tiberiu Seceleanu Univerity of Turku, Dpt. of Information Technology Turku, Finland tiberiu.eceleanu@utu.fi Tomi Weterlund Turku Centre for Computer Science

More information

1 The secretary problem

1 The secretary problem Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.

More information

Proving Temporal Properties of Z Specifications Using Abstraction

Proving Temporal Properties of Z Specifications Using Abstraction Proving Temporal Propertie of Z Specification Uing Abtraction Graeme Smith and Kirten Winter Software Verification Reearch Centre Univerity of Queenland 4072, Autralia {mith, kirten}@vrc.uq.edu.au Abtract.

More information

A Multi-objective Genetic Algorithm for Reliability Optimization Problem

A Multi-objective Genetic Algorithm for Reliability Optimization Problem International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR

More information

Using Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images

Using Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images 2009 10th International Conference on Document Analyi and Recognition Uing Moue Feedback in Computer Aited Trancription of Handwritten Text Image Verónica Romero, Alejandro H. Toelli, Enrique Vidal Intituto

More information

Kinematics Programming for Cooperating Robotic Systems

Kinematics Programming for Cooperating Robotic Systems Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,

More information

A New Approach to Pipeline FFT Processor

A New Approach to Pipeline FFT Processor A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture

More information

On successive packing approach to multidimensional (M-D) interleaving

On successive packing approach to multidimensional (M-D) interleaving On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a

More information

Separating Ownership Topology and Encapsulation with Generic Universe Types

Separating Ownership Topology and Encapsulation with Generic Universe Types Separating Ownerhip Topology and Encapulation with Generic Univere Type WERNER DIETL, Univerity of Wahington SOPHIA DROSSOPOULOU, Imperial College London PETER MÜLLER, ETH Zurich Ownerhip i a powerful

More information

A QoS-aware Service Composition Approach based on Semantic Annotations and Integer Programming

A QoS-aware Service Composition Approach based on Semantic Annotations and Integer Programming A QoS-aware Service Compoition Approach baed on Semantic Annotation and Integer Programming I. INTRODUCTION Service Oriented Architecture (SOA) i a widely adopted paradigm for developing ditributed application

More information

A Novel Feature Line Segment Approach for Pattern Classification

A Novel Feature Line Segment Approach for Pattern Classification 12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong

More information

CSE 250B Assignment 4 Report

CSE 250B Assignment 4 Report CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed

More information

An Approach to a Test Oracle for XML Query Testing

An Approach to a Test Oracle for XML Query Testing An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,

More information

Objects, Classes, and Inheritance

Objects, Classes, and Inheritance Object, Clae, and Inheritance CS111 Computer Programming Department of Computer Science Welleley College The Big Picture Some paradigm of programming: o Imperative Programming Program pecified by conditional,

More information

CERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu

CERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,

More information

Web Science and additionality

Web Science and additionality Admin tuff... Lecture 1: EITN01 Web Intelligence and Information Retrieval Meage, lide, handout, lab manual and link: http://www.eit.lth.e/coure/eitn01 Contact: Ander Ardö, Ander.Ardo@eit.lth.e, room:

More information

A Fast Association Rule Algorithm Based On Bitmap and Granular Computing

A Fast Association Rule Algorithm Based On Bitmap and Granular Computing A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity

More information

Compiler Construction

Compiler Construction Compiler Contruction Lecture 6 - An Introduction to Bottom- Up Paring 3 Robert M. Siegfried All right reerved Bottom-up Paring Bottom-up parer pare a program from the leave of a pare tree, collecting the

More information

Trainable Context Model for Multiscale Segmentation

Trainable Context Model for Multiscale Segmentation Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu

More information

Planning of scooping position and approach path for loading operation by wheel loader

Planning of scooping position and approach path for loading operation by wheel loader 22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader

More information

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications

DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu

More information

Multiclass Road Sign Detection using Multiplicative Kernel

Multiclass Road Sign Detection using Multiplicative Kernel Proceeding of the Croatian Computer Viion Workhop, Year 1 Multicla Road Sign Detection uing Multiplicative Kernel Valentina Zadrija Mireo d. d. Zagreb, Croatia valentina.zadrija@mireo.hr Siniša Šegvić

More information

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM

See chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive

More information

Parallel MATLAB at FSU: Task Computing

Parallel MATLAB at FSU: Task Computing Parallel MATLAB at FSU: Tak John Burkardt Department of Scientific Florida State Univerity... 1:30-2:30 Thurday, 07 April 2011 499 Dirac Science Library... http://people.c.fu.edu/ jburkardt/preentation/...

More information

The Data Locality of Work Stealing

The Data Locality of Work Stealing The Data Locality of Work Stealing Umut A. Acar School of Computer Science Carnegie Mellon Univerity umut@c.cmu.edu Guy E. Blelloch School of Computer Science Carnegie Mellon Univerity guyb@c.cmu.edu Robert

More information

Shortest Path Routing in Arbitrary Networks

Shortest Path Routing in Arbitrary Networks Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,

More information

Distribution-based Microdata Anonymization

Distribution-based Microdata Anonymization Ditribution-baed Microdata Anonymization Nick Kouda niverity of Toronto kouda@c.toronto.edu Ting Yu North Carolina State niverity yu@cc.ncu.edu Diveh Srivatava AT&T Lab Reearch diveh@reearch.att.com Qing

More information

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.

Key Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing. Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in

More information

LinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage

LinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,

More information

Laboratory Exercise 2

Laboratory Exercise 2 Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on

More information

Image authentication and tamper detection using fragile watermarking in spatial domain

Image authentication and tamper detection using fragile watermarking in spatial domain International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking

More information

SLA Adaptation for Service Overlay Networks

SLA Adaptation for Service Overlay Networks SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada

More information

Representations and Transformations. Objectives

Representations and Transformations. Objectives Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element

More information

Objects and Classes. The Big Picture. Classes. Objects. Some paradigms of programming:

Objects and Classes. The Big Picture. Classes. Objects. Some paradigms of programming: Object and Clae The Big Picture Some paradigm of programming: Imperative Programming ue explicit loop, conditional, variable Three paradigm of programming we cover in CS111. Functional Programming Ue function

More information

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION

ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa

More information

New Structural Decomposition Techniques for Constraint Satisfaction Problems

New Structural Decomposition Techniques for Constraint Satisfaction Problems 113 New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory, Univerity of Nebraka-Lincoln {yzheng,choueiry}@ce.unl.edu Abtract.

More information

Modeling of underwater vehicle s dynamics

Modeling of underwater vehicle s dynamics Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation

More information

Stochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang

Stochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,

More information

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks

Performance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity

More information

(12) Patent Application Publication (10) Pub. No.: US 2013/ A1. Dhar et al. (43) Pub. Date: Jun. 6, 2013 NY (US) (57) ABSTRACT

(12) Patent Application Publication (10) Pub. No.: US 2013/ A1. Dhar et al. (43) Pub. Date: Jun. 6, 2013 NY (US) (57) ABSTRACT (19) United State US 2013 0145314A1 (12) Patent Application Publication (10) Pub. No.: US 2013/0145314 A1 Dhar et al. (43) Pub. Date: Jun. 6, 2013 (54) SYSTEMAND METHOD FORCHANGEABLE (52) U.S. Cl. FOCUS

More information

Application of Social Relation Graphs for Early Detection of Transient Spammers

Application of Social Relation Graphs for Early Detection of Transient Spammers Radolaw rendel and Henryk Krawczyk Application of Social Relation raph for Early Detection of Tranient Spammer RADOSLAW RENDEL and HENRYK KRAWCZYK Electronic, Telecommunication and Informatic Department

More information

Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,

Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem, COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)

More information

AN INTELLIGENT SCHEME FOR FACIAL EXPRESSION RECOGNITION

AN INTELLIGENT SCHEME FOR FACIAL EXPRESSION RECOGNITION AN INTELLIGENT SCHEME FOR FACIAL EXPRESSION RECOGNITION A. Raouzaiou, S. Ioannou, K. Karpouzi, N. Tapatouli, S. Kollia 1, R. Cowie 2 1 Department of Electrical and Computer Engineering National Technical

More information

Refining SIRAP with a Dedicated Resource Ceiling for Self-Blocking

Refining SIRAP with a Dedicated Resource Ceiling for Self-Blocking Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT

More information

Lecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization

Lecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization Lecture Outline Global flow analyi Global Optimization Global contant propagation Livene analyi Adapted from Lecture by Prof. Alex Aiken and George Necula (UCB) CS781(Praad) L27OP 1 CS781(Praad) L27OP

More information

Sequencing and Counting with the multicost-regular Constraint

Sequencing and Counting with the multicost-regular Constraint Sequencing and Counting with the multicot-regular Contraint Julien Menana and Sophie Demaey École de Mine de Nante, LINA CNRS UMR 6241, F-44307 Nante, France. {julien.menana,ophie.demaey}@emn.fr Abtract.

More information

(12) Patent Application Publication (10) Pub. No.: US 2011/ A1

(12) Patent Application Publication (10) Pub. No.: US 2011/ A1 (19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT

More information

Highly Heterogeneous XML Collections: How to retrieve precise results?

Highly Heterogeneous XML Collections: How to retrieve precise results? Highly Heterogeneou XML Collection: How to retrieve precie reult? Imael Sanz, Marco Meiti 2, Giovanna Guerrini, Rafael Berlanga Llavori () Univeritat Jaume I, Catellón, Spain - {berlanga,imael.sanz}@uji.e

More information

Performance Evaluation of an Advanced Local Search Evolutionary Algorithm

Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation

More information

CS201: Data Structures and Algorithms. Assignment 2. Version 1d

CS201: Data Structures and Algorithms. Assignment 2. Version 1d CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and Thi article appeared in a journal publihed by Elevier. The attached copy i furnihed to the author for internal non-commercial reearch and education ue, including for intruction at the author intitution

More information

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES

3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,

More information

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract

Karen L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial

More information

Chapter 13 Non Sampling Errors

Chapter 13 Non Sampling Errors Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption

More information

A TOPSIS based Method for Gene Selection for Cancer Classification

A TOPSIS based Method for Gene Selection for Cancer Classification Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information

More information

Exploring Simple Grid Polygons

Exploring Simple Grid Polygons Exploring Simple Grid Polygon Chritian Icking 1, Tom Kamphan 2, Rolf Klein 2, and Elmar Langetepe 2 1 Univerity of Hagen, Praktiche Informatik VI, 58084 Hagen, Germany. 2 Univerity of Bonn, Computer Science

More information

Stress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling

Stress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation

More information

Laboratory Exercise 2

Laboratory Exercise 2 Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on

More information

How to Select Measurement Points in Access Point Localization

How to Select Measurement Points in Access Point Localization Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,

More information

Bottom Up parsing. Bottom-up parsing. Steps in a shift-reduce parse. 1. s. 2. np. john. john. john. walks. walks.

Bottom Up parsing. Bottom-up parsing. Steps in a shift-reduce parse. 1. s. 2. np. john. john. john. walks. walks. Paring Technologie Outline Paring Technologie Outline Bottom Up paring Paring Technologie Paring Technologie Bottom-up paring Step in a hift-reduce pare top-down: try to grow a tree down from a category

More information

Shortest Paths with Single-Point Visibility Constraint

Shortest Paths with Single-Point Visibility Constraint Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet

More information

An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring

An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring ABSTRACT Overlay network monitoring enable ditributed Internet application to detect and recover from path outage and period of degraded

More information

mapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee

mapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,

More information

Delaunay Triangulation: Incremental Construction

Delaunay Triangulation: Incremental Construction Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )

More information