Pub Date : 2016-03-03DOI: 10.4236/jsea.2018.116020
J. Berg, 芳賀 博英
Software projects are becoming larger and more complicated. Managing those projects is based on several software development methodologies. One of those methodologies is software version control, which is used in the majority of worldwide software projects. Although existing version control systems provide sufficient functionality in many situations, they are lacking in terms of semantics and structure for source code. It is commonly believed that improving software version control can contribute substantially to the development of software. We present a solution that considers a structural model for matching source code that can be used in version control.
{"title":"Matching source code using abstract syntax trees in version control (知能ソフトウェア工学)","authors":"J. Berg, 芳賀 博英","doi":"10.4236/jsea.2018.116020","DOIUrl":"https://doi.org/10.4236/jsea.2018.116020","url":null,"abstract":"Software projects are becoming larger and more complicated. Managing those projects is based on several software development methodologies. One of those methodologies is software version control, which is used in the majority of worldwide software projects. Although existing version control systems provide sufficient functionality in many situations, they are lacking in terms of semantics and structure for source code. It is commonly believed that improving software version control can contribute substantially to the development of software. We present a solution that considers a structural model for matching source code that can be used in version control.","PeriodicalId":377405,"journal":{"name":"IEICE technical report. Speech","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125607692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Various de novo assembly methods based on the concept of k-mer have been proposed. Despite the success of these methods, an alternative approach, referred to as the hybrid approach, has recently been proposed that combines different traditional methods to effectively exploit each of their properties in an integrated manner. However, the results obtained from the traditional methods used in the hybrid approach depend not only on the specific algorithm or heuristics but also on the selection of a user-specific k-mer size. Consequently, the results obtained with the hybrid approach also depend on these factors. Here, we designed a new assembly approach, referred to as the rule-based assembly. This approach follows a similar strategy to the hybrid approach, but employs specific rules learned from certain characteristics of draft contigs to remove any erroneous contigs and then merges them. To construct the most effective rules for this purpose, a learning method based on decision trees, i.e., a complex decision tree, is proposed. Comparative experiments were also conducted to validate the method. The results showed that proposed method could outperformed traditional methods in certain cases.
{"title":"Rule-based Assembly for Short Read Data Set obtained with Multiple Assemblers and k-mer Sizes (情報論的学習理論と機械学習)","authors":"Aya Oshiro, H. Afuso, T. Okazaki","doi":"10.2197/IPSJTBIO.10.9","DOIUrl":"https://doi.org/10.2197/IPSJTBIO.10.9","url":null,"abstract":"Various de novo assembly methods based on the concept of k-mer have been proposed. Despite the success of these methods, an alternative approach, referred to as the hybrid approach, has recently been proposed that combines different traditional methods to effectively exploit each of their properties in an integrated manner. However, the results obtained from the traditional methods used in the hybrid approach depend not only on the specific algorithm or heuristics but also on the selection of a user-specific k-mer size. Consequently, the results obtained with the hybrid approach also depend on these factors. Here, we designed a new assembly approach, referred to as the rule-based assembly. This approach follows a similar strategy to the hybrid approach, but employs specific rules learned from certain characteristics of draft contigs to remove any erroneous contigs and then merges them. To construct the most effective rules for this purpose, a learning method based on decision trees, i.e., a complex decision tree, is proposed. Comparative experiments were also conducted to validate the method. The results showed that proposed method could outperformed traditional methods in certain cases.","PeriodicalId":377405,"journal":{"name":"IEICE technical report. Speech","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114411220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-09-30DOI: 10.7490/F1000RESEARCH.1096780.1
Y-h. Taguchi
{"title":"Heuristic principal component analysis based unsupervised feature extraction and its application to bioinformatics (情報論的学習理論と機械学習 情報論的学習理論ワークショップ)","authors":"Y-h. Taguchi","doi":"10.7490/F1000RESEARCH.1096780.1","DOIUrl":"https://doi.org/10.7490/F1000RESEARCH.1096780.1","url":null,"abstract":"","PeriodicalId":377405,"journal":{"name":"IEICE technical report. Speech","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128558763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A random-walk model is investigated and utilized to analyze the performance of a coding scheme that aims to extend the lifetime of flash memory. Flash memory is widely used in various products today, but the cells that constitute flash memory wear out as they experience many operations. This issue can be mitigated by employing a clever coding scheme that is known as a flash code. The purpose of this study is to establish a well-defined random-walk model of a flash code that is known as an index-less indexed flash code (ILIFC), and clarify the expected performance of ILIFC. Preliminary study has been made by the author for a simplified model of data operation, and the contribution of this study is to extend the model of data operation to more general and practical one. Mathematical properties of the random-walk model is reconsidered, and useful properties are derived that help analyzing the performance of ILIFC both in non-asymptotic and asymptotic scenarios.
{"title":"Performance Evaluation of Index-Less Indexed Flash Codes for Non-Uniform Write Operations (ニューロコンピューティング)","authors":"Y. Kaji","doi":"10.2197/IPSJTRANS.8.9","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.8.9","url":null,"abstract":"A random-walk model is investigated and utilized to analyze the performance of a coding scheme that aims to extend the lifetime of flash memory. Flash memory is widely used in various products today, but the cells that constitute flash memory wear out as they experience many operations. This issue can be mitigated by employing a clever coding scheme that is known as a flash code. The purpose of this study is to establish a well-defined random-walk model of a flash code that is known as an index-less indexed flash code (ILIFC), and clarify the expected performance of ILIFC. Preliminary study has been made by the author for a simplified model of data operation, and the contribution of this study is to extend the model of data operation to more general and practical one. Mathematical properties of the random-walk model is reconsidered, and useful properties are derived that help analyzing the performance of ILIFC both in non-asymptotic and asymptotic scenarios.","PeriodicalId":377405,"journal":{"name":"IEICE technical report. Speech","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122497178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-10DOI: 10.1109/mwsym.2010.5516899
Mizushina Shizuo, Adachi Atsushi
{"title":"A Technique for Wireless LAN Connection through Building Concrete Wall at 2.4GHz","authors":"Mizushina Shizuo, Adachi Atsushi","doi":"10.1109/mwsym.2010.5516899","DOIUrl":"https://doi.org/10.1109/mwsym.2010.5516899","url":null,"abstract":"","PeriodicalId":377405,"journal":{"name":"IEICE technical report. Speech","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133507508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SrS:Cu films were prepared by an electron beam deposition method to improve the emission properties of blue EL elements. SrS:Cu pellets were used as an evaporant of SrS:Cu films. The correlation between pellet-sintering condition and crystallinity of SrS:Cu films was investigated. As a result, it was found that the 2-hour pellet-sintering under 600°C was best to prepare superior SrS:Cu films. It was also found that the crystallinity of SrS:Cu films were greatly improved after 2-min rapid thermal annealing (RTA) process under 450°C.
{"title":"Evaluation of crystallinity of SrS:Cu films for blue EL elements","authors":"M. Isai, Tomoyosi Horino, Y. Kurachi","doi":"10.14723/tmrsj.33.1309","DOIUrl":"https://doi.org/10.14723/tmrsj.33.1309","url":null,"abstract":"SrS:Cu films were prepared by an electron beam deposition method to improve the emission properties of blue EL elements. SrS:Cu pellets were used as an evaporant of SrS:Cu films. The correlation between pellet-sintering condition and crystallinity of SrS:Cu films was investigated. As a result, it was found that the 2-hour pellet-sintering under 600°C was best to prepare superior SrS:Cu films. It was also found that the crystallinity of SrS:Cu films were greatly improved after 2-min rapid thermal annealing (RTA) process under 450°C.","PeriodicalId":377405,"journal":{"name":"IEICE technical report. Speech","volume":"66 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133455268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a new classifier, named electric network classifiers, for semi-supervised learning on graphs. Our classifier is based on nonlinear electric network theory and classifies data set with respect to the sign of electric potential. Close relationships to C-SVM and graph kernel methods are revealed. Unlike other graph kernel methods, our classifier does not require heavy kernel computations but obtains the potential directly using efficient network flow algorithms. Furthermore, with flexibility of its formulation, our classifier can incorporate various edge characteristics; influence of edge direction, unsymmetric dependence and so on. Therefore, our classifier has the potential to tackle large complex real world problems. Experimental results show that the performance is fairly good compared with the diffusion kernel and other standard methods.
{"title":"Electric Network Classifier for Semi-Supervised Learning on Graphs","authors":"M. Rikitoku, H. Hirai, K. Murota","doi":"10.15807/jorsj.50.219","DOIUrl":"https://doi.org/10.15807/jorsj.50.219","url":null,"abstract":"We propose a new classifier, named electric network classifiers, for semi-supervised learning on graphs. Our classifier is based on nonlinear electric network theory and classifies data set with respect to the sign of electric potential. Close relationships to C-SVM and graph kernel methods are revealed. Unlike other graph kernel methods, our classifier does not require heavy kernel computations but obtains the potential directly using efficient network flow algorithms. Furthermore, with flexibility of its formulation, our classifier can incorporate various edge characteristics; influence of edge direction, unsymmetric dependence and so on. Therefore, our classifier has the potential to tackle large complex real world problems. Experimental results show that the performance is fairly good compared with the diffusion kernel and other standard methods.","PeriodicalId":377405,"journal":{"name":"IEICE technical report. Speech","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115741471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：