Constraint Solving for Beautiful User Interfaces: How Solving Strategies Support Layout Aesthetics

Size: px
Start display at page:

Download "Constraint Solving for Beautiful User Interfaces: How Solving Strategies Support Layout Aesthetics"

Transcription

1 Constrant Solvng for Beautful User Interfaces: How Solvng Strateges Support Layout Aesthetcs Clemens Zedler Department of Computer Scence 38 Prnces Street Auckland 1010, New Zealand Chrstof Lutteroth Department of Computer Scence 38 Prnces Street Auckland 1010, New Zealand Gerald Weber Department of Computer Scence 38 Prnces Street Auckland 1010, New Zealand ABSTRACT Layout managers provde an automatc way to place controls n a graphcal user nterface (GUI). Wth the wde dstrbuton of fully GUI-enabled smartphones, as well as very large or even multple personal desktop montors, the logcal sze of commonly used GUIs has become hghly varable. A layout manager can cope wth dfferent sze requrements and rearrange controls dependng on the new layout sze. However, there has been no research on how the dstrbuton of addtonal or lackng space, to all controls n the layout, effects aesthetcs. Much of the prevous research focuses on dscrete changes to layout. Ths ncludes changng the layout elements [15], or swappng around layout elements [7]. In ths paper we focus strctly on the optmzaton of reszng of GUI components, and n ths area we focus on rather subtle changes. Ths paper descrbes and compares strateges to dstrbute avalable space n a vsual appealng way. All strateges are modeled wth a constrant-based layout manager, snce such a layout manager can be used to descrbe a wde range of layouts. Some aesthetc problems of constrant based layout managers have been dentfed and solutons have been provded. In a user evaluaton three solvng strateges, equal dstrbuton, weghted dstrbuton and a mnmal devaton, have been compared. As a result, the mnmal devaton approach seems to be a good strategy for large and small layout szes. The mnmal devaton and the equal dstrbuton strategy s best at large layout szes whle the weghted dstrbuton approach seems to perform better at small layout szes. Furthermore, the evaluaton shows that layouts wth a hgh degree of symmetry are clearly preferred by the users. Categores and Subject Descrptors H.5.2 [User Interfaces]: Evaluaton/methodology General Terms Expermentaton, Measurement, Performance Permsson to make dgtal or hard copes of part or all of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. Copyrghts for components of ths work owned by others than ACM must be honored. Abstractng wth credt s permtted. To copy otherwse, to republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. CHINZ 12, July , Dunedn, New Zealand Copyrght 2012 ACM /12/07 $ Keywords Aesthetcs, Constrant Based Layout, GUIs, Layout Manager 1. INTRODUCTION In early GUI frameworks, controls such as buttons or text vews had to be placed manually at a fxed poston and wth a fxed sze, e.g. n Mcrosoft Foundaton Class lbrary (MFC). Ths can become very tedous as soon as new controls have to be nserted or the layout of exstng controls has to be modfed. Modern GUI frameworks solve ths problem by offerng layout managers whch allow developers to poston the controls n a user nterface more abstractly. Rearrangng and modfyng a GUI can become easer and a re-layout of the GUI at dfferent wndow szes can be done automatcally by the layout manager. Furthermore, the use of a layout manager often leads to more consstent GUIs snce t can make sure that the controls, the layout tems of the layout, are well algned and consstently spaced. To setup a GUI usng a layout manager, the developer has to specfy a set of layout specfcatons. To keep thngs as smple as possble for the developer, the layout specfcatons that are requred to defne a layout wth good vsual appearance should be small. Ths means that layout specfcatons usually do not specfy every sngle detal about a layout, but leave some of the detals to the layout manager. Interestng are the cases when the avalable space n a GUI s nsuffcent or when there s more space avalable than needed. Both cases happen regularly when wndows are reszed, e.g. to adjust a GUI to the sze of the avalable screen space. For example, consder a smple layout contanng just two controls n a horzontal row, spannng the complete wndow sze (Fgure 3). Dependng on the wndow sze, the layout manager has to decde what control wdth s the best to yeld a vsually appealng result. An mportant hnt for that decson can be the control s preferred sze, whch descrbes the sze preferred by the control n the absence of any other constrants. Ths paper addresses the followng overall research queston: how should the space avalable n a GUI be dstrbuted among the layout tems? To answer ths queston, we need to consder what layouts are perceved as aesthetcally pleasng, as well as the solvng strateges that determne the layouts. We motvate a mnmal devaton strategy to dstrbute the avalable space. In a constrant based layout system ths can be mplemented by usng a quadratc solvng strategy and we show how ths solvng strategy s superor to a lnear solvng strategy. In ths paper we focus on a subproblem of ths general queston. We focus on a very restrcted class of layouts, and we are consderng a restrcted class of GUIs, namely GUIs that 72

2 are comprsed solely of buttons. Ths s worthwhle snce t allows us to solate possble cross-nfluencng factors. Our restrcted experments yeld nterestng results that can now be tested n other more general classes of layout. In the feld of typesettng and document layout much research has been done about how to create accessble and clear document layouts usng automated layout systems [9]. However, no study has been undertaken as to how dfferent solvng methods compare to each other wth respect to aesthetcs. The compared solvng strateges are equal dstrbuton, weghted dstrbuton and mnmal devaton. All solvng strateges were mplemented and evaluated usng the Auckland Layout Model (ALM) [11] a constrant based layout manager. However, the results presented n ths paper are not lmted to the ALM and can be appled to other layout managers as well. A constrant based layout system s able to model all nterestng layouts and solvng strateges for our research. Ptfalls of the solvng strateges are analyzed and solutons for them are presented. We performed a user evaluaton where the equal dstrbuton, weghted dstrbuton and mnmal devaton strateges were compared to each other. Our study shows that the mnmal devaton strategy gves good results for small and large layout szes, whle the other solvng strateges only demonstrate ther strength ether at small or at large layout szes. In the next secton an ntroducton to layout managers and the dfferent types of common layout classes s gven. Secton 3 gves an overvew of related work, ncludng how other layout manager dstrbute avalable space and how Gestalt prncples are used n other felds to get vsually appealng results. A detaled descrpton of constrant based layout and how systems of layout constrants can be solved usng lnear and quadratc objectve functons s gven n Secton 4. Secton 5 compares the effect of lnear and quadratc objectve functons on the vsual qualty of the layout. In Secton 6 a user evaluaton s presented that provdes answers to the research queston. It shows how the layouts produced by dfferent solvng approaches are perceved aesthetcally by users. The results ndcate whch solvng strateges generally lead to more beautful layouts. 2. LAYOUT MANAGERS (OVERVIEW) In early GUI developer toolkts, GUI tems had to be placed manually n certan fxed poston. Ths statc approach can be tedous and error prone, especally durng the desgn process where GUI tems are moved around qute often. In ths case, already placed tems have to be rearranged when nsertng a new element. A layout manager asssts the developer n settng up dynamc graphcal user nterfaces. GUI tems managed by a layout manager are placed automatcally followng certan rules. Furthermore, the layout manager can adjust the layout, e.g. when the user reszes a wndow. In ths case a layout manager repostons GUI tems dynamcally to ft nto the new sze. Another case s a font change or a change of the applcaton language, e.g. from Englsh to German. Generally, n both cases the dsplayed text wll change ts sze and thus requres the rearrangement of GUI tems. Usng a statc approach makes t frustratng for the developer to handle such cases. However a layout manager handles these use cases wth ease wthout further work from the developer. Anythng that can be placed nto a layout s called a layout tem. The most mportant layout tems are GUI controls, e.g. buttons or text labels. Other mportant layout tems are spacers, whch are nvsble and can be placed between other layout tems. A spacer can occupy a fxed amount of space or can act lke a sprng to push other layout tems asde. In ths way, a spacer can be used to refne a layout and gve t the desred shape. In order to create nested layouts t s mportant to have an tem that can hold another layout. Ths can easly be acheved by treatng a layout as a specal layout tem. In the followng we assume that layout tems are rectangular. In general a layout tem has a mnmal, a maxmal and a preferred sze. The preferred sze s the sze the layout tem should assume f there are no other constrants for the tem sze. Ths can be llustrate wth a pnched sponge whch, after releasng t, expands to ts orgnal or preferred sze. From the sze values for each layout tem n the layout, the correspondng sze values of the complete layout can be calculated. Smlar to a sngle layout tem, the preferred sze of a whole layout s the sze t should assume f there are no other constrants. Notce that n a layout of mnmal sze, not all layout tems may have ther mnmal sze. Ths s because other larger layout tems may be preventng the layout from shrnkng further. In general, a layout or a layout tem has a sze dfferent from ts preferred sze. Thus, there s a sze dscrepancy between the actual sze and the preferred sze. There are dfferent exstng types of layout n varous frameworks (see Secton 3). Most of these frameworks provde specal layout classes for specal types of layout problems, e.g. group layout, grd layout or flow layout. Usually these specal layouts can be combned by creatng nested layouts. These most common layout classes are descrbed brefly n the followng sectons. 2.1 Group Layout A group layout s a smple 1-dmensonal layout that can hold tems sde by sde n a sngle row or column. There are two man varants of ths layout, a horzontal group layout whch can hold a row of tems and a vertcal group layout whch can hold a column of tems. By nestng horzontal and vertcal group layouts many useful layout confguratons can be created. However, ths type of layout s not suffcent for more complex layouts, e.g. a lnk between layout tems n two dfferent group layouts s not possble. 2.2 Grd (Bag) Layout Some of the shortcomngs of a group layout can be avoded by usng a grd layout, also known as a table layout. Here, a layout tem can be placed n a 2-dmensonal table. A layout tem can occupy more than one cell n the grd, and thus t s possble to create complex layouts. Furthermore, t s possble to create a lnk between tems not drectly adjacent, e.g. by placng them n the same row or column. Ths makes the grd layout reasonably flexble and powerful. The grd layout can be tuned by gvng the rows and columns specal weghtngs. Ths s useful n specfyng whch row and column should use more space compared to the other rows and columns. 2.3 Flow Layout A flow layout s bascally a horzontal group layout that can span over multple rows f tems do not ft nto one row. Ths s comparable wth a lne of text n a word processor: f the end of the lne s reached, the text s contnued n the next lne. An example of a flow layout s a button bar that becomes a mult-lne button bar n case the wndow becomes smaller than the button bar wdth. 73

3 2.4 Constrant-Based Layout In a constrant-based layout, the layout specfcatons are descrbed by constrants usng lnear equaltes and nequaltes. An example for a smple GUI constrant for a horzontal two-button layout s button1 rght = button2 left. There are two types of constrants: hard constrants, whch have to be satsfed, and soft constrants, whch can be volated f necessary. The way how soft constrants are solved depends on the mplementaton of the constrant solver and can be used to control the fnal vsual appearance of the layout. Layouts created wth a group or grd layout can alternatvely be created usng a constrant-based layout manager. However, constrant-based layout managers support even more complex layouts, whch makes them very powerful. For example, n a grd layout, layout tems are always algned to a outer fx grd whle n a constrant-based layout a layout tem can be algned relatve to another layout tem and so s not bound to the fx grd. Constrant-based layouts are dscussed n detal n Secton RELATED WORK 3.1 Layout Managers Some of the most promnent GUI frameworks that provde layout mangers are Qt 1, Java AWT [16], Cocoa 2, Wndows Forms [13], GTK+ 3 and wxwdgets 4. Most of these layout managers dstrbute avalable space n a smple way, however, dfferent managers use dfferent methods of dstrbuton. How exactly avalable space s dstrbuted s nether well documented nor s there any explanaton why a partcular method of dstrbuton has been chosen. For example, the Grd Bag Layout from the Java AWT framework dstrbutes the layout sze dscrepancy usng weghts whch can be assgned to columns and rows (weghted dstrbuton). Ths means generally that an tem grows or shrnks by sze tem = dscrepancy weght tem / tems weght. The Qt toolkt follows a dfferent approach and dstrbutes or takes avalable space avalable space equally from all tems n the layout (equally dstrbuton): sze tem = dscrepancy /#tems Another approach s mplemented n the Haku OS 5. Here, for all tems n a group layout the sum of the quadratc tem dscrepances s mnmzed (mnmal devaton). Ths s descrbed n more detal n Secton Smlar to the ALM layout manager used n ths research (see Secton 4), the Java layout class SprngLayout and the layout manager of the Mac OS Cocoa API, Auto Layout, s based on constrants. In Auto Layout, the programmer can specfy lnear constrants n the form y = m x + b between two varables x and y. These varables could, for 1 Qt a cross-platform applcaton and UI framework, Cocoa Auto Layout Gude, apple.com 3 The GTK+ project, 2011, 4 wxwdgets Cross-Platform GUI Lbrary, 2011, The Haku Operatng System, 2011, haku-os.org example, be the wdth or the edge of a layout tem. However, ths approach s not as powerful as general constrantbased layout managers such as ALM, whch allow to specfy more complex constrants and make t possble to create layouts n a more abstract way. For example, constrants wth multple varables or varables not connected to any layout tems are not possble. A wde overvew of dfferent technques for solvng GUI constrants s gven n [1]. Besdes methods of dstrbutng the dscrepancy, other approaches have been tred to adapt a layout to dfferent szes. Supple s an automated system that can adapt layouts to changes n dsplay sze, n partcular to dfferent devces. The system supports dscrete changes of layout tems,.e. t changes the controls that are used wthn an nput form dependng on the avalable space [15]. Optmzatons of more expermental layouts has been studed for the GADGET framework [7]. For example, GADGET targets problems lke how a GUI can be automatcally generated usng certan optmzaton rules. 3.2 Layout Aesthetcs The scentfc feld of Gestalt psychology [10] covers prncples about the percepton of shapes and groups of shapes. For example, the law of equalty states that smlar shapes are perceved as a group, and the law of proxmty states that shapes whch are placed close to each other are perceved as a group. These fndngs can be transferred to user nterfaces, where algned controls are perceved as a group. The law of equalty can be appled when tems are placed n the same row or column and share the same heght or wdth. When tems are algned close to each other the law of proxmty can be appled. Ths can be used to group related controls [8] to acheve a clear layout appearance. Gestalt psychology s the bass for many felds and s used n most aesthetcs related papers. Gestalt prncples can also be appled to conventonal typography [9] as well as to web documents [3]. Here they can help to structure a document to make t easer to read and understand. Another applcaton s the pagnaton problem, whch targets the queston how to best dstrbute content over multple pages, e.g. how to place fgures and text n a complex document to produce vsually pleasng results [14]. In the feld of graph layout, a set of smlar layout aesthetcs has been used to optmze graphs [4]. The knowledge of Gestalt prncples can help to layout UI objects n a more pleasant way [3]. Layout mangers often make t easer to set up good layouts, wthout havng to defne the fnal layout n all ts detals. However, they do not apply Gestalt prncples all by themselves: f Gestalt prncples are used depends on how a GUI desgner specfes a layout, not on the layout manager. 4. CONSTRAINT-BASED LAYOUTS In a constrant-based layout manager, user nterface layouts are specfed mathematcally as constrant problems. Ths makes t possble to create complex and flexble layout specfcatons, and calculate actual layouts usng numercal constrant solvng methods [12]. The Auckland Layout Model (ALM) [11] s the constrant-based layout manager used for ths research, and a sutable representatve of constrant-based layout n general. ALM was chosen because all common layout specfcatons and solvng strateges can be emulated usng ALM. The dscrepancy dstrbuton methods dscussed here can also be used wth other constrant-based layout managers. Each layout tem n ALM s connected to a tab on each of ts four borders; a tab s a horzontal or vertcal grd lne n the layout. Relatons between tabs, and so between 74

4 dfferent layout tems, can be specfed usng layout constrants. For example, to place two buttons besde of each other, the rght border of the left button shares a tab wth the left border of the rght button. A rectangular space, surrounded by tabs, that s occuped by a layout tem s called an area. The developer s able to add arbtrary constrants to the layout specfcaton. For example, an addtonal constrant lke wdth button1 = 2 wdth button2 could be used to ensure that the wdth of button1 s two tmes as bg as the wth of button2. Compared to a grd layout where rows and columns have a fxed order, tabs do not have a strct order whch allows more flexble layouts. There are two knds of constrants used to specfy a layout. Frst, hard-constrants are needed to set the fxed propertes of a layout tem, such as ts mnmum and maxmum sze. Secondly, soft-constrants are used to gve a hnt how a layout tem should look lke, e.g. the tem sze should be close to the preferred tem sze. The actual nfluence of the soft-constrants on the fnal layout vares dependng on the solvng strategy used. 4.1 Specfyng Constrants Constrants that have to be satsfed exactly are called hard-constrants. A hard-constrant could be ether an equalty or an nequalty constrant, and can be descrbed by A x = b A x b equaltes nequaltes Here A s the constrant matrx, x s the tab or varable vector and b s a constant vector. Soft constrants are specfed n the same way as hard constrants, but because they can be volated, t s often possble to prortze them. In case of a conflct between soft constrants, the constrant wth the smallest prorty wll be volated most. Smlar to hard constrants, developers may add custom soft-constrants to a layout specfcaton. The most mportant use case for soft constrants s the specfcaton of preferred szes for layout tems. Preferred sze constrants are a common way to gve layout tems a reasonable sze,.e. make them as close to ther preferred sze as possble, whle stll accommodatng sze adjustments. For example, the preferred wdth of a button s the wdth needed to dsplay the button label plus some extra space for the border. Ths border s actually not completely needed and labels can be abbrevated, so the button could be narrower than the preferred wdth. Smlarly, t s possble to make the button wder than the preferred wdth. The solver has to decde whch wdth s the best, consderng that the tem needs to ft nto the overall layout, e.g. that t algns wth ts neghbors. Usng a preferred wdth soft constrant, t wll choose a sze as close to the preferred wdth as possble. The mathematcally descrpton of soft-constrants depends on the objectve functon used, and s dscussed later n Secton Rows and Columns A layout tem s always connected to two horzontal and two vertcal tabs. The two horzontal tabs can naturally be regarded as a row, and the two vertcal tabs as a column. Multple layout tems sharng the same horzontal or vertcal tabs also share the same row or column, respectvely. In ths way there can be nterruptons n a row or a column, e.g. there could be another tem between two tems n a row that s only connected to one or even none of the horzontal row tabs. Ths s not the tradtonal defnton of rows and columns but allows a smple groupng of the generally unordered tab system. 4.3 Layout Optmzaton A sutable constrant solver for user nterface constrants must be able to solve the hard-constrants (Secton 4.1) and must also handle soft-constrants. Soft-constrants are descrbed separately from hard-constrants by a scalar objectve functon. In general, ths objectve functons s mnmzed whle satsfyng the hard-constrants at the same tme Lnear Objectve Functon The smplest approach for an objectve functon s a lnear objectve functon, whch can be utlzed to descrbe soft-constrants and optmzed usng lnear programmng. Techncally, ths s done by frst addng a hard-constrant for each soft-constrant, of the form a soft, x + s shrnk s grow = b soft. Here, s shrnk and s grow are two new postve slack varables whch express that the soft-constrant can be volated n both drecton. The goal s to keep both slack varables as small as possble to volate the soft-constrant as lttle as possble. The penalty factors p shrnk and p grow can be used to prortze a soft constrant, wth a large penalty factor meanng that growng or shrnkng away from the optmal values s suppressed. Fnally, ths leads to the lnear objectve functon, whch s the weghted sum of all slack varables, and whch must now be mnmzed [11]: p grow, s grow, + p shrnk, s shrnk, mn. (1) soft A sutable solver for ths purpose s lp solve [2], whch uses the smplex algorthm [5]. One of the problems of a lnear objectve functon s that mnmzng (1) generally leads to many vald solutons; the lnear approach s non-determnstc. Ths means that not all soft-constrants are volated n a unform way, e.g. only a few constrants are volated and ts not clear whch constrants are volated Quadratc Objectve Functon A determnstc approach s to mnmze the square of the devaton from a desred target value. For smple preferred sze constrants ths can be wrtten as (x pref ) 2 mn. soft More general, the soft-constrants n matrx form A soft x = b pref can be used to form the quadratc objectve functon 1 2 xt A T softa soft x b T pref A soft x mn. Replacng A T softa soft = G and b T pref A T soft = g T ths could be smplfed to: 1 2 xt Gx + g T x mn Ths s a known quadratc programmng optmzaton problem and could, for example, be solved usng the Actve Set method [6]. To use the Actve Set method, frst a vald 75

5 base soluton for the hard constrants has to been found. Contnung from that base soluton, the Actve Set method mnmzes the quadratc objectve functon, whle stayng n the soluton space of the hard-constrants. Soft constrants can be weghted by a penalty p. For the smple preferred sze constrants, ths leads to the objectve functon p 2 (x pref ) 2 mn. soft Constrants wth larger penaltes p wll be volated less than constrants wth smaller penaltes. Notce that compared to the lnear objectve functon only one penalty factor for growng and shrnkng can be appled. Thus the developer can not specfy f a layout tem s more lkely to grow than to shrnk. However, by combnng two soft nequalty constrants, e.g. x > b and x < b, a smlar growng and shrnkng behavor can be acheved. A soft nequalty constrant s an nequalty constrant that can be volated f necessary. Soft nequalty constrants are not drectly supported usng a quadratc objectve functon but can be constructed from a hard nequalty constrant and a normal soft constrant. To construct a soft nequalty constrant a postve slack varable s has to be added to the basc nequalty. For example, c x < r becomes c x s < r, c x > r becomes c x + s > r. Ths means s can always be chosen to satsfy the nequalty. However, only f other constrants requre to volate the soft nequalty constrant, then s should be greater than zero. Ths can be acheved by addng the soft constrant s = 0 wth a suffcent hgh penalty. 5. AESTHETICS PROBLEMS OF CONSTRAINT-BASED LAYOUT Descrbng soft-constrants usng a lnear or a quadratc objectve functon leads to dfferent behavors when dstrbutng the sze dscrepancy to the layout tems. In ths secton, the behavor of preferred sze soft-constrants s dscussed from an aesthetc pont of vew. 5.1 Lnear Objectve Functons Cause Nondetermnsm An example for a smple homogeneous layout s a layout contanng just three buttons wth exactly the same propertes. Fgure 1 a) shows the resultng layout solved by lp solve (lnear objectve functon). As expected, all hard-constrants are satsfed. The soft-constrants for the frst two buttons are matched exactly, meanng the heght s equal to the preferred sze of the buttons. The only volated soft-constrant s the preferred heght of the thrd button. From the aesthetc pont of vew, ths layout confguraton looks odd. Because all buttons have the same propertes, one would expect that all buttons take the same amount of space. The heght rato between the dfferent buttons s not specfed by the layout, but s a result of how the solver solved the constrants. It s theoretcally even possble for the rato to changes nondetermnstcally durng reszng. Followng Gestalt prncples, the three buttons wth dentcal propertes should be perceved as a group, whch s not the case here. One soluton to ths problem s to manually specfy a sze relaton between the related tems, but ths s extra (a) (b) Fgure 1: Smple three button layout wth all buttons havng the same propertes. The layout s solved usng a) a lnear and b) a quadratc objectve functon. work for the developer. A better soluton s to leverage the advantages of a quadratc objectve functon, whch mnmzes the devaton to the preferred tem sze for each tem, not just the sum of devatons over all the tems. Fgure 1 b) llustrate how a quadratc objectve functon leads to the desred unform result Proportonalty Scale Varables The problem of the lnear objectve functon, as descrbed above, could partally be solved by ntroducng addtonal free scalng varables s. These scalng varables can be used to make the sze of a layout tem proportonal to ther preferred sze. To do so, the preferred sze soft constrants have to be rewrtten to: x x pref s = 0. However, the approach can only be used n specal cases,.e. when all layout tems can get a sze proportonal to ther preferred sze. In case ths requrement s not satsfed anymore, the soft-constrants have to be volated agan whch leads to the same problem of non-determnsm as descrbed prevously. 5.2 Sprng Effects One dsadvantage of mnmzng the devaton to the preferred szes s that ths sometmes leads to an unwanted sprng effect. Ths s an analogy between preferred sze constrant and mechanc sprngs, pullng or pressng an tem to ts preferred sze. The problem occurs when multple sprngs are coupled and thus ther strengths combned to a resultng force. Such a couplng could, for example, be observed n a multrow layout lke n Fgure 2. In the frst row three sprngs and n the second row two sprngs are coupled. Because each button has the same preferred heght, ths results n the same descrptve sprng force F s for each button. Thus the frst row has a sprng force of 3 F s and the second row a force of 2 F s. For the solved layout ths means both rows have a dfferent heght. Ths s certanly a lmtaton of constrant-based layout because snce all tems have the same propertes one would expect, accordng to the equalty Gestalt law, two equal szed rows. In such a case a relaton between rows has to be specfed explctly, e.g. by applyng a hard-constrant that keeps the heght of both row constant. Another, more general soluton s to defne preferred sze constrants on whole rows and columns only. 76

6 Fgure 2: Sprng effect: Three buttons n the frst row pullng stronger to ther preferred sze than the two buttons n the second row. A row or column s defned by two tabs and at least one layout tem between these tabs. Rows are bordered by horzontal tabs and columns by vertcal tabs. Layout tems connected to the same two tabs are assocated wth the same column or row (Secton 4.2). To solve the sprng effect problem, the preferred sze constrant s only appled for rows and columns and not for each layout tem. Snce there could be multple tems n a row or a column, the weghted average of the preferred szes of the tems s used, usng penaltes as weghts. In the upper example, ths has the affect that both rows have the same preferred heght, and thus get the same heght when solvng the layout. 6. EVALUATION There are many ways to place layout tems n a layout. Smlar to a typesettng system, an mportant goal s to to create layouts that are aesthetcally pleasng for the user [9]. In ths secton, we evaluate dfferent solvng strateges wth regard to aesthetc percepton. The dfference n the perceved aesthetcs of layouts generated by dfferent solvng strateges are small and dffcult to measure. For some users t may not be obvous what the dfferences are between the same layout rendered wth dfferent solvng strateges. Furthermore, the crtera of aesthetcs are subjectve and vary between users. An mportant aspect of ths evaluaton s the analyss of the resze behavor of a layout. Layouts should look pleasng at dfferent szes, not just for a partcular ntal sze. Therefore, the evaluaton wll consder dfferent szes of the same GUI, a small sze close to the layout mnmum sze and a large sze approxmately twce as large as the preferred layout sze. Here, three solvng strateges that place tems n a 1-dmensonal and 2-dmensonal layout are analyzed. All layouts and solvng strateges descrbed n the followng were mplemented usng ALM s constrant system. 6.1 Sngle-Row Layouts A very smple layout s a layout consstng of just a sngle row, e.g. a group of buttons arranged besdes each other. Three dfferent solvng strateges to dstrbute the sze dscrepancy to the buttons n the row are evaluated. Frst, equal dstrbuton gves each tem the exact same amount of space n a lne. Here the preferred sze of an tem s not take nto account. Note that the theoretcal mnmum sze of a layout can generally not be reached here,.e. when one of the layout tems reached ts mnmum sze then the other ones cannot be made smaller ether. In practce ths can be solved by volatng the equalty constrant once an tem reaches ts mnmum sze. Secondly, weghted dstrbuton keeps the sze rato between tems n a lne constant. Ths means a weght s assgned to each tem. The layout tem szes are gven by Sze tem = Sze layout w tem/ w. tems For ths evaluaton, the tem weght s chosen as the relatve tem sze at a small ntal layout sze, where the tems are close to ther preferred sze. Thrdly, the tem szes are determned by calculatng the mnmal devaton from the preferred sze for each layout tem. Ths can be acheved wth a solvng strategy that uses a quadratc objectve functon (see Secton 4.3.2). For very large layouts, the mnmal devaton approach converges to the equal dstrbuton approach because the preferred sze becomes small compared to the actual tem sze. For layout szes close to the layout s preferred sze, the result s close to the weghted dstrbuton because the weghts are chosen to match the preferred sze. An example for a smple two-button row at small layout sze s shown n Fgure 3. For smplcty, no tem maxmum sze s taken nto account. Maxmum szes result n more complex layouts and thus make the analyss of the evaluaton results more complcated. For example, when the maxmum of one layout tem n an equally dstrbuton layout s reached, the layout cannot be reszed any further. (a) (b) Fgure 3: Two dfferent solvng strateges for a smple two-button layout: (a) mnmal devaton and (b) equal dstrbuton. 6.2 Mult-Row Layouts Another nterestng queston s how the three dfferent solvng strateges from the prevous secton perform n a mult-row layout. In ths evaluaton, a two-row and a three-row layout s evaluated wth regard to ts perceved aesthetcs. The two-row layout has three buttons n the frst row and two button n the second row. In the threerow layout, another row wth two buttons s appended. The frst case we consdered n ths study s a mnmal devaton approach, where the szes of the tems are chosen as close to ther preferred szes as possble. However, as shown n Fgure 4 (a), ths leads to an rregular, staggered appearance, whch s unusual for mult-row layouts. In mult-row layouts, the tems are usually algned n a grd, whch comes naturally when usng common grd-based layout managers. Therefore, we also evaluate some layouts where the tems are algned n a grd, wth each tem takng up as many cells as seems natural for ther gven preferred sze. More specfcally, we want to compare two dfferent solvng strateges for the grd-algned layouts: ether the space of the tems n the frst row uses an equal dstrbuton, as n Fgure 4 (b), or t uses a weghted dstrbuton, as n Fgure 4 (c). The szes of the tems n the second and thrd row follow from ther algnment wth the frst row. If the mnmal devaton approach were used for the frst row, wth the tems n the second and thrd row beng algned to the frst row, the resultng layout would look very smlar to the cases (b) and (c), dependng on the layout sze, 77

7 Queston Score I easly saw the dfference between the layouts. 1.3 It was easy to judge the dfferent layouts. 0.6 I have experence wth desgnng UIs. 1.3 I have graphcs desgn experence. 0.3 Table 1: Average questonnare ratngs on a standard 5-pont Lkert-scale ( 2 to +2). therefore we dd not examne ths case n separaton. (a) (b) (c) Fgure 4: Three row layout at small layout sze. (a) Mnmal devaton wthout algnment. (b) Equal dstrbuton wth algnment. (c) Weghted dstrbuton wth algnment. 6.3 Methodology Partcpants were asked to compare varous sngle- and mult-row layouts shown on paper. Each layout was rendered at two dfferent wdth: a small wdth close to the mnmal wdth, and a larger wdth about twce as wde as the small wdth. The partcpants were asked to judge the layouts by ther vsual appearance and rank them accordngly, whch s expressed by a score: the worst layout got zero ponts, the layout n between got one pont, and the best layout got two ponts. The partcpants were nstructed to consder f every button gets a reasonable amount of space for ts label. Furthermore, the personal preferences for the button placement and sze should be taken nto account. After judgng the dfferent layouts, the partcpants were asked to fll n a questonnare. The questonnare used a standard 5-pont Lkert-scale, followed by open questons askng the partcpants to descrbe the crtera for ther layout preferences. 6.4 Results The study had 15 partcpants. All of them had a Computer Scence background, and most of them had experence n desgnng graphcal user nterfaces but only casual experence n graphcs desgn. Whle t was easy for them to see the dfferences between the gven layouts, t was not easy for them to judge them (see Table 1). To determne the sgnfcance of the dfferences n preference, a one-sded Welch t-test s used Sgnfcant Preference Dfferences For all the sngle-row layouts, there s no sgnfcant dfference between the mnmal devaton and the equal dstrbuton layouts. For large layouts, ths s expected because mnmal devaton and equal dstrbuton layouts look almost dentcal. For the three-button layout n ts large sze, the mnmal devaton and the equal dstrbuton layouts are sgnfcantly (p < 0.05) better than the weghted dstrbuton layout. For the mult-row layouts, the grd-algned layout s clearly preferred over the unalgned mnmal devaton layout. For the two-row layout, the devaton layout gets only 10% for the small sze, and 15% for the large sze. The scores were even worse for the three-row layout, where only two partcpant lked the mnmal devaton layout. Ths s an nterestng fndng and means a symmetrcal layout where the layout tems borders are algned to each other s more pleasant than a layout where each ndvdual tem gets the space closest to ts preferred space. Ths can be explaned wth Gestalt psychology: objects that are algned to each other are perceved as a group, thus t s easer for us to understand the layout, whch makes t preferable [8]. For the usage of constrant-based layout managers lke ALM, ths ndcates t s better to reuse exstng tabs to create more algnment n layouts Preference Trends Apart form the clear fndngs of the prevous secton, some other nterestng observatons can be made from the taken data. Frst, a smlar tendency as n the mult-row layouts can be seen for the sngle-row layout n the large sze: for large layout szes, the equal dstrbuton layout s more lked than the weghted dstrbuton layout. When combnng the results from the two- and the three-rows layouts, ths tendency s sgnfcant at the p < 0.1 level. A contrary tendency can be seen at small layout szes. For the mult-row layouts at small layout szes, the weghted dstrbuton layout s preferred over the equal dstrbuton layout. When the two- and three-row layout results are combned, ths s sgnfcant at the p < 0.1 level. In the small sngle-row scenaro, where mnmal devaton layout and weghted layout look dentcal, ths observaton cannot be made. However, at least t could be sad that the equal dstrbuton layout does not lead to better results than the weghted dstrbuton layout. To sum up, there s a tendency that at small layout szes weghted dstrbuton layouts are more preferred than equal dstrbuton layouts. At large szes, the equal dstrbuton and mnmal devaton layouts are preferred above the weghted dstrbuton approach. Ths means that the mnmal devaton approach, whch s equal to the weghted dstrbuton at small layout szes and very smlar to the equal dstrbuton at large layout szes, s well-suted for all the szes, small and large. Furthermore, the mnmal devaton soluton scales smoothly down to small layout szes where t seems to be mportant that each tem gets a far amount of the sze dscrepancy. For large layouts, the mnmal devaton approach roughly dstrbutes all layout tem equally, whch has been found to be the most preferred soluton for large layouts Qualtatve Responses When asked about the crtera for preferrng one layout over another, the most frequent answer from the partcpants was that algnment of the buttons s an mportant factor (6 partcpants). For others, enough space for the button labels and the button margns was mportant (3 partcpants). Furthermore, three partcpants stated 78

8 that they prefer layouts wth equal button sze. These qualtatve statements are consstent wth the fndngs from the quanttatve layout evaluaton. Frst, algned mult-row layouts are preferable over unalgned layouts. Secondly, for small layout szes, there s the trend that mnmal devaton layouts, where the sze dscrepancy s unformly dstrbuted on the button margn, are more lked. Thrdly, for large layout szes, each layout tem should get the same amount of space, whch s the case n equal dstrbuton and mnmal devaton layouts. 7. CONCLUSION Layout managers are a convenent way to arrange tems n a layout, ndependent from the actual layout sze. All layout managers need to defne a strategy to dstrbute addtonal or lackng space,.e. the dscrepancy between the preferred and the actual layout sze. Lookng at prncples such as the Gestalt laws, t s clear that the dstrbuton strategy s lkely to affect the aesthetcs of a layout. However, our revew of exstng layout managers shows that there s no agreement on how ths s best done. Usng constrants s the most powerful approach for layout management, and all other approaches can be reduced to t. To deal wth conflctng constrants such as preferred szes, constrant solvers have to optmze an objectve functon. We have dentfed two ssues that affect constrant-based layout managers: a lnear objectve functon can lead to nondetermnstc layouts, and sprng effects can lead to layout dstortons. For the latter one, we have dentfed a soluton that makes sure preferred sze constrants are specfed for rows and columns rather than for ndvdual tems. In an emprcal evaluaton, we have nvestgated the effects of three layout solvng strateges equal dstrbuton, weghted dstrbuton and mnmal devaton on aesthetcs. The evaluaton shows that whle a weghted dstrbuton tends to be preferred at small layout szes, an equal dstrbuton s preferred at large layout szes. As a good tradeoff, the mnmal devaton approach yelds aesthetcally pleasng results at small and large layout szes. Another fndng s that users prefer GUI layouts n whch the tems are algned over layouts wth less algnment a fndng that s consstent wth the Gestalt prncples. [7] J. Fogarty and S. E. Hudson. Gadget: a toolkt for optmzaton-based approaches to nterface and dsplay generaton. In UIST, pages ACM, [8] S. Hem. The resonant nterface: HCI foundatons for nteracton desgn. Pearson/Addson Wesley, [9] D. E. Knuth. The Computers & Typesettng, Vol. A: The Texbook. Addson-Wesley, [10] W. Köhler. Gestalt psychology : an ntrod. to new concepts n modern psychology. Lverght, [11] C. Lutteroth, R. Strandh, and G. Weber. Doman specfc Hgh-Level constrants for user nterface layout. Constrants, 13(3), [12] C. Lutteroth and G. Weber. Modular specfcaton of gu layout usng constrants. In Proceedngs of the 19th Australan Conference on Software Engneerng, pages IEEE Computer Socety, [13] M. MacDonald. User nterfaces n VB. Net: wndows forms and custom control. Apress Seres. Apress, [14] M. F. Plass. Optmal pagnaton technques for automatc typesettng systems. In Internatonal Symposum on Physcal Desgn, [15] D. S. Weld, C. R. Anderson, P. Domngos, O. Etzon, K. Gajos, T. A. Lau, and S. A. Wolfman. Automatcally personalzng user nterfaces. In G. Gottlob and T. Walsh, edtors, IJCAI, pages Morgan Kaufmann, [16] J. Zukowsk. Java AWT reference. O Relly & Assocates, Inc., References [1] G. J. Badros, A. Bornng, and P. J. Stuckey. The cassowary lnear arthmetc constrant solvng algorthm. ACM Trans. Comput.-Hum. Interact., 8(4): , Dec [2] M. Berkelaar, P. Notebaert, and K. Ekland. lp solve: (Mxed nteger) lnear programmng problem solver [3] J. Borchers, O. Deussen, A. Klngert, and C. Knörzer. Layout rules for graphcal web documents. Computers & Graphcs, 20(3): , [4] M. K. Coleman and D. S. Parker. Aesthetcs-based graph layout for human consumpton. Softw. Pract. Exper., 26(12): , Dec [5] G. B. Dantzg. Lnear Programmng and Extensons. Prnceton Unversty Press, Prnceton, NJ, [6] R. Fletcher. Practcal methods of optmzaton; (2nd ed.). Wley-Interscence,

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

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

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

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

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

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

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

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

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

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

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

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 mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 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 A mathematcal programmng approach to the analyss, desgn and

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

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

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

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

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

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

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

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

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

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

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

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

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

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

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

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

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

A Facet Generation Procedure. for solving 0/1 integer programs

A Facet Generation Procedure. for solving 0/1 integer programs A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,

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

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

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

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

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

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

EXTENDED BIC CRITERION FOR MODEL SELECTION

EXTENDED BIC CRITERION FOR MODEL SELECTION IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7

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

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

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

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

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

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

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

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

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

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

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

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

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

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

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law) Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

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

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

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

Cable optimization of a long span cable stayed bridge in La Coruña (Spain) Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span

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

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

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter estimation for incomplete bivariate longitudinal data in clinical trials Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

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

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design for Reliability: Case Studies in Manufacturing Process Synthesis Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

11. APPROXIMATION ALGORITHMS

11. APPROXIMATION ALGORITHMS Copng wth NP-completeness 11. APPROXIMATION ALGORITHMS load balancng center selecton prcng method: vertex cover LP roundng: vertex cover generalzed load balancng knapsack problem Q. Suppose I need to solve

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

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

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information