This paper proposes a reconfigurable high performance multiplier (RHPM) based on multi-granularity design and parallel acceleration. Capable of supporting multiple precisions for different processing requirements, the RHPM can perform one 32×32, two 16×16, or four 8×8 bit unsigned/signed multiplication, or one 16×16, or two 8×8 bit complex number multiplication. The structures of the partial product generator and the partial product accumulator are improved in the paper, so as to reuse most of the hardware resources. Compression can be completed automatically by means of recording the validity of every bit in the partial product array which accelerates the computation dramatically. The RHPM is implemented with TSMC 28nm technology, exhibiting a 0.68s of the critical path delay, while consuming only 0.6281mW in power. Results show its significant superiority in terms of performance and power efficiency compared with our previous work or other similar products.
{"title":"A reconfigurable high-performance multiplier based on multi-granularity design and parallel acceleration","authors":"Feng Jing, Zijun Liu, Xiaojun Ma, Guo Yang, Guo Peng, Donglin Wang","doi":"10.1109/ICSESS.2017.8342979","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342979","url":null,"abstract":"This paper proposes a reconfigurable high performance multiplier (RHPM) based on multi-granularity design and parallel acceleration. Capable of supporting multiple precisions for different processing requirements, the RHPM can perform one 32×32, two 16×16, or four 8×8 bit unsigned/signed multiplication, or one 16×16, or two 8×8 bit complex number multiplication. The structures of the partial product generator and the partial product accumulator are improved in the paper, so as to reuse most of the hardware resources. Compression can be completed automatically by means of recording the validity of every bit in the partial product array which accelerates the computation dramatically. The RHPM is implemented with TSMC 28nm technology, exhibiting a 0.68s of the critical path delay, while consuming only 0.6281mW in power. Results show its significant superiority in terms of performance and power efficiency compared with our previous work or other similar products.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128007639","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343027
Zhangping
In the past few years, convolutional neural network-ks(CNN) has made great progress in various computer vision tasks, but its ability to tolerate scale variations is limited. For solving this problem, a common solution is making the model bigger first, and then trains it with data augmentation using extensive scale-jittering. This method greatly increased the study requirement. In this paper, we propose a multi-column structure of CNN, and experiment it at a basic neural network. The structure can effectively solve the problem of scale robustness in target recognition, and almost haven't any increase in study requirement. Especially, our structure is particularly effective when dealing with a wide range of scale-variant problem.
{"title":"A neural network structure with wide range scale robustness","authors":"Zhangping","doi":"10.1109/ICSESS.2017.8343027","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343027","url":null,"abstract":"In the past few years, convolutional neural network-ks(CNN) has made great progress in various computer vision tasks, but its ability to tolerate scale variations is limited. For solving this problem, a common solution is making the model bigger first, and then trains it with data augmentation using extensive scale-jittering. This method greatly increased the study requirement. In this paper, we propose a multi-column structure of CNN, and experiment it at a basic neural network. The structure can effectively solve the problem of scale robustness in target recognition, and almost haven't any increase in study requirement. Especially, our structure is particularly effective when dealing with a wide range of scale-variant problem.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130578635","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342942
Jun Wang, Lu Liu, Xuan Zhu, Na Ai, Kun Yan
This paper presents an effective multi-focus image fusion method based on the online sparse dictionary learning with double sparsity model. First, we learn the dictionaries through the source images using the online sparse dictionary learning algorithm, which enables a multi-scale analysis and train an adaptive dictionary. Then, the sparse representation coefficients of the source images may be acquired by the learned dictionary. Finally, the fused image is formed by choosing the max fusion rule and the learned dictionary. Experimental results show that the proposed method is superior to the conventional fusion methods in terms of the visual and indicator evaluation.
{"title":"Multi-focus image fusion with online sparse dictionary learning","authors":"Jun Wang, Lu Liu, Xuan Zhu, Na Ai, Kun Yan","doi":"10.1109/ICSESS.2017.8342942","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342942","url":null,"abstract":"This paper presents an effective multi-focus image fusion method based on the online sparse dictionary learning with double sparsity model. First, we learn the dictionaries through the source images using the online sparse dictionary learning algorithm, which enables a multi-scale analysis and train an adaptive dictionary. Then, the sparse representation coefficients of the source images may be acquired by the learned dictionary. Finally, the fused image is formed by choosing the max fusion rule and the learned dictionary. Experimental results show that the proposed method is superior to the conventional fusion methods in terms of the visual and indicator evaluation.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130605478","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343015
Shuai Li, Xiaojun Huang
Based on the open source distributed service architecture Dubbo, this paper extends the serialization protocol Protostuff, an efficient binary serialization and deserialization protocol, improves the efficiency of transmission, and optimizes the transmission call protocol Thrift of RPC to improve RPC communication performance and implementation between heterogeneous systems.
{"title":"Dubbo's serialization protocol extension and optimization of its RPC protocol thrift","authors":"Shuai Li, Xiaojun Huang","doi":"10.1109/ICSESS.2017.8343015","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343015","url":null,"abstract":"Based on the open source distributed service architecture Dubbo, this paper extends the serialization protocol Protostuff, an efficient binary serialization and deserialization protocol, improves the efficiency of transmission, and optimizes the transmission call protocol Thrift of RPC to improve RPC communication performance and implementation between heterogeneous systems.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130469","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342883
Amr Megahed, Sondos M. Fadl, Q. Han, Qiong Li
Document forgery detection is a vitally important field because the forensic role is used in many types of crimes. Adding new text is the most common type of document forgery methods because it is easy to apply and hard to detect. In this paper, a novel method is proposed to detect the forgery in a text by detecting different ink using image processing instead of conventional methods. All documents are scanned as an image and segmented into objects. Then nine features are extracted from each object based on red, green and blue channels. Distance measurements between each nearby pairs of feature vectors are computed using root mean square error. Modified Thompson Tau test is applied to extract anomaly points. The tampered points are then obtained exactly from anomaly points. Modified Thompson Tau test has a high-efficiency detection and a low omission ratio but its precision is not ideal. Therefore, the second outlier detection has been used to help to make up the difference in precision. The experimental results show that our proposed method can not only detect but also localize tampered objects efficiently.
{"title":"Handwriting forgery detection based on ink colour features","authors":"Amr Megahed, Sondos M. Fadl, Q. Han, Qiong Li","doi":"10.1109/ICSESS.2017.8342883","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342883","url":null,"abstract":"Document forgery detection is a vitally important field because the forensic role is used in many types of crimes. Adding new text is the most common type of document forgery methods because it is easy to apply and hard to detect. In this paper, a novel method is proposed to detect the forgery in a text by detecting different ink using image processing instead of conventional methods. All documents are scanned as an image and segmented into objects. Then nine features are extracted from each object based on red, green and blue channels. Distance measurements between each nearby pairs of feature vectors are computed using root mean square error. Modified Thompson Tau test is applied to extract anomaly points. The tampered points are then obtained exactly from anomaly points. Modified Thompson Tau test has a high-efficiency detection and a low omission ratio but its precision is not ideal. Therefore, the second outlier detection has been used to help to make up the difference in precision. The experimental results show that our proposed method can not only detect but also localize tampered objects efficiently.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116365466","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342853
T. Yamakami
In order to make use of full potential of an IoT smart city platform, it is important to accommodate a wide range of services on top of it. For service engineering for such a case, a new service engineering paradigm is required to deal with existing obstacles of service adoption. The author examines the confrontation axes of service design to extract dimensions of unconventional service engineering. From the list, the author presents a dimensional view model of unconventional service engineering. The author presents a dimensional view model of senior service engineering to include unconventional service engineering as one of its dimension. The author describes an early-morning service portal for senior citizens derived from the proposed view model.
{"title":"Unconventional service engineering: Toward a new paradigm of service engineering for empowering senior citizens in City platform as a service","authors":"T. Yamakami","doi":"10.1109/ICSESS.2017.8342853","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342853","url":null,"abstract":"In order to make use of full potential of an IoT smart city platform, it is important to accommodate a wide range of services on top of it. For service engineering for such a case, a new service engineering paradigm is required to deal with existing obstacles of service adoption. The author examines the confrontation axes of service design to extract dimensions of unconventional service engineering. From the list, the author presents a dimensional view model of unconventional service engineering. The author presents a dimensional view model of senior service engineering to include unconventional service engineering as one of its dimension. The author describes an early-morning service portal for senior citizens derived from the proposed view model.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"51 23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126086722","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343037
Yiwei Wu, Xiaoling Xia, Jiajing Le
Evaluating students' achievements which including many subjects is a great challenge. It seems not so accurate that simply adding these scores and ranking, because it is difficult to distinguish which one is a student good at and which one is not. Data mining is a good way to solve this problem. In this paper, students' achievements are appraised based on factor analysis and cluster analysis. First, common factors are extracted from scores of multitudinous subjects. Then factor scores and comprehensive scores can be computed. After that, all students can be segregated into several clusters by cluster analysis based on factor scores. The result shows objective synthetical evaluation of students, which will benefit education in the future.
{"title":"Evaluation of students' achievements based on factor analysis and cluster analysis","authors":"Yiwei Wu, Xiaoling Xia, Jiajing Le","doi":"10.1109/ICSESS.2017.8343037","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343037","url":null,"abstract":"Evaluating students' achievements which including many subjects is a great challenge. It seems not so accurate that simply adding these scores and ranking, because it is difficult to distinguish which one is a student good at and which one is not. Data mining is a good way to solve this problem. In this paper, students' achievements are appraised based on factor analysis and cluster analysis. First, common factors are extracted from scores of multitudinous subjects. Then factor scores and comprehensive scores can be computed. After that, all students can be segregated into several clusters by cluster analysis based on factor scores. The result shows objective synthetical evaluation of students, which will benefit education in the future.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127923767","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342873
Jeisson Vergara-Vargas, Henry Umaña-Acosta
Software architecture aims to satisfy the software requirements from different points of view. It is represented by models which are the reference for understanding the structure and behavior of the software. In this way, one of the biggest challenges is to ensure that a software system can improve its performance through the use of scalability tactics, especially to support larger number of concurrent users. This paper presents a model-driven deployment approach to design models of distributed software architectures. In particular, models for web-based software systems in order to support its automatic implementation and its dynamic deployment on a cloud computing platform, using the horizontal scaling tactic. In addition, we design and propose Sarch to build the models, a domain-specific language based on the specification of a set of architectural styles and its representation as architectural views.
{"title":"A model-driven deployment approach for scaling distributed software architectures on a cloud computing platform","authors":"Jeisson Vergara-Vargas, Henry Umaña-Acosta","doi":"10.1109/ICSESS.2017.8342873","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342873","url":null,"abstract":"Software architecture aims to satisfy the software requirements from different points of view. It is represented by models which are the reference for understanding the structure and behavior of the software. In this way, one of the biggest challenges is to ensure that a software system can improve its performance through the use of scalability tactics, especially to support larger number of concurrent users. This paper presents a model-driven deployment approach to design models of distributed software architectures. In particular, models for web-based software systems in order to support its automatic implementation and its dynamic deployment on a cloud computing platform, using the horizontal scaling tactic. In addition, we design and propose Sarch to build the models, a domain-specific language based on the specification of a set of architectural styles and its representation as architectural views.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127408303","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8343022
Ganyi Tang, Gui-Fu Lu, Zhongqun Wang
Tensor PCA, which can make full use of the spatial relationship of images/videos, plays an important role in computer vision and image analysis. The proposed method is robust to outliers because of using the adjustable Lp-norm. The elastic net, which generalizes the sparsity-inducing lasso penalty by combining the ridge penalty, is integrated into the objective function to develop a sparse model, which is beneficial for features extraction. We propose a greedy algorithm to extract basic features one by one and optimize projection matrices alternatively. The monotonicity of the iterative procedure are theoretically guaranteed. Experimental results upon several face databases demonstrate the advantages of the proposed approach.
{"title":"Robust and sparse tensor analysis with Lp-norm maximization","authors":"Ganyi Tang, Gui-Fu Lu, Zhongqun Wang","doi":"10.1109/ICSESS.2017.8343022","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8343022","url":null,"abstract":"Tensor PCA, which can make full use of the spatial relationship of images/videos, plays an important role in computer vision and image analysis. The proposed method is robust to outliers because of using the adjustable Lp-norm. The elastic net, which generalizes the sparsity-inducing lasso penalty by combining the ridge penalty, is integrated into the objective function to develop a sparse model, which is beneficial for features extraction. We propose a greedy algorithm to extract basic features one by one and optimize projection matrices alternatively. The monotonicity of the iterative procedure are theoretically guaranteed. Experimental results upon several face databases demonstrate the advantages of the proposed approach.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"53 Pt 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127343527","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 : 2017-11-01DOI: 10.1109/ICSESS.2017.8342907
Pinghua Zhang
In order to overcome the shortcomings of artificial bee colony algorithm induding slow convergence speed, easily falling into local optimum value, neglect of development and other issues, Mechanism of other bionic intelligent optimization algorithms, A new algorithm of Global Artificial Bee Colony algorithm based on crossover which can effectively improve the convergence rate, enhance the development of the algorithm and the global optimization ability is proposed, and the algorithm can effectively avoid the local optimum. Finally, the Seven standard test functions are selected to carry out the experiment and simulation. The results show that the convergence speed and accuracy of the proposed algorithm (CGABC) are significantly improved compared with other algorithms such as ABC algorithm, GABC algorithm and so on.
{"title":"Research on global artificial bee colony algorithm based on crossover","authors":"Pinghua Zhang","doi":"10.1109/ICSESS.2017.8342907","DOIUrl":"https://doi.org/10.1109/ICSESS.2017.8342907","url":null,"abstract":"In order to overcome the shortcomings of artificial bee colony algorithm induding slow convergence speed, easily falling into local optimum value, neglect of development and other issues, Mechanism of other bionic intelligent optimization algorithms, A new algorithm of Global Artificial Bee Colony algorithm based on crossover which can effectively improve the convergence rate, enhance the development of the algorithm and the global optimization ability is proposed, and the algorithm can effectively avoid the local optimum. Finally, the Seven standard test functions are selected to carry out the experiment and simulation. The results show that the convergence speed and accuracy of the proposed algorithm (CGABC) are significantly improved compared with other algorithms such as ABC algorithm, GABC algorithm and so on.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130985013","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
扫码关注我们
求助内容：
应助结果提醒方式：