An Automatic Method for Summary Evaluation Using Multiple Evaluation Results by a Manual Method
|
|
- Lisa Walton
- 6 years ago
- Views:
Transcription
1 An Autoatic Method for Suary Evaluation Using Multiple Evaluation Results by a Manual Method Hidetsugu Nanba Faculty of Inforation Sciences, Hiroshia City University Ozuka, Hiroshia, Japan nanba@its.hiroshia-cu.ac.jp Manabu Okuura Precision and Intelligence Laboratory, Tokyo Institute of Technology 4259 Nagatsuta, Yokohaa, Japan oku@pi.titech.ac.jp Abstract To solve a proble of how to evaluate coputer-produced suaries, a nuber of autoatic and anual ethods have been proposed. Manual ethods evaluate suaries correctly, because huans evaluate the, but are costly. On the other hand, autoatic ethods, which use evaluation tools or progras, are low cost, although these ethods cannot evaluate suaries as accurately as anual ethods. In this paper, we investigate an autoatic evaluation ethod that can reduce the errors of traditional autoatic ethods by using several evaluation results obtained anually. We conducted soe experients using the data of the Text Suarization Challenge 2 (TSC-2). A coparison with conventional autoatic ethods shows that our ethod outperfors other ethods usually used. 1 Introduction Recently, the evaluation of coputer-produced suaries has becoe recognized as one of the proble areas that ust be addressed in the field of autoatic suarization. To solve this proble, a nuber of autoatic (Donaway et al., 2000, Hirao et al., 2005, Lin et al., 2003, Lin, 2004, Hori et al., 2003) and anual ethods (Nenkova et al., 2004, Teufel et al., 2004) have been proposed. Manual ethods evaluate suaries correctly, because huans evaluate the, but are costly. On the other hand, autoatic ethods, which use evaluation tools or progras, are low cost, although these ethods cannot evaluate suaries as accurately as anual ethods. In this paper, we investigate an autoatic ethod that can reduce the errors of traditional autoatic ethods by using several evaluation results obtained anually. Unlike other autoatic ethods, our ethod estiates anual evaluation scores. Therefore, our ethod akes it possible to copare a new syste with other systes that have been evaluated anually. There are two research studies related to our work (Kazawa et al., 2003, Yasuda et al., 2003). Kazawa et al. (2003) proposed an autoatic evaluation ethod using ultiple evaluation results fro a anual ethod. In the field of achine translation, Yasuda et al. (2003) proposed an autoatic ethod that gives an evaluation result of a translation syste as a score for the Test of English for International Counication (TOEIC). Although the effectiveness of both ethods was confired experientally, further discussion of four points, which we describe in Section 3, is necessary for a ore accurate suary evaluation. In this paper, we address three of these points based on Kazawa s and Yasuda s ethods. We also investigate whether these ethods can outperfor other autoatic ethods. The reainder of this paper is organized as follows. Section 2 describes related work. Section 3 describes our ethod. To investigate the effectiveness of our ethod, we conducted soe exainations and Section 4 reports on these. We present soe conclusions in Section 5. 2 Related Work Generally, siilar suaries are considered to obtain siilar evaluation results. If there is a set of suaries (pooled suaries) produced fro a docuent (or ultiple docuents) and if these are evaluated anually, then we can estiate a anual evaluation score for any suary to be evaluated with the evaluation results for those pooled suaries. Based on this idea, Kazawa et 603 Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages , Sydney, July c 2006 Association for Coputational Linguistics
2 al. (2003) proposed an autoatic ethod using ultiple evaluation results fro a anual ethod. First, n suaries for each docuent,, were prepared. A suarization syste generated suaries fro docuents. Here, we represent the i th suary for the j th docuent and its evaluation score as x and y, respectively. The syste was evaluated using Equation 1. n scr( x) = w y Si( x, x ) + b (1) i= 1 j= 1 j The evaluation score of suary x was obtained by suing paraeter b for all the subscores calculated for each pooled suary, x. A subscore was obtained by ultiplying a paraeter w j, by the evaluation score y, and the siilarity between x and x. In the field of achine translation, there is another related study. Yasuda et al. (2003) proposed an autoatic ethod that gives an evaluation result of a translation syste as a score for TOEIC. They prepared 29 huan subjects, whose TOEIC scores were fro 300s to 800s, and asked the to translate 23 Japanese conversations into English. They also generated translations using a syste for each conversation. Then, they evaluated both translations using an autoatic ethod, and obtained W H, which indicated the ratio of syste translations that were superior to huan translations. Yasuda et al. calculated W H for each subject and plotted the values along with their corresponding TOEIC scores to produce a regression line. Finally, they defined a point where the regression line crossed W H = 0.5 to provide the TOEIC score for the syste. Though, the effectiveness of Kazawa s and Yasuda s ethods were confired experientally, further discussions of four points, which we describe in the next section, are necessary for a ore accurate suary evaluation. 3 Investigation of an Autoatic Method using Multiple Manual Evaluation Results 3.1 Overview of Our Evaluation Method and Essential Points to be Discussed We investigate an autoatic ethod using ultiple evaluation results by a anual ethod based on Kazawa s and Yasuda s ethod. The procedure of our evaluation ethod is shown as follows; (Step 1) Prepare suaries and their evaluation results by a anual ethod (Step 2) Calculate the siilarities between a suary to be evaluated and the pooled suaries (Step 3) Cobine anual scores of pooled suaries in proportion to their siilarities to the suary to be evaluated For each step, we need to discuss the following points. (Step 1) 1. How any suaries, and what type (variety) of suaries should be prepared? Kazawa et al. prepared 6 suaries for each docuent, and Yasuda et al. prepared 29 translations for each conversation. However, they did not exaine about the nuber and the type of pooled suaries required to the evaluation. (Step 2) 2. Which easure is better for calculating the siilarities between a suary to be evaluated and the pooled suaries? Kazawa et al. used Equation 2 to calculate siilarities. Si( x, x where ) x in( x x = (2), x ) x x indicates the nuber of discourse units 1 that appear in both x and x, and x represents the nuber of words in x. However, there are any other easures that can be used to calculate the topical siilarities between two docuents (or passages). As well as Yasuda s ethod does, using W H is another way to calculate siilarities between a suary to be evaluated and pooled suaries indirectly. Yasuda et al. (2003) tested DP atching (Su et al., 1992), BLEU (Papineni et al., 2002), and NIST 2, for the calculation of W H. However there are any other easures for suary evaluation. 1 Rhetorical Structure Theory Discourse Treebank. Id=LDC2002T07 Linguistic Data Consortiu
3 3. How any suaries should be used to calculate the score of a suary to be evaluated? Kazawa et al. used all the pooled suaries but this does not ensure the best perforance of their evaluation ethod. (Step 3) 4. How to cobine the anual scores of the pooled suaries? Kazawa et al. calculated the score of a suary as a weighted linear su of the anual scores. Applying regression analysis (Yasuda et al., 2003) is another ethod of cobining several anual scores. 3.2 Three Points Addressed in Our Study We address the second, third and fourth points in Section 3.1. (Point 2) A easure for calculating siilarities between a suary to be evaluated and pooled suaries: There are any easures that can calculate the topical siilarities between two docuents (or passages). We tested several easures, such as ROUGE (Lin, 2004) and the cosine distance. We describe these easures in detail in Section 4.2. (Point 3) The nuber of suaries used to calculate the score of a suary to be evaluated: We use suaries whose siilarities to a suary to be evaluated are higher than a threshold value. (Point 4) Cobination of anual scores: We used both Kazawa s and Yasuda s ethods. 4 Experients 4.1 Experiental Methods To investigate the three points described in Section 3.2, we conducted the following four experients. Exp-1: We exained Points 2 and 3 based on Kazawa s ethod. We tested threshold values fro 0 to 1 at intervals. We also tested several siilarity easures, such as cosine distance and 11 kinds of ROUGE. Exp-2: In order to investigate whether the evaluation based on Kazawa s ethod can outperfor other autoatic ethods, we copared the evaluation with other autoatic ethods. In this experient, we used the siilarity easure, which obtain the best perforance in Exp-1. Exp-3: We also exained Point 2 based on Yasuda s ethod. As a siilarity easure, we tested cosine distance and 11 kinds of ROUGE. Then, we exained Point 4 by coparing the result of Yasuda s ethod with that of Kazawa s. Exp-4: In the sae way as Exp-2, we copared the evaluation with other autoatic ethods, which we describe in the next section, to investigate whether the evaluation based on Yasuda s ethod can outperfor other autoatic ethods. 4.2 Autoatic Evaluation Methods Used in the Experients In the following, we show the autoatic evaluation ethods used in our experients. Content-based evaluation (Donaway et al., 2000) This easure evaluates suaries by coparing their content words with those of the huanproduced extracts. The score of the contentbased easure is obtained by coputing the siilarity between the ter vector using tf*idf weighting of a coputer-produced suary and the ter vector of a huan-produced suary by cosine distance. ROUGE-N (Lin, 2004) This easure copares n-gras of two suaries, and counts the nuber of atches. The easure is defined by Equation 3. Count atch ( gran ) S R gran S ROUGE N = (3) Count( gra ) S R gran S where Count(gra N ) is the nuber of an N-gra and Count atch (gra N ) denotes the nuber of n- gra co-occurrences in two suaries. ROUGE-L (Lin, 2004) This easure evaluates suaries by longest coon subsequence (LCS) defined by Equation 4. u LCS ( ri, C) i= i ROUGE L = (4) where LCS U (r i,c) is the LCS score of the union s longest coon subsequence between reference sentences r i and the suary to be evaluated, and is the nuber of words contained in a reference suary. N 605
4 ROUGE-S (Lin, 2004) Skip-bigra is any pair of words in their sentence order, allowing for arbitrary gaps. ROUGE-S easures the overlap of skip-bigras in a candidate suary and a reference suary. Several variations of ROUGE-S are possible by liiting the axiu skip distance between the two in-order words that are allowed to for a skip-bigra. In the following, ROUGE-SN denotes ROUGE-S with axiu skip distance N. ROUGE-SU (Lin, 2004) This easure is an extension of ROUGE-S; it adds a unigra as a counting unit. In the following, ROUGE-SUN denotes ROUGE-SU with axiu skip distance N. 4.3 Evaluation Methods In the following, we elaborate on the evaluation ethods for each experient. Exp-1: An experient for Points 2 and 3 based on Kazawa s ethod We evaluated Kazawa s ethod fro the viewpoint of Gap. Differing fro other autoatic ethods, the ethod uses ultiple anual evaluation results and estiates the anual scores of the suaries to be evaluated or the suarization systes. We therefore evaluated the autoatic ethods using Gap, which anually indicates the difference between the scores fro a anual ethod and each autoatic ethod that estiates the scores. First, an arbitrary suary is selected fro the 10 suaries in a dataset, which we describe in Section 4.4, and an evaluation score is calculated by Kazawa s ethod using the other nine suaries. The score is copared with a anual score of the suary by Gap, which is defined by Equation 5. n scr'( xkl ) ykl k = 1 l= 1 Gap = (5) n where x kl is the k th syste s l th suary, and y kl is the score fro a anual evaluation ethod for the k th syste s l th suary. To distinguish our evaluation function fro Kazawa s, we denote it as scr (x). As a siilarity easure in scr (x), we tested ROUGE and the cosine distance. We also tested the coverage of the autoatic ethod. The ethod cannot calculate scores if there are no siilar suaries above a given threshold value. Therefore, we checked the coverage of the ethod, which is defined by Equation 6. The nuber of suaries evaluated by the ethod Coverage = (6) The nuber of given suaries Exp-2: Coparison of Kazawa s ethod with other autoatic ethods Traditionally, autoatic ethods have been evaluated by Ranking. This eans that suarization systes are ranked based on the results of the autoatic and anual ethods. Then, the effectiveness of the autoatic ethod is evaluated by the nuber of atches between both rankings using Spearan s rank correlation coefficient and Pearson s rank correlation coefficient (Lin et al., 2003, Lin, 2004, Hirao et al., 2005). However, we did not use both correlation coefficients, because evaluation scores are not always calculated by a Kazawabased ethod, which we described in Exp-1. Therefore, we ranked the suaries instead of the suarization systes. Two arbitrary suaries fro the 10 suaries in a dataset were selected and ranked by Kazawa s ethod. Then, Kazawa s ethod was evaluated using Precision, which calculates the percentage of cases where the order of the anual ethod of the two suaries atches the order of their ranks calculated by Kazawa s ethod. The two suaries were also ranked by ROUGE and by cosine distance, and both Precision values were calculated. Finally, the Precision value of Kazawa s ethod was copared with those of ROUGE and cosine distance. Exp-3: An experient for Point 2 based on Yasuda s ethod An arbitrary syste was selected fro the 10 systes, and Yasuda s ethod estiated its anual score fro the other nine systes. Yasuda s ethod was evaluated by Gap, which is defined by Equation 7. s( xk ) yk k= Gap = 1 (7) where x k is the k th syste, s(x k ) is a score of x k by Yasuda s ethod, and y k is the anual score for the k th syste. Yasuda et al. (2003) tested DP atching (Su et al., 1992), BLEU (Papineni et al., 2002), and NIST 3, as autoatic ethods used in their evaluation. Instead of those ethods, we
5 tested ROUGE and cosine distance, both of which have been used for suary evaluation. If a score by Yasuda s ethod exceeds the range of the anual score, the score is odified to be within the range. In our experients, we used evaluation by revision (Fukushia et al., 2002) as the anual evaluation ethod. The range of the score of this ethod is between zero and 0.5. If the score is less than zero, it is changed to zero and if greater than 0.5 it is changed to 0.5. Exp-4: Coparison of Yasuda s ethod and other autoatic ethods In the sae way as for the evaluation of Kazawa s ethod in Exp-2, we evaluated Yasuda s ethod by Precision. Two arbitrary suaries fro the 10 suaries in a dataset were selected, and ranked by Yasuda s ethod. Then, Yasuda s ethod was evaluated using Precision. Two suaries were also ranked by ROUGE and by cosine distance and both Precision values were calculated. Finally, the Precision value of Yasuda s ethod was copared with those of ROUGE and cosine distance. 4.4 The Data Used in Our Experients We used the TSC-2 data (Fukushia et al., 2002) in our exainations. The data consisted of huan-produced extracts (denoted as PART ), huan-produced abstracts (denoted as FREE ), coputer-produced suaries (eight systes and a baseline syste using the lead ethod (denoted as LEAD )) 4, and their evaluation results by two anual ethods. All the suaries were derived fro 30 newspaper articles, written in Japanese, and were extracted fro the Mainichi newspaper database for the years 1998 and Two tasks were conducted in TSC-2, and we used the data fro a single docuent suarization task. In this task, participants were asked to produce suaries in plain text in the ratios of 20% and 40%. Suaries were evaluated using a ranking evaluation ethod and the revision ethod evaluation. In our experients, we used the results of evaluation fro the revision ethod. This ethod evaluates suaries by easuring the degree to which coputer-produced suaries are revised. The judges read the 4 In Exp-2 and 4, we evaluated PART, LEAD, and eight systes (candidate suaries) by autoatic ethods using FREE as the reference suaries. original texts and revised the coputer-produced suaries in ters of their content and readability. The huan revisions were ade with only three editing operations (insertion, deletion, replaceent). The degree of the huan revision, called the edit distance, is coputed fro the nuber of revised characters divided by the nuber of characters in the original suary. If the suary s quality was so low that a revision of ore than half of the original suary was required, the judges stopped the revision and a score of 0.5 was given. The effectiveness of evaluation by the revision ethod was confired in our previous work (Nanba et al., 2004). We copared evaluation by revision with ranking evaluation. We also tested other autoatic ethods: content-based evaluation, BLEU (Papineni et al., 2001) and ROUGE-1 (Lin, 2004), and copared their results with that of evaluation by revision as reference. As a result, we found that evaluation by revision is effective for recognizing slight differences between coputer-produced suaries. 4.5 Experiental Results and Discussion Exp-1: An experient for Points 2 and 3 based on Kazawa s ethod To address Points 2 and 3, we evaluated suaries by the ethod based on Kazawa s ethod using 12 easures, described in Section 4.4, as easures to calculate topical siilarities between suaries, and copared these easures by Gap. The experiental results for suarization ratios of 40% and 20% are shown in Tables 1 and 2, respectively. Tables show the Gap values of 12 easures for each Coverage value fro 0.2 to 1.0 at 0.1 intervals. Average values of Gap for each easure are also shown in these tables. As can be seen fro Tables 1 and 2, the larger the threshold value, the saller the value of Gap. Fro the result, we can conclude for Point 3 that ore accurate evaluation is possible when we use siilar pooled suaries (Point 2). However, the nuber of suaries that can be evaluated by this ethod was liited when the threshold value was large. Of the 12 easures, unigra-based ethods, such as cosine distance and ROUGE-1, produced good results. However, there were no significant differences between easures except for when ROUGE-L was used. 607
6 Coverage Measure Table 1 Coparison of Gap values for several easures (ratio: 40%) Average R R R R R-L R-S R-S R-S R-SU R-SU R-SU Cosine Threshold Sall Large Coverage Measure Table 2 Coparison of Gap values for several easures (ratio: 20%) Average R R R R R-L R-S R-S R-S R-SU R-SU R-SU Cosine Threshold Sall Large Exp-2: Coparison of Kazawa s ethod with other autoatic ethods (Point 2) In Exp-1, cosine distance outperfored the other 11 easures. We therefore used cosine distance in Kazawa s ethod in Exp-2. We ranked suaries by Kazawa s ethod, ROUGE and cosine distance, calculated using Precision. The results of the evaluation by Precision for suarization ratios of 40% and 20% are shown in Figures 1 and 2, respectively. We plotted the Precision value of Kazawa s ethod by changing the threshold value fro 0 to 1 at 0.05 intervals. We also plotted the Precision values of ROUGE- 2 as dotted lines. ROUGE-2 was superior to the other 11 easures in ters of Ranking. The X and Y axes in Figures 1 and 2 show the threshold value of Kazawa s ethod and the Precision values, respectively. Fro the result shown in Figure 1, we found that Kazawa s ethod outperfored ROUGE-2, when the threshold value was greater than The Coverage value of this point was In Figure 2, the Precision curve of Kazawa s ethod crossed the dotted line at a threshold value of The Coverage value of this point was To iprove these Coverage values, we need to prepare ore suaries and their anual evaluation results, because the Coverage is critically dependent on the nuber and variety of pooled suaries. This is exactly the first point in Section 3.1, which we do not address in this paper. We will investigate this point as the next step in our future work. 608
7 precision threshold value Kazawa's ethod R-2 Figure 1 Coparison of Kazawa s ethod and ROUGE-2 (ratio: 40%) 1 Table 3 Gap between the anual ethod and Yasuda s ethod Ratio Average 20% 40% Cosine R R R R R-L R-S( ) R-S R-S R-SU( ) R-SU R-SU precision threshold value Exp-4: Coparison of Yasuda s ethod with other autoatic ethods We also evaluated Yasuda s ethod by coparison with other autoatic ethods in ters of Ranking. We evaluated 10 systes by Yasuda s ethod with ROUGE-3, which produced the best results in Exp-3. We also evaluated the systes by ROUGE and cosine distance, and copared the results. The results are shown in Table 4. Kazawa's ethod R-2 Figure 2 Coparison of Kazawa s ethod and ROUGE-2 (ratio: 20%) Exp-3: An experient for Point 3 based on Yasuda s ethod For Point 2 in Section 3.2, we also exained Yasuda s ethod. The experiental result by Gap is shown in Table 3. When the ratio is 20%, ROUGE-SU4 is the best. The N-gra and the skip-bigra are both useful when the suarization ratio is low. For Point 4, we copared the result by Yasuda s ethod (Table 3) with that of Kazawa s ethod (in Tables 1 and 2). Yasuda s ethod could accurately estiate anual scores. In particular, the Gap values of by ROUGE-2 and by ROUGE-3 are saller than those produced by Kazawa s ethod with a threshold value of 0.9 (Tables 1 and 2). This indicates that regression analysis used in Yasuda s ethod is superior to that used in Kazawa s ethod. Table 4 Coparison between Yasuda s ethod and autoatic ethods Ratio Average 20% 40% Yasuda Cosine R R R R R-L R-S( ) R-S R-S R-SU( ) R-SU R-SU As can be seen fro Table 4, Yasuda s ethod produced the best results for the ratios of 20% and 40%. Of the autoatic ethods copared, ROUGE-4 was the best. 609
8 As evaluation scores by Yasuda s ethod were calculated based on ROUGE-3, there were no striking differences between Yasuda s ethod and the others except for the integration process of evaluation scores for each suary. Yasuda s ethod uses a regression analysis, whereas the other ethods average the scores for each suary. Yasuda s ethod using ROUGE-3 outperfored the original ROUGE-3 for both ratios, 20% and 40%. 5 Conclusions We have investigated an autoatic ethod that uses several evaluation results fro a anual ethod based on Kazawa s and Yasuda s ethods. Fro the experiental results based on Kazawa s ethod, we found that liiting the nuber of pooled suaries could produce better results than using all the pooled suaries. However, the nuber of suaries that can be evaluated by this ethod was liited. To iprove the Coverage of Kazawa s ethod, ore suaries and their evaluation results are required, because the Coverage is critically dependent on the nuber and variety of pooled suaries. We also investigated an autoatic ethod based on Yasuda s ethod and found that the ethod using ROUGE-2 and -3 could accurately estiate anual scores, and could outperfor Kazawa s ethod and the other autoatic ethods tested. Fro these results, we can conclude that the autoatic ethod perfored the best when ROUGE-2 or 3 is used as a siilarity easure, and a regression analysis is used for cobining anual ethod. References Robert L. Donaway, Kevin W. Druey and Laura A. Mather A Coparison of Rankings Produced by Suarization Evaluation Measures. Proceedings of the ANLP/NAACL 2000 Workshop on Autoatic Suarization: Takahiro Fukushia and Manabu Okuura Text Suarization Challenge/Text Suarization Evaluation at NTCIR Workshop2. Proceedings of the Second NTCIR Workshop on Research in Chinese and Japanese Text Retrieval and Text Suarization: Takahiro Fukushia, Manabu Okuura and Hidetsugu Nanba Text Suarization Challenge 2/Text Suarization Evaluation at NTCIR Workshop3. Working Notes of the 3rd NTCIR Workshop Meeting, PART V: 1 7. Tsutou Hirao, Manabu Okuura, and Hideki Isozaki Kernel-based Approach for Autoatic Evaluation of Natural Language Generation Technologies: Application to Autoatic Suarization. Proceedings of HLT- EMNLP 2005: Chiori Hori, Takaaki Hori, and Sadaoki Furui Evaluation Methods for Autoatic Speech Suarization. Proceedings of Eurospeech 2003: Hideto Kazawa, Thoas Arrigan, Tsutou Hirao and Eisaku Maeda An Autoatic Evaluation Method of Machine-Generated Extracts. IPSJ SIG Technical Reports, 2003-NL-158: (in Japanese). Chin-Yew Lin and Eduard Hovy Autoatic Evaluation of Suaries Using N-gra Co- Occurrence Statistics. Proceedings of the Huan Language Technology Conference 2003: Chin-Yew Lin ROUGE: A Package for Autoatic Evaluation of Suaries. Proceedings of the ACL-04 Workshop Text Suarization Branches Out : Hidetsugu Nanba and Manabu Okuura Coparison of Soe Autoatic and Manual Methods for Suary Evaluation Based on the Text Suarization Challenge 2. Proceedings of the Fourth International Conference on Language Resources and Evaluation: Ani Nenkova and Rebecca Passonneau, Evaluating Content Selection in Suarization: The Pyraid Method. Proceedings of HLT-NAACL 2004: Kishore Papineni, Sali Roukos, Todd Ward and Wei-Jing Zhu BLEU: A Method for Autoatic Evaluation of Machine Translation. IBM Research Report, RC22176 (W ). Keh-Yih Su, Ming-Wen Wu, and Jing-Shin Chang A New Quantitative Quality Measure for Machine Translation Systes. Proceedings of the 14 th International Conference on Coputational Linguistics: Sione Teufel and Hans van Halteren Evaluating Inforation Content by Factoid Analysis: Huan Annotation and Stability. Proceedings of EMNLP 2004: Kenji Yasuda, Fuiaki Sugaya, Toshiyuki Takezawa, Seiichi Yaaoto and Masuzo Yanagida Applications of Autoatic Evaluation Methods to Measuring a Capability of Speech Translation Syste. Proceedings of the Tenth Conference of the European Chapter of the Association for Coputational Linguistics:
A Periodic Dynamic Load Balancing Method
2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 A Periodic Dynaic Load Balancing Method Taotao Fan* State Key Laboratory of Inforation
More information1 Extended Boolean Model
1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible
More informationIdentifying Converging Pairs of Nodes on a Budget
Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering
More informationReal Time Displacement Measurement of an image in a 2D Plane
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882 Volue 5, Issue 3, March 2016 176 Real Tie Displaceent Measureent of an iage in a 2D Plane Abstract Prashant
More informationLeveraging Relevance Cues for Improved Spoken Document Retrieval
Leveraging Relevance Cues for Iproved Spoken Docuent Retrieval Pei-Ning Chen 1, Kuan-Yu Chen 2 and Berlin Chen 1 National Taiwan Noral University, Taiwan 1 Institute of Inforation Science, Acadeia Sinica,
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationA CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER
A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER VIOLETA TOMAŠEVIĆ, SLOBODAN BOJANIĆ 2 and OCTAVIO NIETO-TALADRIZ 2 The Mihajlo Pupin Institute, Volgina 5, 000 Belgrade, SERBIA AND MONTENEGRO 2 Technical University
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationFeature Selection to Relate Words and Images
The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationWeeks 1 3 Weeks 4 6 Unit/Topic Number and Operations in Base 10
Weeks 1 3 Weeks 4 6 Unit/Topic Nuber and Operations in Base 10 FLOYD COUNTY SCHOOLS CURRICULUM RESOURCES Building a Better Future for Every Child - Every Day! Suer 2013 Subject Content: Math Grade 3rd
More informationTALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE
7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,
More informationCollection Selection Based on Historical Performance for Efficient Processing
Collection Selection Based on Historical Perforance for Efficient Processing Christopher T. Fallen and Gregory B. Newby Arctic Region Supercoputing Center University of Alaska Fairbanks Fairbanks, Alaska
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationCollaborative Web Caching Based on Proxy Affinities
Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More informationDefining and Surveying Wireless Link Virtualization and Wireless Network Virtualization
1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,
More informationCarving Differential Unit Test Cases from System Test Cases
Carving Differential Unit Test Cases fro Syste Test Cases Sebastian Elbau, Hui Nee Chin, Matthew B. Dwyer, Jonathan Dokulil Departent of Coputer Science and Engineering University of Nebraska - Lincoln
More informationScalable search-based image annotation
Multiedia Systes DOI 17/s53-8-128-y REGULAR PAPER Scalable search-based iage annotation Changhu Wang Feng Jing Lei Zhang Hong-Jiang Zhang Received: 18 October 27 / Accepted: 15 May 28 Springer-Verlag 28
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationA Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage
216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent
More informationPERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL
IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant
More informationHIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES
HIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES Benjain Lehann*, Konstantinos Siantidis*, Dieter Kraus** *ATLAS ELEKTRONIK GbH Sebaldsbrücker Heerstraße 235 D-28309 Breen, GERMANY Eail: benjain.lehann@atlas-elektronik.co
More informationFlucs: Artificial Lighting & Daylighting. IES Virtual Environment
Flucs: Artificial Lighting & Daylighting IES Virtual Environent Contents 1. General Description of the FLUCS Interface... 6 1.1. Coon Controls... 6 1.2. Main Application Window... 6 1.3. Other Windows...
More informationEfficient Estimation of Inclusion Coefficient using HyperLogLog Sketches
Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT
More informationEnhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue
Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade
More informationDesign and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design
Design and Ipleentation of Business Logic Layer Object-Oriented Design versus Relational Design Ali Alharthy Faculty of Engineering and IT University of Technology, Sydney Sydney, Australia Eail: Ali.a.alharthy@student.uts.edu.au
More informationInteroperability/ Conformance Test dpmr Mode 2 Repeater
Interoperability/ Conforance Test dpmr Mode 2 Repeater IOP test Mode 2 Repeater Copyright 2013 dpmr Association All Rights Reserved Version 1.0 0 Revision History Version Date Change By 0v1 16 Oct 2012
More informationDKD-R 4-2 Calibration of Devices and Standards for Roughness Metrology Sheet 2: Calibration of the vertical measuring system of stylus instruments
DKD-R 4- Calibration of Devices and Standards for Roughness Metrology Sheet : Calibration of the vertical easuring syste of stylus instruents DKD-R 4- Sheet.7 DKD-R 4- Calibration of Devices and Standards
More informationA Novel Approach to Fractal Dimension based Fingerprint Recognition System
Volue: 03 Issue: 04 Apr-2016 www.irjet.net p-issn: 2395-0072 A Novel Approach to Fractal Diension based Fingerprint Recognition Syste Chiteranjan Sahu 1, Vinay Jain 2 1M.E. Scholar, Dept. of Electronics
More informationHKBU Institutional Repository
Hong Kong Baptist University HKBU Institutional Repository HKBU Staff Publication 18 Towards why-not spatial keyword top-k ueries: A direction-aware approach Lei Chen Hong Kong Baptist University, psuanle@gail.co
More informationA Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction
MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationBoosted Detection of Objects and Attributes
L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationVito R. Gervasi, Adam Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin
GEOMETRY AND PROCEDURE FOR BENCHMARKING SFF AND HYBRID FABRICATION PROCESS RESOLUTION Vito R. Gervasi, Ada Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin ABSTRACT Since
More informationSecure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals
Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract
More informationMULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES. Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou
MULTI-INDEX VOTING FOR ASYMMETRIC DISTANCE COMPUTATION IN A LARGE-SCALE BINARY CODES Chih-Yi Chiu, Yu-Cyuan Liou, and Sheng-Hao Chou Departent of Coputer Science and Inforation Engineering, National Chiayi
More informationAn Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation
Algoriths 2015, 8, 234-247; doi:10.3390/a8020234 Article OPEN ACCESS algoriths ISSN 1999-4893 www.dpi.co/journal/algoriths An Optiization Clustering Algorith Based on Texture Feature Fusion for Color Iage
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More informationNON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH
NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.
More informationImplementation of fast motion estimation algorithms and comparison with full search method in H.264
IJCSNS International Journal of Coputer Science and Network Security, VOL.8 No.3, March 2008 139 Ipleentation of fast otion estiation algoriths and coparison with full search ethod in H.264 A.Ahadi, M.M.Azadfar
More informationCassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards
Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense
More informationPredicting x86 Program Runtime for Intel Processor
Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationModal Masses Estimation in OMA by a Consecutive Mass Change Method.
Modal Masses Estiation in OMA by a Consecutive Mass Change Method. F. Pelayo University of Oviedo, Departent of Construction and Manufacturing Engineering, Gijón, Spain M. López-Aenlle University of Oviedo,
More informationPOSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang
IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering
More informationGalois Homomorphic Fractal Approach for the Recognition of Emotion
Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,
More informationVision Based Mobile Robot Navigation System
International Journal of Control Science and Engineering 2012, 2(4): 83-87 DOI: 10.5923/j.control.20120204.05 Vision Based Mobile Robot Navigation Syste M. Saifizi *, D. Hazry, Rudzuan M.Nor School of
More informationMirror Localization for a Catadioptric Imaging System by Projecting Parallel Lights
2007 IEEE International Conference on Robotics and Autoation Roa, Italy, 10-14 April 2007 FrC2.5 Mirror Localization for a Catadioptric Iaging Syste by Projecting Parallel Lights Ryusuke Sagawa, Nobuya
More informationMulti Packet Reception and Network Coding
The 2010 Military Counications Conference - Unclassified Progra - etworking Protocols and Perforance Track Multi Packet Reception and etwork Coding Aran Rezaee Research Laboratory of Electronics Massachusetts
More informationDEBARRED OBJECTS RECOGNITION BY PFL OPERATOR
DEBARRED OBJECTS RECOGNITION BY PFL OPERATOR Manish Kuar Srivastava,Madan Kushwah, Abhishe uar 3 Assistant Professor, Departent of CSE, Lal Bahadur Shastri Group of Institutions Lucnow, Uttar Pradesh,
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationA High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 21, 607-626 (2005) A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Mebership Functions * SHIH-HSU HUANG AND JIAN-YUAN LAI + Departent of
More informationResearch on the Influence of Several Factors on Clustering Results using Different Algorithms
Send Orders for Reprints to reprints@benthascience.ae The Open Cybernetics & Systeics Journal, 2015, 9, 1099-1106 1099 Open Access Research on the Influence of Several Factors on Clustering Results using
More informationOn computing global similarity in images
On coputing global siilarity in iages S Ravela and R Manatha Coputer Science Departent University of Massachusetts, Aherst, MA 01003 Eail: ravela,anatha @csuassedu Abstract The retrieval of iages based
More informationTheoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem
Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The
More informationMapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu
More informationCOMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT
COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT B.BOOBA 1 Dr. T.V.GOPAL 2 1 Research Scholar, Assist. Professor(Sl.Gr),Departent of Coputer Applications, Easwari
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu Clais, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationA Trajectory Splitting Model for Efficient Spatio-Temporal Indexing
A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada
More informationKS3 Maths Progress Delta 2-year Scheme of Work
KS3 Maths Progress Delta 2-year Schee of Work See the spreadsheet for the detail. Essentially this is an express route through our higher-ability KS3 Maths Progress student books Delta 1, 2 and 3 as follows:
More informationEffective Tracking of the Players and Ball in Indoor Soccer Games in the Presence of Occlusion
Effective Tracking of the Players and Ball in Indoor Soccer Gaes in the Presence of Occlusion Soudeh Kasiri-Bidhendi and Reza Safabakhsh Airkabir Univerisity of Technology, Tehran, Iran {kasiri, safa}@aut.ac.ir
More informationA Novel Fuzzy Chinese Address Matching Engine Based on Full-text Search Technology
Based on Full-text Search Technology 12 Institute of Reote Sensing and Digital Earth National Engineering Research Center for Reote Sensing Applications,Beijing,100101, China E-ail: yaoxj@radi.ac.cn Xiang
More informationResearch on a Kind of QoS-Sensitive Semantic Web Services Composition Method Based on Genetic Algorithm
roceedings of the 7th International Conference on Innovation & Manageent 893 Research on a Kind of QoS-Sensitive Seantic Web Services Coposition Method Based on Genetic Algorith Cao Hongjiang, Nie Guihua,
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationDebiasing Crowdsourced Batches
Debiasing Crowdsourced Batches Honglei Zhuang, Aditya Paraeswaran, Dan Roth and Jiawei Han Departent of Coputer Science University of Illinois at Urbana-Chapaign {hzhuang3, adityagp, danr, hanj}@illinois.edu
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationAN INTEGRATED APPROACH TO MUSIC BOUNDARY DETECTION
10th International Society for Music Inforation Retrieval Conference (ISMIR 2009) AN INTEGRATED APPROACH TO MUSIC BOUNDARY DETECTION Min-Yian Su, Yi-Hsuan Yang, Yu-Ching Lin, Hoer Chen National Taiwan
More information3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search
436 Journal of Electrical Engineering & Technology, Vol. 3, No. 3, pp. 436~443, 008 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search Dong-Min
More informationGromov-Hausdorff Distance Between Metric Graphs
Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value
More informationA wireless sensor network for visual detection and classification of intrusions
A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang
More informationData Caching for Enhancing Anonymity
Data Caching for Enhancing Anonyity Rajiv Bagai and Bin Tang Departent of Electrical Engineering and Coputer Science Wichita State University Wichita, Kansas 67260 0083, USA Eail: {rajiv.bagai, bin.tang}@wichita.edu
More informationPerformance Analysis of RAID in Different Workload
Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,
More informationA Neighborhood Relevance Model for Entity Linking
A Neighborhood Relevance Model for Entity Linking Jeffrey Dalton University of Massachusetts 140 Governors Drive Aherst, MA, U.S.A. jdalton@cs.uass.edu Laura Dietz University of Massachusetts 140 Governors
More informationPlanet Scale Software Updates
Planet Scale Software Updates Christos Gkantsidis 1, Thoas Karagiannis 2, Pablo Rodriguez 1, and Milan Vojnović 1 1 Microsoft Research 2 UC Riverside Cabridge, UK Riverside, CA, USA {chrisgk,pablo,ilanv}@icrosoft.co
More informationSummary. Reconstruction of data from non-uniformly spaced samples
Is there always extra bandwidth in non-unifor spatial sapling? Ralf Ferber* and Massiiliano Vassallo, WesternGeco London Technology Center; Jon-Fredrik Hopperstad and Ali Özbek, Schluberger Cabridge Research
More informationThe Henryk Niewodniczański INSTITUTE OF NUCLEAR PHYSICS Polish Academy of Sciences ul. Radzikowskiego 152, Kraków
The Henryk Niewodniczański INSTITUT OF NUCLAR PHYSICS Polish Acadey of Sciences ul. Radzikowskiego 152, 31-342 Kraków www.ifj.edu.pl/reports/2005.htl Kraków, October 2005 Report No. 1968/D The theroluinescence
More informationMeta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recommendation
Meta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recoendation Xiaozhong Liu School of Inforatics and Coputing Indiana University Blooington Blooington, IN, USA,
More informationEvaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds
Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles
More informationHUMAN pose estimation is an important problem in computer
JOURNAL OF L A T E X CLASS FILES, VOL. 6, NO., JANUARY 7 Robust 3D Huan Pose Estiation fro Single Iages or Video Sequences Chunyu Wang, Student Meber, IEEE, Yizhou Wang, Meber, IEEE, Zhouchen Lin, Meber,
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationNews Events Clustering Method Based on Staging Incremental Single-Pass Technique
News Events Clustering Method Based on Staging Increental Single-Pass Technique LI Yongyi 1,a *, Gao Yin 2 1 School of Electronics and Inforation Engineering QinZhou University 535099 Guangxi, China 2
More informationReal-Time Detection of Invisible Spreaders
Real-Tie Detection of Invisible Spreaders MyungKeun Yoon Shigang Chen Departent of Coputer & Inforation Science & Engineering University of Florida, Gainesville, FL 3, USA {yoon, sgchen}@cise.ufl.edu Abstract
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationReconstruction of Time Series using Optimal Ordering of ICA Components
Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu
More informationAdaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN
Proceedings of the nd International onference on oputer Science and Electronics Engineering (ISEE 3) Adaptive Paraeter Estiation Based ongestion Avoidance Strategy for DTN Qicai Yang, Futong Qin, Jianquan
More informationScheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We
More informationApproximate String Matching with Reduced Alphabet
Approxiate String Matching with Reduced Alphabet Leena Salela 1 and Jora Tarhio 2 1 University of Helsinki, Departent of Coputer Science leena.salela@cs.helsinki.fi 2 Aalto University Deptartent of Coputer
More informationNew Measures for the Evaluation of Interactive Information Retrieval Systems: Normalized Task Completion Time and Normalized User Effectiveness
New Measures for the Evaluation of Interactive Inforation Retrieval Systes: Noralized Task Copletion Tie and Noralized User Effectiveness Jing Cheng Graduate School of Library and Inforation Science, University
More informationRanking Spatial Data by Quality Preferences
1 Ranking Spatial Data by Quality Preferences Man Lung Yiu, Hua Lu, Nikos Maoulis, and Michail Vaitis Abstract A spatial preference query ranks objects based on the qualities of features in their spatial
More informationSupplementary Section. A. Algorithm. B. Datasets. C. More on Labeling Functions
Suppleentary Section In this section, we include ore details about our algorith, labeling functions, datasets as well as additional results and coparisons, which could not be included in the ain paper
More information