2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)最新文献

筛选
英文 中文
ZDLC: Towards Automated Software Construction and Migration ZDLC:走向自动化的软件构建和迁移
S. Khaddaj, Y. K. Makoondlall, B. Makoond, Shyam Chivukula, K. Keerthi
{"title":"ZDLC: Towards Automated Software Construction and Migration","authors":"S. Khaddaj, Y. K. Makoondlall, B. Makoond, Shyam Chivukula, K. Keerthi","doi":"10.1109/DCABES.2015.11","DOIUrl":"https://doi.org/10.1109/DCABES.2015.11","url":null,"abstract":"The construction of modern software projects with a multitude of quality requirements is a challenging and complex task particularly for large scale systems. Underestimating this complexity may result in project failures at worst or the delivery of poor quality products that are plagued with software defects at best. However, introducing scientific rigor at every step of the software development life cycle (SDLC) can reduce defect leakage through the different stages. While this can improve quality considerably it might affect upfront cost and speed of delivery. Thus, there is a clear need to introduce automation in software production and defect tracking. The Zero Deviation Life Cycle (ZDLC) framework addresses this conflict i.e. Quality vs. Cost, by proposing a methodology that can be applied not only to new projects but also to legacy applications.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125565589","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}
引用次数: 0
Several Stochastic Gradient Algorithms for Nonlinear Systems with Hard Nonlinearities 硬非线性非线性系统的几种随机梯度算法
Jia Tang
{"title":"Several Stochastic Gradient Algorithms for Nonlinear Systems with Hard Nonlinearities","authors":"Jia Tang","doi":"10.1109/DCABES.2015.99","DOIUrl":"https://doi.org/10.1109/DCABES.2015.99","url":null,"abstract":"This paper studies several identification methods for Hammerstein systems with piece-wise linearities. By using the key term separation technique, the model of the nonlinear Hammerstein systems be changed to an identification model, then based on the derived model, a stochastic gradient identification algorithm, a forgetting factor stochastic gradient algorithm and a modified stochastic gradient algorithm are used to estimate all the unknown parameters of the systems. An example is provided to show the effectiveness of the proposed algorithms.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122186964","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}
引用次数: 0
The Lager Ship Fluid-Solid Coupling Parallel Algorithm Based on VOSS Mapping Theory 基于VOSS映射理论的大型船舶流固耦合并行算法
Yuguang Li, Xin Chen, Shesheng Zhang
{"title":"The Lager Ship Fluid-Solid Coupling Parallel Algorithm Based on VOSS Mapping Theory","authors":"Yuguang Li, Xin Chen, Shesheng Zhang","doi":"10.1109/DCABES.2015.10","DOIUrl":"https://doi.org/10.1109/DCABES.2015.10","url":null,"abstract":"The fluid-solid coupling hydrodynamics parallel model of large ship is built based on VOSS mapping theory. The VOSS algorithm of large ship's wave is given, and the control equation and initial boundary conditions are derived from fluid hydrodynamic theory and solid elastic theory. The numerical results show the VOSS transfer of ship fluid-solid coupling wave is not same as coming see wave.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125145663","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}
引用次数: 0
A New Improved Algorithm Based on Three-Stage Inversion Procedure of Forest Height 一种基于三级森林高度反演的改进算法
Xiang Sun, Hongjun Song
{"title":"A New Improved Algorithm Based on Three-Stage Inversion Procedure of Forest Height","authors":"Xiang Sun, Hongjun Song","doi":"10.1109/DCABES.2015.111","DOIUrl":"https://doi.org/10.1109/DCABES.2015.111","url":null,"abstract":"The three-stage inversion algorithm and the random volume over ground (RVoG) model can estimate forest parameters, using single baseline polarimetric synthetic aperture radar interferometry (PolInSAR) data. However, the classical method to invert forest height cannot hold the real data, as there are a lot of error data, which is not consistent with practice in theory. Accordingly, the results of classical inversion method are not accuracy and have many noise points. To overcome this problem, the improved algorithm eliminates the singular points while fitting the least square line to determine the location of the ground phase in complex unit circle. This new algorithm is more suitable for practical data.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133859791","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}
引用次数: 1
Use Pre-record Algorithm to Improve Process Migration Efficiency 采用预记录算法提高流程迁移效率
Shan Zhongyuan, Qiao Jianzhong, Lin Shukuan, Zhang Qiang
{"title":"Use Pre-record Algorithm to Improve Process Migration Efficiency","authors":"Shan Zhongyuan, Qiao Jianzhong, Lin Shukuan, Zhang Qiang","doi":"10.1109/DCABES.2015.20","DOIUrl":"https://doi.org/10.1109/DCABES.2015.20","url":null,"abstract":"Process migration is one of the most important features in parallel and distributed computing. It enables dynamic load balance and makes better utilization of computing resource. Post-copy is a very efficient migration algorithm but it needs process to resume on destination node with incomplete address space which may significantly reduce its efficiency especially at the initial phase. To solve this problem, we propose a new algorithm named as Pre-record. It will prolong process execution on host node for a short while before suspend and record the used memory pages. While transmitting process address space, these recorded pages will be transferred preferentially. So, At the initial phase of process resume on destination node, the needed memory pages have already been stored, no pages faults occurs. We evaluate Pre-record performance through simulation test, make a comparison with the other algorithms, and the results shows that Pre-Record could significantly reduce page faults number and improve process migration efficiency.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132945337","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}
引用次数: 5
Applying Innovation Resistance Theory to Understand Consumer Resistance of Using Online Travel in Thailand 运用创新阻力理论理解泰国消费者对在线旅游的抗拒
Kanjana Jansukpum, Supamas Kettem
{"title":"Applying Innovation Resistance Theory to Understand Consumer Resistance of Using Online Travel in Thailand","authors":"Kanjana Jansukpum, Supamas Kettem","doi":"10.1109/DCABES.2015.42","DOIUrl":"https://doi.org/10.1109/DCABES.2015.42","url":null,"abstract":"Base on innovation resistance theory, this research builds the model of factors affecting consumers' resistance in using online travel in Thailand. Through the questionnaires and the SEM methods, empirical analysis results show that functional barriers are even greater sources of resistance to online travel website than psychological barriers. Online experience and independent travel experience have significantly influenced on consumer innovation resistance. Social influence plays an important role in this research.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114332361","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}
引用次数: 14
Virtual Machine Migration Strategy in Cloud Computing 云计算中的虚拟机迁移策略
S. Liyanage, S. Khaddaj, J. Francik
{"title":"Virtual Machine Migration Strategy in Cloud Computing","authors":"S. Liyanage, S. Khaddaj, J. Francik","doi":"10.1109/DCABES.2015.44","DOIUrl":"https://doi.org/10.1109/DCABES.2015.44","url":null,"abstract":"In a typical cloud based data centre, several physical machines (PM) host dozens of virtual machines (VM), which run various applications and services. VM load varies according to the different type of users' applications and traffic, and sometime this traffic may overwhelm VM's resources. Physical machines that host many VMs have limited capacity and if they are overloaded their performance might degrade or completely fail. A VM machine that hosts several different applications on a heavily loaded PM can be migrated to another under loaded PM in order to exploit the availability of the resources and to balance the load. In data centres, VMs exposed to huge amount of user traffic, if VM migration occurs on a network link that is overwhelmed with user traffic, then it will create a bottleneck if there's not enough bandwidth on the link to support the VM migration. Therefore, there is a clear need for mechanisms to control user traffic on both source and destination PMs in order to provide guaranteed bandwidth that needed for VM migration.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123207125","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}
引用次数: 8
A Hill-Type Submaximally-Activated Musculotendon Model and Its Simulation hill型亚极大激活肌肌腱模型及其模拟
Lixin Sun, Yingfei Sun, Zhipei Huang, Jiateng Hou, Jiankang Wu
{"title":"A Hill-Type Submaximally-Activated Musculotendon Model and Its Simulation","authors":"Lixin Sun, Yingfei Sun, Zhipei Huang, Jiateng Hou, Jiankang Wu","doi":"10.1109/DCABES.2015.116","DOIUrl":"https://doi.org/10.1109/DCABES.2015.116","url":null,"abstract":"Hill-type models are ubiquitous in biomechanical simulations because of their computational simplicity and efficiency. But these models are designed to describe the maximally activated muscles and muscle properties are linearly scaled when they are applied to sub maximally activated conditions. This scaling approach should be based on the independence of muscle activation and force-length properties, which has not been proven yet. Actually, muscles in vivo are unlikely to be often maximally activated during daily life. Therefore, effective methods should be taken to modify the existing Hill-type model to insure the accuracy of their applications. This paper analyzed the sub maximal activation conditions, developed a sub maximally-activated musculotendon model on the basis of Millard damped equilibrium model and implemented the benchmark experiments to verify effectiveness of the modified model.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125350178","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}
引用次数: 3
An Improved Live-Wire Freed from the Restriction of the Direct Line Between Seed Points 一种不受种子点间直线限制的改进活线
Zhou Di, Xu Wenbo
{"title":"An Improved Live-Wire Freed from the Restriction of the Direct Line Between Seed Points","authors":"Zhou Di, Xu Wenbo","doi":"10.1109/DCABES.2015.94","DOIUrl":"https://doi.org/10.1109/DCABES.2015.94","url":null,"abstract":"In the original live-wire algorithm, optimality is defined as the minimum cumulative cost path from a seed point to another, where the cumulative cost of a path is the sum of the local edge costs on the path. Therefore, the optimal path between two seed points is restricted not far away from the straight line between these two points. Consequently, when delineating a boundary with acute concaves and convexes, more seed points are required which can become very time consuming to calculate. This paper proposed an improved live-wire algorithm where the optimality is redefined as the minimum average cost path between two seed points, which frees the optimal path from the restriction of the straight line. In theory, the original live-wire algorithm is only a special case of our improved algorithm. Furthermore, the Canny edges on the boundary of the target object is weighted according to the gray or color value of the seed point. Experiments conducted on a variety of image types have shown that this improved live-wire algorithm requires less seed points than the original algorithm when delineating the same boundary and as a result, reduces the time required to complete the calculation.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126204653","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}
引用次数: 0
Project Evaluation of Jilin Rural Power Grid Reformation Based on Rough Set and Support Vector Machine 基于粗糙集和支持向量机的吉林农村电网改造项目评价
Du Qiushi, Wang Guan-nan, Cong Li
{"title":"Project Evaluation of Jilin Rural Power Grid Reformation Based on Rough Set and Support Vector Machine","authors":"Du Qiushi, Wang Guan-nan, Cong Li","doi":"10.1109/DCABES.2015.128","DOIUrl":"https://doi.org/10.1109/DCABES.2015.128","url":null,"abstract":"Based on the current situation of rural power grid construction and reformation project in Jilin rural areas, evaluation index system of rural power grid reformation project is established. Aiming at characteristics of a larger number of indicators, rural power grid reformation evaluation model is put forward based on rough set and support vector machine. Through the examples analysis of evaluation data of Jilin rural power grid, rural power grid reformation makes remarkable benefit, proving that the method has higher classification accuracy which is practical and feasible and the model works well.","PeriodicalId":444588,"journal":{"name":"2015 14th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678008","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书