Bring Your Own Coding Style

Size: px
Start display at page:

Download "Bring Your Own Coding Style"

Transcription

1 Bring Your Own Coding Style Naoto Ogura, Shinsuke Matsumoto, Hideaki Hata and Shinji Kusumoto Graduate Shool of Information Siene and Tehnology, Osaka University, Japan {n-ogura, shinsuke, Graduate Shool of Information Siene, Nara Institute of Siene and Tehnology, Japan Abstrat Coding style is a representation of soure ode, whih does not affet the behavior of program exeution. The hoie of oding style is purely a matter of developer preferene. Inonsisteny of oding style not only dereased readability but also an ause frustration during programming. In this paper, we propose a novel tool, alled STYLECOORDINATOR, to solve both of the following problems, whih would appear to ontradit eah other: ensuring a onsistent oding style for all soure odes managed in a repository and ensuring the ability of developers to use their own oding styles in a loal environment. In order to validate the exeution performane, we apply the proposed tool to an atual software repository. Index Terms oding style, style feature, style inonsisteny, software repository, Git I. INTRODUCTION Coding style is a textual representation of soure ode, whih does not affet the behavior of program exeution. Examples of oding style inlude the type of indentation (i.e., tabs or spaes), the existene of a whitespae harater around arithmeti operators, and naming onventions of variables and methods. Although oding style has no effet on the program behavior itself, it does have a signifiant influene on readability and maintainability for developers [1][2]. In a pratial programming environment, a wide variety of styles must be defined in various loations of soure ode. In Elipse, over 3 detailed items of oding style onfiguration, suh as whether a spae is inserted before an open parenthesis in an if statement, are provided. The hoie of oding style is purely a matter of developer preferene [3], whih has generally evolved from his/her programming experiene. For example, the following hoies are known to vary depending on the developer: whether a whitespae is inserted after if/for keywords and method names, whether an open brae { is inserted onto a new line or the same line. The general oding style hanges aording to the evolution of the programming environment. The style limitation of 8 haraters per line originally omes from the physial limit of IBM s punh ard [4]. However, the limit is being relaxed as monitor resolution improves. Currently, Google s Java oding onvention 1 sets the limit to 1. Unifying on a ommon oding style for all soure odes is a signifiant ativity in a o-development environment [5][6]. Inonsisteny of oding style not only dereases readability, but also hinders developer onentration. A developer may 1 feel frustration by being fored to use a style that he/she does not usually use. From the perspetive of understanding software evolution, a history of style modifiations usually beomes noise in a software repository. When a developer ontributes both bug fix and style fix in a single ommit, the resulting problem is referred to as the problem of tangled ode hanges [7]. Despite the fat that a style is defined as a oding onvention for eah projet, it is impossible to fore all of developers to follow the onvention for the entire soure ode. An IDE and style formatter 2 an be used to unify oding style in a loal environment. However, ensuring a onsistent style within a projet (i.e., remote environment) is still diffiult beause default style onfigurations are different for individual tools. In this paper, we takle the following hallenges, whih would appear to ontradit eah other: Ensuring a onsistent oding style for all soure odes managed in a repository. Developers an use their own oding styles (and own tools) in a loal environment. In order to ahieve the above hallenges, we propose a novel tool, alled STYLECOORDINATOR, whih provides bidiretional oding style onversion between individual and projet-defined styles. The tool provides a style-onversion feature and is exeuted by a standard Git lient. The tool formats to a projet-defined style when a developer ommits soure odes to a repository. This behavior solves the first hallenge. The seond hallenge is solved by formatting to an individual style when a developer pulls from a repository. In addition, the tool supports automati extration of style preferene from written soure odes. This feature helps to redue the ost of tool installation. The main ontributions of this paper are: We formulated speifi ases of oding style as style features. We improved an existing extration method of style features. We developed a tool for overoming oding style frustration in a o-development software projet. The tool is still an early prototype in the sense that it only overs one of five ategories of oding styles. However, we believe that our onept may be one of a peaeful solution to holy wars [8] about oding preferenes. 2

2 II. CODING STYLE A. Classifiation of Coding Styles We define a representation of a soure ode as a oding style, whih has no impat on program behavior. The oding style an be broadly lassified as follows, The items are sorted in asending order of influene on program ompilation. Separation of tokens (e.g., spae before open parenthesis in an if statement) Indentation (e.g., spae or tab, number of indentation spaes) Name onvention (e.g., amel ase or snake ase or kebab ase) Delaration order (e.g., alphabetial order or publi method first) Sugar syntax (e.g., if-else statement or ternary operator) Most of the ommon IDEs provide ustomization of eah ategory of oding style. In this paper, we fous only on the first ategory, separation of tokens, beause this ategory inludes a greater number of detailed items as ompared to other ategories. Elipse defines 161 items for the ategory. All of the detailed items may be diffiult to ompletely desribe as oding onventions. We onsider automated style onversion for the ategory to be pratial for use in atual development. B. Style Features In this paper, we define a style feature as a set of information related to oding style. The style feature is omposed of the following three attributes. Type (e.g., spae-before-open-paren-in-if-statement) Loation (e.g., line 3) Value (e.g., presene) The above example means that a whitespae before open parenthesis in if statement in present in line 3. For the style ategory onsidered (separation of tokens), the value an only be presene or absene. The style feature exists in various loations of soure ode. Automati inferene of style onfiguration an be enabled by olleting style features from the developer s own written soure odes. C. Style Inonsisteny Spinellis et al. [9] proposed a degree of style inonsisteny () to show how a soure ode inludes inonsistenies of oding styles. Let a and b be values of a style feature (i.e., presene and absene), and let i be an ID of a style feature. Moreover, let a i be the number of ourrenes of a for style feature i. The degree of style inonsisteny of style feature i, denoted by i, is defined as i = min(a i, b i ) a i + b i Let n be the total number of types of style feature (1 i n). Then, the overall degree of style inonsisteny for all soure odes, denoted by all, is defined as n i all = min(a i, b i ) n i a i + b i developer X int fat( int n ) { if ( n==1 ) return 1; return n*fat( n-1 ); 3. extrat style projet.xml style my.xml int fat( int n ) { if ( n<=1 ) return 1; return n*fat( n-1 ); 1. stage & ommit 2. referred 5. referred 6. hekout proposed tool formatted style rev. n rev. n+1 Git repository int fat(int n) { if (n == 1) return 1; return n * fat(n - 1); 4. modify & ommit int fat(int n){ if (n <= 1) return 1; return n * fat(n - 1); modified soure ode file style definition file Fig. 1: Overview of the STYLECOORDINATOR i takes a value from to.5. A larger value indiates that a higher degree of style inonsisteny exists. For example, when a style type spae-before-open-brae-in-if-statement ours in ten instanes, and only two of the ten instanes inlude a spae, and i takes a value of.2 (2/1). Here, i beomes maximum (.5) when the number of ourrenes of presene and absene are exatly the same. A. Overview III. STYLECOORDINATOR We propose a tool, STYLECOORDINATOR, that solves the following seemingly ontraditory hallenges: ensuring a onsistent oding style for all soure odes managed in a repository and ensuring that developers an use their own oding styles in a loal environment. Figure 1 shows an overview of the proessing flow of the tool. The tool is working on Git as software onfiguration management (SCM). Using a standard Git feature, alled Git attribute, the tool exeuted on both stage and hekout operations in a loal environment. Here, we introdue three use ases of using the tool. Stage and ommit: Developer X uses our tool for the first time. When X stages and ommits his/her written soure ode (step 1), the tool refers a style onfiguration file, whih is provided as a ommon onvention of the projet (step 2). The soure ode is formatted based on the onfiguration and is stored to a repository. In this ase, X s unusual oding style is formatted to the popular oding style. Thus, the first hallenge, unifying the oding style in a repository, is solved. Extrat a style onfiguration file: The tool helps to make a style onfiguration file by extrating style features from their written soure ode (step 3). This extration is based on the onept of. In other words, a major

3 oding style within the developer s ode is assumed to be his/her preferred style. The onrete method of the style extration is desribed in the next Setion. Chekout: Another developer modifies and ommits the soure ode (step 4). When X hekouts from a repository, the tool refers the extrated onfiguration file (step 5) and transforms the soure ode to his/her own style (step 6). Thus, the seond hallenge is solved. soure ode publi void run(int n) { if (n > ) { Step1: Searh style andidates publi void run(int n) { if (n > ) { Step2: Token analysis & syntax analysis syntax tree B. Style Feature Extration 1) Problem of Existing Tehnique: In a o-development environment, the key to dealing with individual oding styles is detailed and aurate style feature extration. Spinellis published a metris measurement tool, alled qmetris 3, in a study on s [9]. The tool supports style feature extration as one of many funtions of metris measurement. However, the tool annot follow syntati information, beause the extration is based only on token analysis. Therefore, extratable types of style feature are oarse and inomplete. Here, we illustrate the problem using a speifi example. The blak triangle ) represents a style feature that annot be aurately extrated by qmetris. if a1 n > ) return b2 ; for a1 int i = b1 ; i < n b1 ; i ++ ) { dosomething a2 i ) b2 ; The tool does not distinguish between ontrol flow keywords (e.g., if, for, and while). As suh, both a 1 s illustrated in the example are regarded have the same oding style as spae-before-open-paren-in-ontrol-statement. On the other hand, a spae before an open parenthesis in method invoation (a 2 ) annot be extrated. Every type of spae before a semiolon (b 1 and b 2 ) is undistinguished beause the tool also ignores the ontext of the program statement. In addition, there are many ases () in whih a style feature is negleted. 2) Proposed Style Extration Tehnique: In order to improve the existing extration method, we propose a method by whih to extrat fine-grained style features based on syntax analysis. Figure 2 illustrates an overview of the proessing flow. The input of the method is a set of Java soure odes, and the output is a set of style features. Step1: Searh spae haraters that are andidates of a style feature. The tool filters some spaes that annot be syntatially omitted (e.g., publi void, and int i). Step2: Generate an abstrat syntax tree by onduting token analysis and syntax analysis. Step3: Extrat all style features from the andidates by heking the syntax tree. Based on the above disussion, we implemented an improved extration tool of style feature 4. The tool is a sub n-ogura/216 format-feature-extrator orresponds to Step3: Resolve style type from syntax tree & make a list of style features type: spae-before-open-parenin-if-statement loation: 76 value: absene style features Fig. 2: Proessing flow of the proposed style extration <profile kind="codeformtterprofile"> type="insert-spae-before-open-parenin-if-statement" value="insert"/> type="insert-spae-before-open-parenin-for-statement" value="insert"/> type="insert-spae-before-open-parenin-method-invoation" value="do not insert"/> </profile> Fig. 3: Example of a style onfiguration file omponent of STYLECOORDINATOR. Although the tool urrently supports Java, the basi onept of extration an be applied to many programming languages. C. Style Configuration A file for style onfiguration is shown in Figure 3. The file is written in XML. Eah individual setting tag orresponds to a style feature. A spae is inserted or omitted based on the value attribute for various loations orresponding to a style type speified in the type attribute. This file is ompatible with a style onfiguration file used on Elipse. Therefore, the onfiguration file of STYLECOORDINATOR an be easily ustomized using Elipse s style onfiguration GUI. D. Implementation and Usage STYLECOORDINATOR is written in Java and published on our website 5. The tool provides style transformation and style extration. In order to ooperate with Git, we use a Git standard feature, alled gitattributes, whih enables ustomization 5 n-ogura/218 style-oordinator

4 of the pre-proessor of the stage and hekout operations. In general, the feature is used to enfore the orret line endings poliy. Here, we desribe the tool usage on a speifi repository. First, a ustom filter sformat must be defined in a gitattributes file. Pre-proessing for all java files is enabled by this definition. $ eho '*.java filter=sformat' >> \.git/info/gitattributes Next, we need to define a preferred style file in a loal environment. The definition is provided by automati style extration or Elipse GUI. In this introdution, the preferred style is designated my.xml and the projet-defined style is designated projet.xml, whih should be managed in a Git repository beause the file is shared in a projet. Finally, we define the atual pre-proessing behavior for the defined filter. The proposed tool is speified to exeute at stage and hekout operations (i.e., filter.format.smudge and filter.format.lean). $ git onfig filter.sformat.smudge \ styleoordinator my.xml $ git onfig filter.sformat.lean \ styleoordinator projet.xml IV. EVALUATION A. Style Inonsisteny in Atual Projets 1) Purpose and Method: The purpose of the study is to survey style inonsisteny during the evolution of Java projets, whereas Spinellis s study foused on the evolution of the C language. We alulate hanges of all from a Java repository. The proposed tool is used for the alulation. The alulation is onduted for all soure odes within the master and trunk branhes. The subjet projets are JUnit4 and log4j. An overview of the projets is shown in Table I. The development histories for over 15 years are stored in GitHub. 2) Result and Disussion: Figure 4 shows the hanges of all and lines of ode (). From Figure 4(a), JUnit4 has inreasing. Although all was higher at the beginning of the projet, the value has been dereasing over time. In partiular, all dereased drastially in 212 by applying a style formatter for all soure odes. A new oding onvention was disussed at the time 6. Even though the onvention was introdued, all has been inreasing slightly with inreasing. From Figure 4(b), log4j has a similar tendeny as JUnit4 between 2 and 27 when the projet was in early development. After that, varies around.3. In 27, 21 and 212, and were drastially hanged beause the projet performed branh merging, feature addition, and feature deletion (a) JUnit e+4.4 3e+4 2e+4.2 1e (b) log4j Fig. 4: Change of all and for eah projet 215 1e+6 5e+5 In summary, style inonsisteny tends to our in early development and to be affeted by hanging. With the software evolution, the inonsisteny annot be solved even if a style formatter is applied. Some developers may get frustrated by the inonsisteny. We onlude that a tool to support a onsistent oding style may be helpful in a odevelopment environment. B. Performane Evaluation 1) Purpose and Method: Using the proposed tool, the exeution performane of Git operation is expeted to derease beause of token and syntax analysis. In this experiment, we onfirm whether the performane derease is pratial. All stage and ommit operations that were exeuted in atual software are reprodued. We measured and ompared the exeution times for every operation with and without the proposed tool. The subjet projet is JUnit4, whih inludes 2,115 revisions during years 2 through ) Result: Figure 5(a) shows the performanes with and without the proposed tool. The distribution of the exeution time is shown as a box plot. The y-axis shows the exeution time in log sale. Most original ommits were aomplished within a single seond. In ontrast, using the proposed tool, the exeution time was inreased approximately 17-fold. However, we found that 75% of ommits were aomplished within 2.5 seonds. In the worst ase, the exeution time inreased from 1.1 seonds to seonds, whih was the longest time with and without the proposed tool. In this ase, 35 files were ommitted at the same time in order to apply a new oding style in 212. The drasti style hange is also shown in Figure 4(a). Figure 5(b) illustrates the relationship between the rate of performane redution and the total number of java files. The x-axis indiates the rate of performane redution obtained using our tool, and the y-axis indiates the number of files. Note that a few ases, in whih the number of java files exeeds 1, are omitted. We an onfirm that the performane is dereased as the number of java files inreases. TABLE I: Summary of subjet projets projet name years # revisions # developers JUnit4 15 2, ,722 log4j 15 3, ,78

5 se w/o tool w/ tool (a) Comparison of exeution time of ommit operation #files performane redution rate (b) Relationship between the performane redution rate of the ommit operation and the number of java files Fig. 5: Results of the performane evaluation experiment 3) Disussion: In summary, the most ommits were aomplished within 5 seonds when the proposed tool was used as a pre-proessor. In a pratial situation, the perentage of the ommit time during development is extremely small beause the ommit is exeuted after a ertain task is ompleted. We believe that the performane derease by the proposed tool may be aeptable. We also found that the exeution performane dereases by ommitting multiple files simultaneously. The reason for this is that the onstrution of the syntax tree requires more time as the number of total program statements inreases. In reent software development, it is reommended that all ommits should be kept smaller [1]. This pratie is known to be key to ontinuous integration. Therefore, we believe that the influene of the performane redution may be smaller with the spread of agile praties. V. RELATED WORK A number of software projets have published oding guidelines 7,8,9 that inlude some speifi rules of oding style. Of ourse, there are many differenes between these styles. This means that oding style is not only a preferene of the projet but is also a non-trivial problem that annot be negleted in a o-development environment. Some researhers have onduted a survey of oding styles in pratial environments. Spinellis et al. [9] have studied longterm hanges in style inonsisteny in Unix for 43 years. They onluded that the projet suessfully ahieved a onsensus of oding style beause the inonsisteny dereased year by year. Bahelli and Bird [11] reported that ode improvements, suh as heking that soure ode follows ode onvention, are important motivation for ode review. Li et al. [12] studied students opinions on oding styles in programming ourses. From these studies, it is diffiult to follow the oding onvention for all developers. 7 US.ISO8859-1/books/fdp-primer/ Various style formatters have been published 1 and many popular IDEs also inlude these formatters by default. Moreover, in the aademi field, a number of style formatters have been proposed [3][13][14][15]. These tools have some features in ommon with the proposed tool. However, the tools an only work in a stand-alone or loal environment. The proposed tool an ensure onsistent style in both loal and remote environments by exeution with Git operation. VI. CONCLUON In this paper, we proposed a tool for use in development environments to easily maintain style onsisteny. The tool inludes an improved algorithm of style extration. We onduted an experiment to evaluate performane of the tool. From the evaluation, the performane derease by the tool may be aeptable. In the future, we intend to extend to over other ategories of oding styles suh as indentation and name onvention. To deal with these ategories, we need to onsider further style extration and inonsisteny riteria. In order to onfirm the usefulness of the tool, we are going to ondut qualitative evaluation with industrial pratitioners. ACKNOWLEDGMENT This study was supported by JSPS/MEXT KAKENHI Grant Numbers JP25223 and JP REFERENCES [1] P. W. Oman and C. R. Cook. A taxonomy for programming style. In Pro. Annual Conf. Cooperation, pages , 199. [2] A. Bosu, M. Greiler, and C. Bird. Charateristis of useful ode reviews: An empirial study at mirosoft. In Pro. Working Conf. Mining Software Repositories, pages , 215. [3] T. Parr and J. Vinju. Towards a universal ode formatter through mahine learning. In Pro. Int l Conf. Software Language Engineering, pages , 216. [4] IBM Arhives: 1928, January 218. [5] M. Allamanis, E. T. Barr, C. Bird, and C. Sutton. Learning natural oding onventions. In Pro. Int l Symp. Foundations of Software Engineering, pages , 214. [6] C. Boogerd and L. Moonen. Assessing the value of oding standards: An empirial study. In Pro. Int l Conf. Software Maintenane, pages , 28. [7] K. Herzig and A. Zeller. The impat of tangled ode hanges. In Pro. Working Conf. Mining Software Repositories, pages , 213. [8] D. Cohen. On holy wars and a plea for peae. Computer, 14(1):48 54, [9] D. Spinellis, P. Louridas, and M. Kehagia. The evolution of programming praties: A study of the unix operating system In Pro. Int l Conf. Software Engineering, pages , 216. [1] M. Meyer. Continuous integration and its tools. IEEE Software, 31(3):14 16, 214. [11] A. Bahelli and C. Bird. Expetations, outomes, and hallenges of modern ode review. In Pro. Int l Conf. Software Engineering, pages , 213. [12] X. Li and C. Prasad. Effetively teahing oding standards in programming. In Pro. Conf. Information Tehnology Eduation, pages , 25. [13] D. C. Oppen. Prettyprinting. ACM Trans. Programming Languages and Systems, 2(4): , 198. [14] L. F. Rubin. Syntax-direted pretty printing - a first step towards a syntax-direted editor. IEEE Trans. Software Engineering, 9(2), [15] R. D. Cameron. An abstrat pretty printer. IEEE Software, 5(6):61 67,

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Exploiting Enriched Contextual Information for Mobile App Classification

Exploiting Enriched Contextual Information for Mobile App Classification Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

13.1 Numerical Evaluation of Integrals Over One Dimension

13.1 Numerical Evaluation of Integrals Over One Dimension 13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Improved Circuit-to-CNF Transformation for SAT-based ATPG

Improved Circuit-to-CNF Transformation for SAT-based ATPG Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1 Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0 Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1

CA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information.

More information

Zippy - A coarse-grained reconfigurable array with support for hardware virtualization

Zippy - A coarse-grained reconfigurable array with support for hardware virtualization Zippy - A oarse-grained reonfigurable array with support for hardware virtualization Christian Plessl Computer Engineering and Networks Lab ETH Zürih, Switzerland plessl@tik.ee.ethz.h Maro Platzner Department

More information

PROJECT PERIODIC REPORT

PROJECT PERIODIC REPORT FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise

More information

arxiv: v1 [cs.db] 13 Sep 2017

arxiv: v1 [cs.db] 13 Sep 2017 An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks 62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering

More information

C 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)

C 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2) SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

Using Augmented Measurements to Improve the Convergence of ICP

Using Augmented Measurements to Improve the Convergence of ICP Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,

More information

Chromaticity-matched Superimposition of Foreground Objects in Different Environments

Chromaticity-matched Superimposition of Foreground Objects in Different Environments FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology

More information

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

Dynamic Backlight Adaptation for Low Power Handheld Devices 1

Dynamic Backlight Adaptation for Low Power Handheld Devices 1 Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &

More information

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

More information

Introductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test

Introductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test Introdutory Programming, IMM, DTU Systemati Software Test Peter Sestoft a Programs often ontain unintended errors how do you find them? Strutural test Funtional test Notes: Systemati Software Test, http://www.dina.kvl.dk/

More information

Semi-Supervised Affinity Propagation with Instance-Level Constraints

Semi-Supervised Affinity Propagation with Instance-Level Constraints Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,

More information

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Boosted Random Forest

Boosted Random Forest Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

1 The Knuth-Morris-Pratt Algorithm

1 The Knuth-Morris-Pratt Algorithm 5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on

More information

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0

CA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0 Exam (CAT-720) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

Face and Facial Feature Tracking for Natural Human-Computer Interface

Face and Facial Feature Tracking for Natural Human-Computer Interface Fae and Faial Feature Traking for Natural Human-Computer Interfae Vladimir Vezhnevets Graphis & Media Laboratory, Dept. of Applied Mathematis and Computer Siene of Mosow State University Mosow, Russia

More information

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center Construting Transation Serialization Order for Inremental Data Warehouse Refresh Ming-Ling Lo and Hui-I Hsiao IBM T. J. Watson Researh Center July 11, 1997 Abstrat In typial pratie of data warehouse, the

More information

Cluster Centric Fuzzy Modeling

Cluster Centric Fuzzy Modeling 10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we

More information

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

Evolutionary Feature Synthesis for Image Databases

Evolutionary Feature Synthesis for Image Databases Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,

More information

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else 3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and

More information

An Efficient and Scalable Approach to CNN Queries in a Road Network

An Efficient and Scalable Approach to CNN Queries in a Road Network An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,

More information

CA Service Desk Manager 14.x Implementation Proven Professional Exam (CAT-181) Study Guide Version 1.3

CA Service Desk Manager 14.x Implementation Proven Professional Exam (CAT-181) Study Guide Version 1.3 Exam (CAT-181) Study Guide Version 1.3 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel

More information

Chapter 2: Introduction to Maple V

Chapter 2: Introduction to Maple V Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard

More information

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0. C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion

More information

Gradient based progressive probabilistic Hough transform

Gradient based progressive probabilistic Hough transform Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

One Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs?

One Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs? One Against One or One Against All : Whih One is Better for Handwriting Reognition with SVMs? Jonathan Milgram, Mohamed Cheriet, Robert Sabourin To ite this version: Jonathan Milgram, Mohamed Cheriet,

More information

An Interactive-Voting Based Map Matching Algorithm

An Interactive-Voting Based Map Matching Algorithm Eleventh International Conferene on Mobile Data Management An Interative-Voting Based Map Mathing Algorithm Jing Yuan* University of Siene and Tehnology of China Hefei, China yuanjing@mail.ust.edu.n Yu

More information

Tackling IPv6 Address Scalability from the Root

Tackling IPv6 Address Scalability from the Root Takling IPv6 Address Salability from the Root Mei Wang Ashish Goel Balaji Prabhakar Stanford University {wmei, ashishg, balaji}@stanford.edu ABSTRACT Internet address alloation shemes have a huge impat

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in

More information

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification

A New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification A New RBFNDDA-KNN Network and Its Appliation to Medial Pattern Classifiation Shing Chiang Tan 1*, Chee Peng Lim 2, Robert F. Harrison 3, R. Lee Kennedy 4 1 Faulty of Information Siene and Tehnology, Multimedia

More information

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,

More information

A scheme for racquet sports video analysis with the combination of audio-visual information

A scheme for racquet sports video analysis with the combination of audio-visual information A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

CA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2

CA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2 CA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2 PROPRIETARY AND CONFIDENTIAL INFMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,

More information

Test Case Generation from UML State Machines

Test Case Generation from UML State Machines Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864

More information

A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing

A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing A Novel Timestamp Ordering Approah for Co-existing Traditional and Cooperative Transation Proessing Author Sun, Chengzheng, Zhang, Y., Kambayashi, Y., Yang, Y. Published 1998 Conferene Title Proeedings

More information

Direct-Mapped Caches

Direct-Mapped Caches A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.

More information

2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,

2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any urrent or future media, inluding reprinting/republishing this material for advertising

More information

TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM

TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM M. Murugeswari 1, M.Gayathri 2 1 Assoiate Professor, 2 PG Sholar 1,2 K.L.N College of Information

More information

CA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5

CA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5 Proven Professional Exam (CAT-480) Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

Allocating Rotating Registers by Scheduling

Allocating Rotating Registers by Scheduling Alloating Rotating Registers by Sheduling Hongbo Rong Hyunhul Park Cheng Wang Youfeng Wu Programming Systems Lab Intel Labs {hongbo.rong,hyunhul.park,heng..wang,youfeng.wu}@intel.om ABSTRACT A rotating

More information

Parametric Abstract Domains for Shape Analysis

Parametric Abstract Domains for Shape Analysis Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University

More information

arxiv: v1 [cs.gr] 10 Apr 2015

arxiv: v1 [cs.gr] 10 Apr 2015 REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,

More information

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8 Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

A Dictionary based Efficient Text Compression Technique using Replacement Strategy

A Dictionary based Efficient Text Compression Technique using Replacement Strategy A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India

More information

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints 5 JOURNAL OF SOFTWARE VOL. 8 NO. 8 AUGUST Optimization of Two-Stage Cylindrial Gear Reduer with Adaptive Boundary Constraints Xueyi Li College of Mehanial and Eletroni Engineering Shandong University of

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

This fact makes it difficult to evaluate the cost function to be minimized

This fact makes it difficult to evaluate the cost function to be minimized RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess

More information

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

Design Implications for Enterprise Storage Systems via Multi-Dimensional Trace Analysis

Design Implications for Enterprise Storage Systems via Multi-Dimensional Trace Analysis Design Impliations for Enterprise Storage Systems via Multi-Dimensional Trae Analysis Yanpei Chen, Kiran Srinivasan, Garth Goodson, Randy Katz University of California, Berkeley, NetApp In. {yhen2, randy}@ees.berkeley.edu,

More information

Verifying Interaction Protocol Compliance of Service Orchestrations

Verifying Interaction Protocol Compliance of Service Orchestrations Verifying Interation Protool Compliane of Servie Orhestrations Andreas Shroeder and Philip Mayer Ludwig-Maximilians-Universität Münhen, Germany {shroeda, mayer}@pst.ifi.lmu.de Abstrat. An important aspet

More information

CA API Management 8.x Implementation Proven Professional Exam (CAT-560) Study Guide Version 1.1

CA API Management 8.x Implementation Proven Professional Exam (CAT-560) Study Guide Version 1.1 Exam (CAT-560) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information