PHYSICS-ENHANCED L-SYSTEMS

Size: px
Start display at page:

Download "PHYSICS-ENHANCED L-SYSTEMS"

Transcription

1 PHYSICS-ENHANCED L-SYSTEMS Hansrud Noser 1, Stephan Rudolph 2, Peter Stuck 1 1 Department of Informatcs Unversty of Zurch, Wnterthurerstr. 190 CH-8057 Zurch Swtzerland noser(stuck)@f.unzh.ch, 2 Department for Statcs and Dynamcs of Aerospace Structures Unversty of Stuttgart, Pfaffenwaldrng 27 D Stuttgart Germany rudolph@sd.un-stuttgart, ABSTRACT In computer graphcs and engneerng many classes of complex objects can be desgned wth L-systems. We present a concept for enhancng tmed and parametrc L-systems wth physcs. Ths smplfes consderably the physcally correct desgn of certan classes of computer anmatons or techncal objects modelled by producton rules. The focus s on structural extensons n tmed and parametrc L-system theory necessary for constrant propagaton management for the treatment of herarchcal objects and on physcs enhanced grammar-language extensons. The proposed concept s llustrated wth a desgn model ncorporatng the statcs of arbtrary tree structures. Keywords: L-systems, rewrtng, physcs, computer graphcs, desgn, anmaton, engneerng, conceptual desgn. 1. INTRODUCTION In physcs- and engneerng-based computer graphcs smulaton, the soluton of large systems of equatons s common practce. Very often the symbolc soluton of large numbers of constrants further complcates the stuaton. A careful nformaton management becomes necessary n order to guarantee solvablty and success. In [YR99] the authors report that the conceptual desgn phase s rather mportant n the engneerng desgn process, and despte ts mportance, ths desgn stage s the least understood and only few supportng tools exst [FRS96]. Approaches for supportng the conceptual Desgn phase are descrbed n [D94]. The objectve of our work s to develop a computerbased framework that supports selected classes of desgn models n order to mprove and reduce the tme need n the conceptual engneerng desgn phase. The basc dea s to use rewrtng systems for defnng such desgn models. Rewrtng systems are synonym for L-systems, L-grammars, or so-called producton systems [PL90]. Rewrtng s a technque for buldng complex objects by successvely replacng parts of a smple ntal object usng a set of rewrtng rules or productons. In computer graphcs, an L-system descrbes a 3D object by an axom and a set of producton rules, whch can be called a grammar snce t descrbes the structure of the object. From the axom and the rules - the grammar - the computer can derve n subsequent teratons 3D objects of a gven structure (or grammar). Furthermore, by usng the concept of turtle graphcs, the symbolc objects can be vsualsed. Tradtonally, L-systems (Lndenmayer-systems) [PL90, PHM93, PJM94] are used for effcent plant and fractal modellng. In [NT99] we descrbe a behavoural anmaton system where producton rules are not only used to defne growth and topology of objects, but also behavour and

2 anmaton of objects n real-tme. In ths paper we suggest to extend such a behavoural anmaton system to a physcs-enhanced L-system applcaton. Our work s nspred from [RN00] where we descrbed a concept on engneerng desgn generaton wth XML-based knowledge-enhanced parametrc grammars. The man focus of the project s to extend a tmed and parametrc L-system applcaton [NT99] n such a way, that t produces not only the geometry but also the correspondng system of equatons or constrants that wll have to be solved automatcally for a gven target applcaton. Rewrtng systems are well suted for embeddng geometry and physcs n the same prmtves, and combnng them to objects of predefned desgn models. In partcular, they -support the constructon of a famly of smlar objects that assure solvablty -are well suted for the constructon of objects wth smlar elements such as plants, brdges, aeroplanes, etc. -can be used for defnng geometry and the correspondng system of equatons -exhbt a hgh data amplfcaton factor because of ther rule-based defnton of objects. nternal representaton of the grammars n applcatons that use the exstng XML supportng Java packages. Whle the descrbed method s best suted for the purpose of conceptual engneerng desgn wth human nteracton, however, t s not suted for realtme applcatons based on tmed L-systems. In ths work we descrbe how we can use smlar prncpals n tmed parametrc L-systems sutable for real-tme applcatons. In order to mprove speed we tend to focus on partcular desgn models and to mplement drectly the treatment of physcs n the applcaton, nstead of mantanng a unversal approach sutable for large classes of engneerng. We mantan the optonal output of the set of equatons n order to be compatble wth the work of [YR99]. Ths concept reduces the generalty of the applcaton, but t makes t sutable for real-tme applcatons and user frendler, as most physcs can be hdden to desgners. User L-system Parser/Compler 2. CONCEPT In order to enhance tmed L-systems wth physcs, we propose a general concept for ncorporatng desgn models. The man dea s to assocate not only geometry but also physcs to symbols. When the desgner uses them n rules for constructng certan classes of objects from a gven desgn model, the applcaton should be able to vsualse the object, as well as to compute the correct physcs. In [RN00] we proposed a generc concept supportng the conceptual desgn phase of engneerng applcaton. In a XML based parametrc grammar smlar to a parametrc L-system [PL90], the user can frst assocate equatons to symbols and then use them n rules for defnng objects. At teraton and nterpretaton of the rules the object was vsualsed, and the applcaton generates automatcally the set of equatons of the correspondng physcal descrpton of the object. These equatons can be solved automatcally by technques descrbed n [YR99]. Thus, an essental support of a conceptual desgn phase for engneerng problems s assured. XML was chosen to get a standardsed representaton of the L- system-lke parametrc grammar. Ths new standard smplfes representaton, edton, parsng, and Iterator L-system applcaton Axom Rules Symbolc object (turtle program) Symbol procedures Interpreter Turtle procedures Archtecture of the tmed and parametrc L- system applcaton that s the startng pont of our work Fgure 1 The startng pont of our work s the real-tme L- system applcaton descrbed n [NT99]. Fg.1 llustrates ts man components. A user desgns an object by the correspondng L-system. The parser and the compler convert t nto an nternal representaton of the axom and the rules. Then, for each frame, the terator terates the symbolc object, whch corresponds to the axom at the begnnng of a smulaton, accordng to the rules. After the teraton, the nterpreter nterprets ths symbolc turtle program by usng procedures of the turtle and the symbol

3 modules, and produces the current frame of the vrtual scene. The L-system we use s tmed, parametrc, condtonal, stochastc, and evolutonary. Tmed symbols of the alphabet of an L-system depend on tme. They have a local age, and they can only be replaced by a rule, f they have reached ther maxmal age. Ths tme dependency s necessary to model contnuous anmaton. The L-system s also parametrc and condtonal. The parameters allow the parent symbols (left sde of producton rule) to pass ther parameters to ther chldren (rght sde of rule) and to modfy them. Wth each rule we can assocate a condton that trggers the rule f t s true. In general, condtons depend on the parameters of the parent symbol and some envronment functons. Symbols can also have growth or evoluton functons (attrbutes) that determne the growth or behavour of the symbol durng ther exstence. Such functons can descrbe the geometrc growth of an object, or the movement of a camera n space, for nstance. Growth or evoluton functons can depend on the local age, the global tme, the symbol parameters, and other functons. In a real-tme L-system based applcaton, at each frame (tme step), the symbolc object s frst terated and then nterpreted. At an teraton step, each symbol of the symbolc object that has reached ts maxmal age and whose rule s trggered by a Boolean expresson (the condton), s replaced by the rght sde of the rule. Otherwse, only ts local age s ncreased by the tme step of the anmaton loop. At an nterpretaton step the symbolc object s nterpreted from left to rght. The symbolc object can be consdered as the actual turtle program, whch bulds and controls the vrtual envronment of the current frame. Each symbol of ths program corresponds to a more or less hgh level procedure wth a gven semantcs. Propertes of tmed and parametrc L-systems have been descrbed here for clarty. In the next sectons we propose new features for enhancng L-systems wth physcs. Frst, we descrbe a concept for managng parent-chld relatonshps between relevant parts of a desgn model. Such relatonshps are needed for mutual nteracton of body-parts. Then, we focus on a concept for ntroducng partcular desgn models nto L-systems. Relatonshp Mangement In most tradtonal L-system based anmaton systems the formal graphcs object s represented by a lnear symbol strng (lst), whch corresponds to the turtle program that vsualses somethng when nterpreted. In ths formal or symbolc object no parent-chld relatonshps between relevant symbols are explctly mantaned for further use, such as constrant propagaton. But n tree-lke objects, for example, consstng of rgd rods that are rgdly lnked, and that propagate forces and moments to ther parent elements, parent-chld relatonshps are needed for computng forces and moments n the tree. Therefore we need a mechansm n L-system based applcatons enablng us to control parent-chld relatonshps of certan symbols. One possblty to solve ths problem s to mplement graph rewrtng, where rules and formal objects exst as graph nstances. Here we can perform all algorthms and computatons drectly on these graph nstances where ponters lnk parents and chldren explctly. But there exst many symbol-strng-lke mplementatons of L-system-based applcatons. Therefore, we propose an extenson of the concept to manage parent-chld relatons for such types of applcatons. We need only three new elements, namely: - a parent-chld relatonshp table (reltable) - a functon getidofleftneghbour() - a functon schldof(parent). The parent-chld relatonshp table reltable s a global table mantanng ts state from frame to frame durng anmaton. It contans chld dentfer and parent dentfer felds that express our parent-chld relatonshps. We also ntroduce a functon schldof(parent) that makes an entry nto reltable. The argument of the functon sets the parent dentfer feld of reltable, and the chld dentfer feld s set wth the symbol dentfer of the symbol n whch the functon s called. Ths functon s only called n parameter expressons of symbols that are only evaluated once at a dervaton step, where also the correspondng symbol dentfer s created. We stll need a second functon, whch s called only n parameter expressons, and whch serves to get a symbol dentfer. The proposed functon getidofleftneghbour() returns the symbol dentfer of the th left neghbour of the symbol where the functon has been called. Ths functon enables us to mport symbol dentfers nto the formal parameter space of L-systems. Wth these three new elements rule desgners have now the possblty to defne n a very flexble manner parent-chld relatonshps of relevant symbols. An example s shown n secton three.

4 Integraton of Desgn Models We propose to ntroduce a desgn model by mplementng fve new elements (see Fg.2), namely - a desgn model table (desgnmodeltable) - a desgn model symbol - a functon createdesgnmodelelement() - a desgn model equaton wrter - a desgn model equaton solver. The desgn model table defnes all the attrbutes of the elements of a gven desgn model that are necessary to descrbe ther physcs. The key feld of ths table s the symbol dentfer. be called n parameter expressons of the desgn model symbol. The desgn model equaton wrter s used to output the system of equatons descrbng the physcs of the desgn model. Ths procedure needs the relatonshp table and the desgn model table as nput. It can be called at the end of an nterpretaton step at each frame. The desgn model equaton solver computes the soluton of the actual set of equatons descrbng the state of the on-gong anmaton. As nput t uses reltable and desgnmodeltable. It updates all relevant felds of desgnmodeltable that can be used by symbols for vsualsaton n a subsequent nterpretaton step. Iterator Interpreter 3. EXAMPLE OF A DESIGN MODEL schldof createdesgnmodelelement reltable desgnmodeltable nput nput result Equaton solver nput nput Ths secton llustrates the proposed concept of enhancng tmed and parametrc L-systems by realsng a partcular desgn model, namely the statcs of arbtrary rgd tree constructs wth a fxed root and free chldren (see Fg.3). For any tree structure and appled external, tme dependent forces that are desgned wth rules, the statcs wll be computed automatcally by the applcaton. Moreover, the geometry, the resultng forces and moments at the jonts are dsplayed at each frame. Equaton wrter output leaf Set of equatons Archtecture of extensons Fgure 2 The alphabet of the L-system applcaton has to be extended by one ore several desgn model symbols, whch enable desgners to set certan physcal attrbutes of the correspondng desgn model. These user-defned attrbutes correspond to growth or evoluton functons of the symbols and can depend on tme. To add a new element to desgnmodeltable, we use the functon createdesgnmodelelement(), whch can root Desgn model of arbtrary 3D tree structures wth a fxed root and free leaves Fgure 3 Ths smple example s well suted to llustrate our proposed approach. Frst, we descrbe the physcal model of the desgn model. Then, we focus on the structure of the partcular desgn model table treetab

5 and the algorthms of the equaton solver and the optonal equaton wrter. Fnally, we dscuss an L- system representng a bnary tree. Desgn model of Rgd Trees An element of our tree structure s a rgd rod wth rgd jonts propagatng forces and moments to the root (see Fg.4). G P l +1 Accordng to Fg.4, we need the followng data felds for our tree desgn model table (treetab): symbolid: The dentfer of the symbol massdensty: The mass densty of the symbol M[3]: The moment vector F[3] : The chld force vector G[3] : The external force vector l[3]: The rod unt vector len: The rod length P[3]: The rod poston vector r : The attack pont for gravty x[3] : The attack pont for G P P : P +1 : m : f : F +1 : r x f F +1 poston vector of the root sde part poston vector of the chld sde mass densty of the element Force vector caused by the mass of the element and gravty actng at r Force vector propagated by the chld and actng at l External force actng on the element at G : the poston x computed attrbutes: l = P +1 - P,, r = 0.5* l A prmtve rod element of a tree structure Fgure 4 Eq. 1 shows the force actng on a jont of a rod element n the tree. It contans the sum of the contrbuton of all chldren, the external force, and ts own contrbuton caused by gravty and ts mass. F = f + G + F (1) k k= chldofnode The moment, whch acts on the jont and whch s propagated to the parent, s gven by Eq. 2. M = r f + x l F + G + M k k k= chldofnode k= chldofnode (2) Note that Eq. 1 and Eq. 2 contan the contrbutons of ther chldren that are agan parents of ther chldren, etc. Therefore, when solvng the resultng system of equatons, all nteractons are propagated from the leaves to the root. Ths means, that ths model s physcally correct. The root, for nstance, wll see all the contrbutons of the whole tree elements. As a next step we ntroduce the desgn model symbol called rod. Its evoluton functons determne the attrbutes length, radus, mass-densty, x, external force -, that a desgner can defne. The start poston P of a rod s gven by the current poston of the turtle. Its drecton s determned by the turtle s headng vector. When nterpreted, frst the evoluton functons are evaluated n order to update the correspondng attrbutes n the desgn model table treetab. Then, the rod, the external force, and the computed moment and jont force are drawn. The equaton solver has to compute the forces and moments accordng to Eq. 1 and Eq. 2. Every parent can have multple chldren. Therefore, the forces and moments for the rod elements can be calculated n reverse sense by startng from leaves and gong back to the root. A possble soluton s to mark frst all lnes n the relatonshp table wth the topologcal dstance of the chldren from the root. Then, n a second step we can calculate all the forces and moments startng from the hghest dstances down to the root. The code of Fg.5 accomplshes ths task. It s executed after a complete teraton and nterpretaton step. resetdstancemarks(reltable, 0) maxlength = markwthdstance(reltable) for = maxlength downto 0 for all reltable.chldid wth =reltable.dstancemark calculate force and moment wth all chld contrbutons Pseudo code of the equaton solver Fgure 5 After an nterpretaton step we can also wrte the system of equatons n a text fle for further external processng. Fg.6 llustrates the pseudo code of the equaton wrter. Varables are ndexed by the correspondng symbol-dentfer. Parts of the equatons that can be evaluated are calculated

6 drectly. The algorthm of Fg. 5 outputs the equatons. These equatons can also be solved automatcally by constrant propagaton technques descrbed n [YR99], whch are used n conceptual desgn n engneerng. For our real-tme applcaton, however, t s more effcent to mplement drectly our proposed numercal soluton of Fg.5. for all rod elements el of treetab do { /* computaton of numercal values */ = el.symbolid; gravty = (0,el.massDensty*el.len*el.radus 2 *P*9.91, 0); F1 = gravty + el.g; M1 = el.r gravty + el.x el.g; =, length=, radus=1, massdensty=1) push rot (angle = a) z ( x 0 = x 0-1, =getidofleftneghbour(3), = *b) pop push rot (angle = -a) z ( x 0 = x 0-1, =getidofleftneghbour(7), = *b) pop } /* The output strngs are generated and ntalzed */ Strng F = F_ + + = + F1; Strng M = M_ + + = + M1; /* The chld contrbutons are added as varables */ for all chlds j = chldofparent(reltable, ); F = F + F_ + j; M = M el.r + F_ + j + + M_ + j; } prnt F; prnt M; Pseudo code of the L-system of a bnary tree Fgure 7 Let us now apply the terator on ths L-system and look at the produced symbolc objects. Fg.8 shows two teratons of the axom. At teraton the rght sde of the unque rule replaces the dummy symbol z of the current symbolc object. For each rght-sde symbol a unque dentfer s created that ndexes t n the symbolc object. Code of the equaton wrter that produces a text fle wth the set of equatons descrbng the statcs of a tree structure Fgure 6 L-system of a Bnary Tree The L-system of a bnary tree wthout external forces s gven by the pseudo code of Fg.7. The axom conssts of a germ-lke symbol z wth three parameters that correspond to the maxmal number of teratons, the root dentfer (-1), and the ntal length (5) of a rod element passed by the unque rule to ts rght sde symbols. Note, that the parameter s used to propagate the parent-dentfer to ts chldren. The functon getidofleftneghbour() puts the parent-dentfer nto the parameter space of the L-system. Constants a = 30 /* rotaton angle */ b = 0.8 /* rod length reducton factor */ Axom z =4, =-1, =5) Rule1: z s replaced f (t>maxage) and >0) by rod ( x 0 =schldof( ), =createtreetableelement(), Axom z 1 =5, =-1, =5) Frst teraton rod 2 =schldof(-1), =createtreetableel(), =5, length=5, radus=1, massdensty=1) push 3 rot 4 (angle=30) z 5 ( x 0 =4, =2, =4) pop 6 push 7 rot 8 (angle=-30) z 9 =4, =2, =4) pop 10 Second teraton rod 2 =schldof(-1), =createtreetableel(), =5, length=5, radus=1, massdensty=1) push 3 rot 4 (angle=30) rod 11 =schldof(-1), =createtreetableel(), =4, length=5, radus=1, massdensty=1) push 12 rot 13 (angle=30) z 14 =3, =11, =3.2) pop 15 push 16 rot 17 (angle=-30) z 18 =3, =11, =3.2) pop 19 pop 6 push 7 rot 8 (angle=-30) rod 20 =schldof(-1), =createtreetableel(), =4, length=5, radus=1, massdensty=1) push 21 rot 22 (angle=30) z 23 =3, =20, =3.2) pop 24 push 25 rot 26 (angle=-30) z 27 =3, =20, =3.2) pop 28 pop 10 The symbolc objects of two teratons of the axom Fgure 8

7 coordnate system, but also the force and moment vectors at ts root-sde jont. The symbol can access the computed resultng force and moment n the desgn model table (treetab) by ts unque symbol dentfer. Please note that ths desgn model only treats the statcs of rgd tree structures, and therefore, the effects of forces and moments cannot be vsualsed as deformatons or movements. A desgn model of the dynamcs of tree structures s much more complex. Its mplementaton s left to future work. The forces and moments caused by gravty are drawn as vectors startng from the jonts of the rod elements. Vsualzaton of the formal object, the forces, and the moments after four teratons of the axom Fgure 9 A spral composed of rod elements Fgure 11 A non-flat bnary tree wth vsualzed forces and moments Fgure 10 Accordng to the rule and the parameter x 0 of the symbol z the L-system s terated four tmes. Fg. 9 llustrates the vsualsed tree object after four teratons. The nterpreter of the L-system applcaton (Fgure 1) s responsble for the vsualsaton of the symbolc object (Fgure 8) at a gven anmaton tme. It nterprets each symbol accordng to ts semantcs and ts parameters. The rod symbol draws not only a cylnder n the turtle s The Fg.10 to 12 show other examples of the statc tree desgn model wth one fxed root and free leaves. Each fgure s defned by an approprate L- system, contanng rod symbols of the statc-treedesgn-model. A detaled descrpton of all of these L-systems s beyond the scope of ths paper. The examples serve only to llustrate the fact that, once a desgn model s mplemented, t s possble to nvestgate, vsualse, and analyse a multtude of nstances of a gven desgn model. In all fgures gravty s actng n vertcal drecton. Only n Fg.12 there are external forces that are vsualsed as thck vectors. They are attackng at each rod element of the quad tree. As a last llustraton of the descrptve power of L- systems, Fgure 13 shows the L-system of the sprallke object of Fgure 11 consstng of 29 lnked rod elements. The only rule Rule1 adds at each tme unt a rod element and adjusts the turtle by two rotatons n order to get a spral-lke shape of the fnal object.

8 llustrate our proposed concept wth a smple desgn model dealng wth the statcs of arbtrary trees. Future work wll focus on the ntegraton of more desgn models such as the dynamcs of trees, partcle systems, and most especally, desgn models contanng general parent-chld relatonshps wth cycles as they are found n most techncal constructons. REFERENCES [D94] Dym C. L., Engneerng Desgn: A Synthess of Vews, Cambrdge Unversty Press, A tree wth four branches at each node. External forces attack at each rod element Axom z =29, =-1, =5) Fgure 12 Rule1: z s replaced f (t>1) and >0) by rod ( x 0 =schldof( ), =createtreetableelement(), =, length=, radus= /9, massdensty=3) rotup (angle =37) ptchdown (angle = 28) z ( x 0 = x 0-1, =getidofleftneghbour(3), = * 0.9) L-system of the spral-lke object that s llustrated n Fgure 11. Ths object conssts of 29 lnked rod elements. The spral-lke shape s obtaned by the two turtle rotatons rotup and ptchdown after each rod element. 4. CONCLUSIONS Fgure 13 It s a vsonary fact that the tght couplng of physcs- and engneerng-based smulaton tasks wth computer-graphcs vsualsaton procedures bears a hgh potental n the feld of advanced conceptual system desgn and development. The presented work ams n ths drecton. It shows how to extend realtme L-system based applcatons n such a way, that they produce not only geometry but also the correspondng system of equatons that are solved automatcally for a gven target applcaton. We [FRS96]Fertg K. W., Reddy Y. S., Smth D. E., Constrant Management Methodology for Conceptual Desgn Tradeoff Studes, Proceedngs of the 1996 ASME Desgn Engneerng Techncal Conference and Computers n Engneerng Conference, August 18-22, Irvne, Calforna, USA, August [NT99] H. Noser, D.Thalmann, A Rule-Based Interactve Behavoral Anmaton System for Humanods, IEEE Transactons on Vsualzaton and Computer Graphcs, Vol. 5, No. 4, October-December [PHM93] P. Prusnkewcz, M.S. Hammel, E. Mjolsness, Anmaton of Plant Development, Computer Graphcs Proceedngs, SIGGRAPH 93, Annual Conference Seres, ACM Press, pp. 351, [PJM94] P. Prusnkewcz, M. James, R. Mech, Synthetc Topary, SIGGRAPH 94, Computer Graphcs Proceedngs, Annual Conference Seres, pp , [PL90] P. Prusnkewcz, A. Lndenmayer, The Algorthmc Beauty of Plants, Sprnger Verlag, [RN00] S. Rudolph, H. Noser, On Engneerng Desgn Generaton wth XML-Based Knowledge-Enhanced Grammars, Proceedngs IFIP WG5.2 Workshop on Knowledge Intensve CAD (KIC-4), Parma, Italy, May 22-24, [YR99] Yusan, H. and Rudolph, S., A Study of Constrant Management Integraton nto the Conceptual Desgn Phase, Proceedngs 25th Desgn Automaton Conference, Las Vegas, NV, September 12-15, 1999.

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Assembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.

Assembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface. IDC Herzlya Shmon Schocken Assembler Shmon Schocken Sprng 2005 Elements of Computng Systems 1 Assembler (Ch. 6) Where we are at: Human Thought Abstract desgn Chapters 9, 12 abstract nterface H.L. Language

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

Computer models of motion: Iterative calculations

Computer models of motion: Iterative calculations Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6) Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Esc101 Lecture 1 st April, 2008 Generating Permutation

Esc101 Lecture 1 st April, 2008 Generating Permutation Esc101 Lecture 1 Aprl, 2008 Generatng Permutaton In ths class we wll look at a problem to wrte a program that takes as nput 1,2,...,N and prnts out all possble permutatons of the numbers 1,2,...,N. For

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND

More information

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vdyanagar Faculty Name: Am D. Trved Class: SYBCA Subject: US03CBCA03 (Advanced Data & Fle Structure) *UNIT 1 (ARRAYS AND TREES) **INTRODUCTION TO ARRAYS If we want

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Notes on Organizing Java Code: Packages, Visibility, and Scope

Notes on Organizing Java Code: Packages, Visibility, and Scope Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments Model Integrated Computng: A Framework for Creatng Doman Specfc Desgn Envronments James R. DAVIS Vanderblt Unversty, Insttute for Software Integrated Systems Nashvlle, TN 37203, USA ABSTRACT Model Integrated

More information

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING James Moscola, Young H. Cho, John W. Lockwood Dept. of Computer Scence and Engneerng Washngton Unversty, St. Lous, MO {jmm5,

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Consistency constraints and 3D building reconstruction

Consistency constraints and 3D building reconstruction Consstency constrants and 3D buldng reconstructon Sébasten Horna, Danel Meneveaux, Gullaume Damand, Yves Bertrand To cte ths verson: Sébasten Horna, Danel Meneveaux, Gullaume Damand, Yves Bertrand. Consstency

More information

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of

More information

Convolutional interleaver for unequal error protection of turbo codes

Convolutional interleaver for unequal error protection of turbo codes Convolutonal nterleaver for unequal error protecton of turbo codes Sna Vaf, Tadeusz Wysock, Ian Burnett Unversty of Wollongong, SW 2522, Australa E-mal:{sv39,wysock,an_burnett}@uow.edu.au Abstract: Ths

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Concurrent models of computation for embedded software

Concurrent models of computation for embedded software Concurrent models of computaton for embedded software and hardware! Researcher overvew what t looks lke semantcs what t means and how t relates desgnng an actor language actor propertes and how to represent

More information

Preconditioning Parallel Sparse Iterative Solvers for Circuit Simulation

Preconditioning Parallel Sparse Iterative Solvers for Circuit Simulation Precondtonng Parallel Sparse Iteratve Solvers for Crcut Smulaton A. Basermann, U. Jaekel, and K. Hachya 1 Introducton One mportant mathematcal problem n smulaton of large electrcal crcuts s the soluton

More information

Ontology Generator from Relational Database Based on Jena

Ontology Generator from Relational Database Based on Jena Computer and Informaton Scence Vol. 3, No. 2; May 2010 Ontology Generator from Relatonal Database Based on Jena Shufeng Zhou (Correspondng author) College of Mathematcs Scence, Laocheng Unversty No.34

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Maintaining temporal validity of real-time data on non-continuously executing resources

Maintaining temporal validity of real-time data on non-continuously executing resources Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan

More information

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell

More information

Brave New World Pseudocode Reference

Brave New World Pseudocode Reference Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be

More information

Pose, Posture, Formation and Contortion in Kinematic Systems

Pose, Posture, Formation and Contortion in Kinematic Systems Pose, Posture, Formaton and Contorton n Knematc Systems J. Rooney and T. K. Tanev Department of Desgn and Innovaton, Faculty of Technology, The Open Unversty, Unted Kngdom Abstract. The concepts of pose,

More information

Learning physical Models of Robots

Learning physical Models of Robots Learnng physcal Models of Robots Jochen Mück Technsche Unverstät Darmstadt jochen.mueck@googlemal.com Abstract In robotcs good physcal models are needed to provde approprate moton control for dfferent

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016 Inverse Knematcs (part 2) CSE169: Computer Anmaton Instructor: Steve Rotenberg UCSD, Sprng 2016 Forward Knematcs We wll use the vector: Φ... 1 2 M to represent the array of M jont DOF values We wll also

More information

Application of Learning Machine Methods to 3 D Object Modeling

Application of Learning Machine Methods to 3 D Object Modeling Applcaton of Learnng Machne Methods to 3 D Object Modelng Crstna Garca, and José Al Moreno Laboratoro de Computacón Emergente, Facultades de Cencas e Ingenería, Unversdad Central de Venezuela. Caracas,

More information

Priority queues and heaps Professors Clark F. Olson and Carol Zander

Priority queues and heaps Professors Clark F. Olson and Carol Zander Prorty queues and eaps Professors Clark F. Olson and Carol Zander Prorty queues A common abstract data type (ADT) n computer scence s te prorty queue. As you mgt expect from te name, eac tem n te prorty

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

Math Homotopy Theory Additional notes

Math Homotopy Theory Additional notes Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Memory Modeling in ESL-RTL Equivalence Checking

Memory Modeling in ESL-RTL Equivalence Checking 11.4 Memory Modelng n ESL-RTL Equvalence Checkng Alfred Koelbl 2025 NW Cornelus Pass Rd. Hllsboro, OR 97124 koelbl@synopsys.com Jerry R. Burch 2025 NW Cornelus Pass Rd. Hllsboro, OR 97124 burch@synopsys.com

More information

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.

More information

such that is accepted of states in , where Finite Automata Lecture 2-1: Regular Languages be an FA. A string is the transition function,

such that is accepted of states in , where Finite Automata Lecture 2-1: Regular Languages be an FA. A string is the transition function, * Lecture - Regular Languages S Lecture - Fnte Automata where A fnte automaton s a -tuple s a fnte set called the states s a fnte set called the alphabet s the transton functon s the ntal state s the set

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de

More information

Pass by Reference vs. Pass by Value

Pass by Reference vs. Pass by Value Pass by Reference vs. Pass by Value Most methods are passed arguments when they are called. An argument may be a constant or a varable. For example, n the expresson Math.sqrt(33) the constant 33 s passed

More information