Pub Date : 2011-07-15DOI: 10.1109/ICSESS.2011.5982278
Meng Wei, Yu Bin
The optimization of vehicle routing is essentially a constraint-based shortest path problem, which can be resolved by Hopfield-based neural network. This paper proposes a vehicle routing optimization algorithm based on Hopfield, which can offer a solution for logistics distribution routing quickly under the circumstance of the given distribution position and cargo amount. Experimental results have shown that the algorithm has advantages in fast convergence and accurate computation, etc.
{"title":"Research on optimization of vehicle routing based on Hopfield neural network","authors":"Meng Wei, Yu Bin","doi":"10.1109/ICSESS.2011.5982278","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982278","url":null,"abstract":"The optimization of vehicle routing is essentially a constraint-based shortest path problem, which can be resolved by Hopfield-based neural network. This paper proposes a vehicle routing optimization algorithm based on Hopfield, which can offer a solution for logistics distribution routing quickly under the circumstance of the given distribution position and cargo amount. Experimental results have shown that the algorithm has advantages in fast convergence and accurate computation, etc.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324148","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982468
Guanghui Li, Jianmin Chen
In this paper, firstly we introduce the routing protocols of mobile Ad hoc network. We then introduce the basic principle of DSDV and AODV routing protocols, including the types of protocol frames, the process of establishing routing path of protocols and maintenance operations. We also describe the changes of the AODV protocol by AODVUU. Then, we simulate the configurations of mobile nodes and scene generating by the network simulator NS2. Lastly, we compare and analyze the performances of DSDV, AODV and AODVUU protocols from packet delivery rate to end-to-end average delay, together with the interpretation for it. These works can be good references to the research of Ad hoc routing protocols.
{"title":"The research of routing algorithms based on NS2 in mobile ad hoc networks","authors":"Guanghui Li, Jianmin Chen","doi":"10.1109/ICSESS.2011.5982468","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982468","url":null,"abstract":"In this paper, firstly we introduce the routing protocols of mobile Ad hoc network. We then introduce the basic principle of DSDV and AODV routing protocols, including the types of protocol frames, the process of establishing routing path of protocols and maintenance operations. We also describe the changes of the AODV protocol by AODVUU. Then, we simulate the configurations of mobile nodes and scene generating by the network simulator NS2. Lastly, we compare and analyze the performances of DSDV, AODV and AODVUU protocols from packet delivery rate to end-to-end average delay, together with the interpretation for it. These works can be good references to the research of Ad hoc routing protocols.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130015971","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982321
Chuangwei Lin, He Chen
As an ancient governance model, partnership becomes a unique scene in human-capital-intensive industries, breaking the monopoly position of corporate system in the governance models of enterprises. This paper reviews the disputes over the effectiveness of partnership. Some scholars propose that, from the perspective of information economics, team production and unobservable input in corporate system lead to the existence of non-efficiency behaviors-free rider problem. Other scholars speak in defense of the efficiency of partnership. When the professional team production is not easy to supervise, partnership is an effective governance model. As long as the partners bear unlimited liability, partnership can achieve approximate efficiency by a simple pooling strategy. Even if the partners bear limited liability, as long as co-supervision exists, efficiency of partnership is still achievable. Finally, a brief conclusion will be put forward.
{"title":"Notice of RetractionA research on the the efficiency of partnership","authors":"Chuangwei Lin, He Chen","doi":"10.1109/ICSESS.2011.5982321","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982321","url":null,"abstract":"As an ancient governance model, partnership becomes a unique scene in human-capital-intensive industries, breaking the monopoly position of corporate system in the governance models of enterprises. This paper reviews the disputes over the effectiveness of partnership. Some scholars propose that, from the perspective of information economics, team production and unobservable input in corporate system lead to the existence of non-efficiency behaviors-free rider problem. Other scholars speak in defense of the efficiency of partnership. When the professional team production is not easy to supervise, partnership is an effective governance model. As long as the partners bear unlimited liability, partnership can achieve approximate efficiency by a simple pooling strategy. Even if the partners bear limited liability, as long as co-supervision exists, efficiency of partnership is still achievable. Finally, a brief conclusion will be put forward.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131087233","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982293
Y. Li, G. Chang, C. J. Zhang, S. Liang
Analyze the drawbacks of common real-value negative selection algorithm applied on fault diagnosis, and the modified real-value negative selection algorithm is presented based on the corresponding innovations. Firstly, the fault detector set is partitioned into remember-detector set covering known-fault space and random-detector set covering unknown-fault space. Secondly, taking all known states including normal state as self set in training period, get the random-detector set through negative selection and distribution optimization. Lastly, in order to avoid ‘Fail to Alarm’ event caused by the Hole, the two-time-matching method is presented in detecting period which takes the normal state as self set. A resistance circuit fault diagnosis experiment shows that compared with the common real-value negative selection algorithm, the modified real-value negative algorithm can effectively avoid ‘Fail to Alarm’ event, and has higher diagnostic accuracy.
分析了常用的实值负选择算法在故障诊断中的不足，在相应的创新基础上提出了改进的实值负选择算法。首先，将故障检测集划分为覆盖已知故障空间的记忆检测集和覆盖未知故障空间的随机检测集。其次，将训练期间包括正态在内的所有已知状态作为自集，通过负选择和分布优化得到随机检测集;最后，为了避免孔洞导致的“未报警”事件，在检测周期提出了以正常状态为自设定的双时间匹配方法。一项电阻电路故障诊断实验表明，与常用的实值负选择算法相比，改进的实值负选择算法能有效避免“Fail to Alarm”事件，具有更高的诊断准确率。
{"title":"Modified real-value negative selection algorithm and its application on fault diagnosis","authors":"Y. Li, G. Chang, C. J. Zhang, S. Liang","doi":"10.1109/ICSESS.2011.5982293","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982293","url":null,"abstract":"Analyze the drawbacks of common real-value negative selection algorithm applied on fault diagnosis, and the modified real-value negative selection algorithm is presented based on the corresponding innovations. Firstly, the fault detector set is partitioned into remember-detector set covering known-fault space and random-detector set covering unknown-fault space. Secondly, taking all known states including normal state as self set in training period, get the random-detector set through negative selection and distribution optimization. Lastly, in order to avoid ‘Fail to Alarm’ event caused by the Hole, the two-time-matching method is presented in detecting period which takes the normal state as self set. A resistance circuit fault diagnosis experiment shows that compared with the common real-value negative selection algorithm, the modified real-value negative algorithm can effectively avoid ‘Fail to Alarm’ event, and has higher diagnostic accuracy.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130771339","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982351
Zhongjun Zhang, Shuo Xu
Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures by Chen et al.[1], in which two entities can produce two signatures that are not binding, until the keystone is released by one of the parties. Recently, Huang et al.[10] proposed a more ambiguity and stronger fairness concurrent signature scheme based on identity. However, we will show that their scheme did not satisfy the strong unforgeability properties, and was vulnerable to forgery attack. Then, we propose an improved scheme to prevent such attack.
{"title":"Cryptanalysis and improvement of a concurrent signature scheme based on identity","authors":"Zhongjun Zhang, Shuo Xu","doi":"10.1109/ICSESS.2011.5982351","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982351","url":null,"abstract":"Concurrent signatures were introduced as an alternative approach to solving the problem of fair exchange of signatures by Chen et al.[1], in which two entities can produce two signatures that are not binding, until the keystone is released by one of the parties. Recently, Huang et al.[10] proposed a more ambiguity and stronger fairness concurrent signature scheme based on identity. However, we will show that their scheme did not satisfy the strong unforgeability properties, and was vulnerable to forgery attack. Then, we propose an improved scheme to prevent such attack.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132992400","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982326
Mao Yajing, Fang Deying
IT outsourcing as a strategic decision has become an effective way that more and more enterprises reduce costs and create their own core competencies with outside help. Distance-based IT service outsourcing cooperation model, risks of IT outsourcing is produced by the inherent reasons of “distance”. Based on the perspective of distance, this paper discussed the impact of the information distance factors, space distance factors and the knowledge distance factors on the IT outsourcing, and established the “information - space - knowledge” model of three-dimensional distance factors. Finally, through the study of some case, this paper specified the basic ideas and methods of the analysis of IT outsourcing risk based on this three-dimensional model.
{"title":"Risk factors analysis of IT outsourcing from the distance-based perspective","authors":"Mao Yajing, Fang Deying","doi":"10.1109/ICSESS.2011.5982326","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982326","url":null,"abstract":"IT outsourcing as a strategic decision has become an effective way that more and more enterprises reduce costs and create their own core competencies with outside help. Distance-based IT service outsourcing cooperation model, risks of IT outsourcing is produced by the inherent reasons of “distance”. Based on the perspective of distance, this paper discussed the impact of the information distance factors, space distance factors and the knowledge distance factors on the IT outsourcing, and established the “information - space - knowledge” model of three-dimensional distance factors. Finally, through the study of some case, this paper specified the basic ideas and methods of the analysis of IT outsourcing risk based on this three-dimensional model.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130290137","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982285
Ying-chun Li, Jun-Hong Wang, Xingjian Fu
In oil pipeline, when a theft alarm signal is generated, the strong vibration signal will be brought in stress wave. Then singularity will be introduced, which contains rich information about oil theft signal. When the detecting distance increases to a certain extent, the singularity is drowned in noise. At the same time, oil theft signal distributes mainly in low frequency band. Firstly, the system to collect stress wave signal of oil theft was briefly introduced, and on-the-spot data collection steps were given. Secondly, oil theft signal is analyzed in wavelet domain and time domain. In wavelet domain, features of energy distribution in different bands are extracted. In time domain, the stress wave signal is denoised by hard threshold method, and then the characteristics of the singularity are abstracted. The research provides a new method to monitor oil stolen events in real-time. And it is easily realized on hardware and has very good practical value.
{"title":"Application of lifting wavelet transform in oil theft signal detection","authors":"Ying-chun Li, Jun-Hong Wang, Xingjian Fu","doi":"10.1109/ICSESS.2011.5982285","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982285","url":null,"abstract":"In oil pipeline, when a theft alarm signal is generated, the strong vibration signal will be brought in stress wave. Then singularity will be introduced, which contains rich information about oil theft signal. When the detecting distance increases to a certain extent, the singularity is drowned in noise. At the same time, oil theft signal distributes mainly in low frequency band. Firstly, the system to collect stress wave signal of oil theft was briefly introduced, and on-the-spot data collection steps were given. Secondly, oil theft signal is analyzed in wavelet domain and time domain. In wavelet domain, features of energy distribution in different bands are extracted. In time domain, the stress wave signal is denoised by hard threshold method, and then the characteristics of the singularity are abstracted. The research provides a new method to monitor oil stolen events in real-time. And it is easily realized on hardware and has very good practical value.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128810322","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982228
Huaxin Mu, Shuai Jiang
Design pattern describes a repeatedly presenting issue during software designing, as well the solution to it. Applying design pattern enables developers to reuse it to solve a specified designing issue. Design patterns help designers communicate architectural knowledge, help people learn a new design paradigm, and help new developers avoid traps and pitfalls that have traditionally been learned only by costly experiences. In this paper, we briefly introduce the concept of software design pattern and give a research on some design patterns, including Observer Pattern, Decorator Pattern, Factory Method Pattern and Abstract Factory Pattern.
{"title":"Design patterns in software development","authors":"Huaxin Mu, Shuai Jiang","doi":"10.1109/ICSESS.2011.5982228","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982228","url":null,"abstract":"Design pattern describes a repeatedly presenting issue during software designing, as well the solution to it. Applying design pattern enables developers to reuse it to solve a specified designing issue. Design patterns help designers communicate architectural knowledge, help people learn a new design paradigm, and help new developers avoid traps and pitfalls that have traditionally been learned only by costly experiences. In this paper, we briefly introduce the concept of software design pattern and give a research on some design patterns, including Observer Pattern, Decorator Pattern, Factory Method Pattern and Abstract Factory Pattern.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125590075","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982313
Jingyu Han, Xiong Fu, Linfeng Liu, Dawei Jiang
Given a typical real-world application, a large number of tracking points come at a high rate in a stream fashion and efficient online map matching is a pressing concern. In this paper, two map matching schemes are proposed, which make aggressive use of available main memory to achieve efficient matching. First, road network is partitioned into approximate segments, namely line or arc segments, by minimum description length (MDL) principle. Second, approximate segments are indexed into an optimized packed R tree, insuring that the minimal coverage and overlap are achieved. Based on this, we propose two online map matching schemes, namely Top Matching (TM) and kNN Refinement Matching (KRM), coupled with corresponding buffering strategies. Theory and experiment show that the times of accessing roads is significantly reduced to approximately a fraction of 3 to 6, demonstrating superior performance in terms of running time and matching quality.
{"title":"Online map matching by indexing approximate road segments","authors":"Jingyu Han, Xiong Fu, Linfeng Liu, Dawei Jiang","doi":"10.1109/ICSESS.2011.5982313","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982313","url":null,"abstract":"Given a typical real-world application, a large number of tracking points come at a high rate in a stream fashion and efficient online map matching is a pressing concern. In this paper, two map matching schemes are proposed, which make aggressive use of available main memory to achieve efficient matching. First, road network is partitioned into approximate segments, namely line or arc segments, by minimum description length (MDL) principle. Second, approximate segments are indexed into an optimized packed R tree, insuring that the minimal coverage and overlap are achieved. Based on this, we propose two online map matching schemes, namely Top Matching (TM) and kNN Refinement Matching (KRM), coupled with corresponding buffering strategies. Theory and experiment show that the times of accessing roads is significantly reduced to approximately a fraction of 3 to 6, demonstrating superior performance in terms of running time and matching quality.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123389980","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 : 2011-07-15DOI: 10.1109/ICSESS.2011.5982377
Zhenling Zhang, Yangli Jia, G. Liu
Based on the discussion of the limitation of object-oriented software development method in dealing with the crosscutting concerns in safety-critical complex system, the aspect-oriented software development method and its' superiority are introduced. A process model of AOSD is given. The application of AOSD in the development of a safety-critical system is discussed and an example is given.
{"title":"AOSD and its application in development of safety-critical systems","authors":"Zhenling Zhang, Yangli Jia, G. Liu","doi":"10.1109/ICSESS.2011.5982377","DOIUrl":"https://doi.org/10.1109/ICSESS.2011.5982377","url":null,"abstract":"Based on the discussion of the limitation of object-oriented software development method in dealing with the crosscutting concerns in safety-critical complex system, the aspect-oriented software development method and its' superiority are introduced. A process model of AOSD is given. The application of AOSD in the development of a safety-critical system is discussed and an example is given.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116121551","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
扫码关注我们
求助内容：
应助结果提醒方式：