Liquefied-pressure gases (LPG) are transportedand stored in the liquid phase in close tanks undersufficiently high pressure. In the case of an accident, anabrupt tank unsealing may release enormous quantity ofevaporating gas and energy that has a destructive effect onthe tank and its surroundings. In this paper, the mechanism,conditions, characteristics and damage involved in BLEVEaccident happening in LPG tank locations are analyzed,suggesting a mathematical model and solution to simulatethe situation and estimate the severity and damaging scope.
{"title":"HAZARDS and Prevention of BLEVE","authors":"Tan Xian, Li Fang","doi":"10.1109/IBICA.2011.68","DOIUrl":"https://doi.org/10.1109/IBICA.2011.68","url":null,"abstract":"Liquefied-pressure gases (LPG) are transportedand stored in the liquid phase in close tanks undersufficiently high pressure. In the case of an accident, anabrupt tank unsealing may release enormous quantity ofevaporating gas and energy that has a destructive effect onthe tank and its surroundings. In this paper, the mechanism,conditions, characteristics and damage involved in BLEVEaccident happening in LPG tank locations are analyzed,suggesting a mathematical model and solution to simulatethe situation and estimate the severity and damaging scope.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128210594","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}
Job-shop Scheduling Problem (JSP) is a well-known combinatorial optimization problem. In past decades, many meta-heuristic algorithms have been used to solve it. Shuffled Frog-Leaping Algorithm (SFLA) is a novel nature-inspired meta-heuristic algorithm. However, to the best of our knowledge, so far there have been few papers studying on the solutions to JSP using SFLA. In this study, we develop an improved SFLA for JSP. In order to extend SFLA to deal with JSP efficiently, the random keys encoding scheme is introduced to the proposed SFLA. The results of experiments carried out with 14 well-known benchmark JSP instances have shown that the improved SFLA possesses outstanding performance in terms of convergence and stability, as compared to some existing meta-heuristic algorithms, such as GA and IPSO. Thus, the presented SFLA in this work is very effective and superior to solve JSP.
{"title":"An Improved Shuffled Frog-Leaping Algorithm for Job-Shop Scheduling Problem","authors":"Min-Rong Chen, Xia Li, Namin Wang, Hai-Bo Xiao","doi":"10.1109/IBICA.2011.55","DOIUrl":"https://doi.org/10.1109/IBICA.2011.55","url":null,"abstract":"Job-shop Scheduling Problem (JSP) is a well-known combinatorial optimization problem. In past decades, many meta-heuristic algorithms have been used to solve it. Shuffled Frog-Leaping Algorithm (SFLA) is a novel nature-inspired meta-heuristic algorithm. However, to the best of our knowledge, so far there have been few papers studying on the solutions to JSP using SFLA. In this study, we develop an improved SFLA for JSP. In order to extend SFLA to deal with JSP efficiently, the random keys encoding scheme is introduced to the proposed SFLA. The results of experiments carried out with 14 well-known benchmark JSP instances have shown that the improved SFLA possesses outstanding performance in terms of convergence and stability, as compared to some existing meta-heuristic algorithms, such as GA and IPSO. Thus, the presented SFLA in this work is very effective and superior to solve JSP.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115806412","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}
with the rapid development of international strategy of nuclear power enterprises in China, the IT department in nuclear power enterprises has been facing the new challenges with high-speed development of businesses. In order to satisfy the development requirements and provide powerful IT service during the production and operation, IT department had brought ITIL idea and combined the practical condition to establish one set of IT service management platform with perfect function. At present, this platform has been widely applied in many basements of nuclear power enterprises and obtained significant effect.
{"title":"Application of IT Service Management Platform in Nuclear Power Enterprises Based on ITIL","authors":"Huihui Yao, Tingting Sun","doi":"10.1109/IBICA.2011.41","DOIUrl":"https://doi.org/10.1109/IBICA.2011.41","url":null,"abstract":"with the rapid development of international strategy of nuclear power enterprises in China, the IT department in nuclear power enterprises has been facing the new challenges with high-speed development of businesses. In order to satisfy the development requirements and provide powerful IT service during the production and operation, IT department had brought ITIL idea and combined the practical condition to establish one set of IT service management platform with perfect function. At present, this platform has been widely applied in many basements of nuclear power enterprises and obtained significant effect.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367719","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 novel Internet media distribution system based on overlay multicast was studied and implemented. In the system, the nodes build the multicast route with a tree-first strategy and maintain the topology with an active strategy. In order to run the routing and topology algorithm effectively, a series of messages and protocols are designed as the core in the system. The implementation of the multicast system is object-oriented and modular. The experiments on Planet Lab in which the end hosts are all over the world have shown that, the system can construct and maintain the overlay multicast tree efficiently, and can also distribute the real-time streaming audio with high scalability.
{"title":"HOMS: An Internet Media Distribution System Based on Overlay Multicast","authors":"Shanlun Jin, Wei-Xiong Chen","doi":"10.1109/IBICA.2011.37","DOIUrl":"https://doi.org/10.1109/IBICA.2011.37","url":null,"abstract":"A novel Internet media distribution system based on overlay multicast was studied and implemented. In the system, the nodes build the multicast route with a tree-first strategy and maintain the topology with an active strategy. In order to run the routing and topology algorithm effectively, a series of messages and protocols are designed as the core in the system. The implementation of the multicast system is object-oriented and modular. The experiments on Planet Lab in which the end hosts are all over the world have shown that, the system can construct and maintain the overlay multicast tree efficiently, and can also distribute the real-time streaming audio with high scalability.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130984763","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}
Google's Android Native Development Kit (NDK) is a toolset that lets you embed components to use of native code in your Android applications. It makes possible for developers to easily compile in C/C++ for the Android development platform. Generally, developer does not concern how effective between native code and Dalvik Java code that will causes poor performance of Android. There are some researches discussed about benchmark Java and C/C++. But they do not consider the issues of Dalvik and native code for Android programming or evaluate them in real Android device. In this work, we use a more complete approach to benchmark Dalvik java code and Native code on real Android device. We conducted 12 test programs to analyze the performance and found that native code faster than Dalvik Java code for about 34.2%.
b谷歌的Android Native Development Kit (NDK)是一个工具集，可以让你在Android应用程序中嵌入组件以使用本地代码。它使开发人员可以轻松地在Android开发平台上用C/ c++进行编译。一般来说，开发者并不关心原生代码和Dalvik Java代码之间的效率如何，这会导致Android的性能不佳。对Java和C/ c++的基准测试进行了一些研究。但他们没有考虑Dalvik和Android编程的本地代码问题，也没有在真实的Android设备中进行评估。在这项工作中，我们使用更完整的方法在真实的Android设备上对Dalvik java代码和Native代码进行基准测试。我们进行了12个测试程序来分析性能，发现本机代码比Dalvik Java代码快34.2%左右。
{"title":"Benchmark Dalvik and Native Code for Android System","authors":"Cheng-Min Lin, J. Lin, C. Dow, Chang-Ming Wen","doi":"10.1109/IBICA.2011.85","DOIUrl":"https://doi.org/10.1109/IBICA.2011.85","url":null,"abstract":"Google's Android Native Development Kit (NDK) is a toolset that lets you embed components to use of native code in your Android applications. It makes possible for developers to easily compile in C/C++ for the Android development platform. Generally, developer does not concern how effective between native code and Dalvik Java code that will causes poor performance of Android. There are some researches discussed about benchmark Java and C/C++. But they do not consider the issues of Dalvik and native code for Android programming or evaluate them in real Android device. In this work, we use a more complete approach to benchmark Dalvik java code and Native code on real Android device. We conducted 12 test programs to analyze the performance and found that native code faster than Dalvik Java code for about 34.2%.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131168322","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}
Chin-Ling Chen, Teng-Tai Chou, Y. Lai, Chih-Cheng Chen
The design of an escrow will system would signify the beginning of a pre-built living will,open possibilities of escrowing a will to a courtroom via Internet.A prefect escrow will system considers the inherent security issues.Based on RSA probabilistic signature shceme under the RSA assumption in the random oracle model,our suggested scheme utilizes convenient Internet cryptology technologies to resolve any security problems.The proposed Internet will system is demonstrated securely,conforms to legal specifications and takes care to protect users' privacy. It not only can withstand various attacks and increases usage efficiency,but also prevents feuding among beneficiaries.
{"title":"A Private Escrow Protocol for Internet Will System Design","authors":"Chin-Ling Chen, Teng-Tai Chou, Y. Lai, Chih-Cheng Chen","doi":"10.1109/IBICA.2011.95","DOIUrl":"https://doi.org/10.1109/IBICA.2011.95","url":null,"abstract":"The design of an escrow will system would signify the beginning of a pre-built living will,open possibilities of escrowing a will to a courtroom via Internet.A prefect escrow will system considers the inherent security issues.Based on RSA probabilistic signature shceme under the RSA assumption in the random oracle model,our suggested scheme utilizes convenient Internet cryptology technologies to resolve any security problems.The proposed Internet will system is demonstrated securely,conforms to legal specifications and takes care to protect users' privacy. It not only can withstand various attacks and increases usage efficiency,but also prevents feuding among beneficiaries.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124964467","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}
Sparse arrays are popular in sonar, ultrasonic imaging and other acoustic equipment. For inter-element spacing larger than one wave length, there will be grate lobes for ordinary sparse array. Using genetic algorithm to optimize array with randomly spaced elements to suppress the grate lobes is introduced in this paper. Fitness function design and variable choosing method for genetic algorithms application in this kind of objects are presented. A single object fitness function instead of multi objects fitness function usually used for array design is proposed.
{"title":"Grate Lobes / Side Lobes Suppression for Sparse Array Design by Using Genetic Algorithms","authors":"Songwen Li","doi":"10.1109/IBICA.2011.97","DOIUrl":"https://doi.org/10.1109/IBICA.2011.97","url":null,"abstract":"Sparse arrays are popular in sonar, ultrasonic imaging and other acoustic equipment. For inter-element spacing larger than one wave length, there will be grate lobes for ordinary sparse array. Using genetic algorithm to optimize array with randomly spaced elements to suppress the grate lobes is introduced in this paper. Fitness function design and variable choosing method for genetic algorithms application in this kind of objects are presented. A single object fitness function instead of multi objects fitness function usually used for array design is proposed.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116445473","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 novel cosmetic chip is proposed to meet the need of the cosmetology market and the progress of the medical industry. To measure the quality of deep skin, we have to try some non-traditional way, the vascular under our skin is a complicated microcirculation system. The results of experiment verify that the cosmetic chip is able to detect the condition of deep skin.
{"title":"Camera-Based Cosmetic Platform to Measure Microcirculation and Skin Condition of Faces","authors":"Kai-Yu Shao, Shi-Han Luo, Wei-Chun Chiu, Sheng-Chieh Huang, Yung-Pin Lee, Hui-Min Wang, M. C. Hou, Shih-Chun Chao, Cheng-Lung Tseng, Wei-Ta Hsiao, Chung-Hung Hong, Wei-Yu Chen","doi":"10.1109/IBICA.2011.16","DOIUrl":"https://doi.org/10.1109/IBICA.2011.16","url":null,"abstract":"A novel cosmetic chip is proposed to meet the need of the cosmetology market and the progress of the medical industry. To measure the quality of deep skin, we have to try some non-traditional way, the vascular under our skin is a complicated microcirculation system. The results of experiment verify that the cosmetic chip is able to detect the condition of deep skin.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114511605","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}
Chun-Wei Lin, T. Hong, Hong-Yu Lee, Shyue-Liang Wang
In the past, pre-large fast-updated sequential pattern trees (pre-large FUSP tree) were proposed for efficiently mining large sequences for record insertion and deletion, respectively. In this paper, we thus proposed a maintenance approach for efficiently maintaining pre-large FUSP trees and effectively deriving desired large sequences when data in databases are modified. Experimental results also show that the proposed algorithm has a better performance in execution time.
{"title":"Maintenance of Pre-large FUSP Trees in Dynamic Databases","authors":"Chun-Wei Lin, T. Hong, Hong-Yu Lee, Shyue-Liang Wang","doi":"10.1109/IBICA.2011.54","DOIUrl":"https://doi.org/10.1109/IBICA.2011.54","url":null,"abstract":"In the past, pre-large fast-updated sequential pattern trees (pre-large FUSP tree) were proposed for efficiently mining large sequences for record insertion and deletion, respectively. In this paper, we thus proposed a maintenance approach for efficiently maintaining pre-large FUSP trees and effectively deriving desired large sequences when data in databases are modified. Experimental results also show that the proposed algorithm has a better performance in execution time.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114706415","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}
Chen-Shuo Fan, Zong-Hong Li, Hsueh-Yi Lin, T. Tsai
Among bit plane coding field, coding of significance layer is an important topic. According to the advantage of quad-tree representation on codeword reduction for large zero blocks, zero block coding is a potential method in significance coding. However, traditional embedded zero block coding method exhibits repeated node visits in recursive procedure calling. In this paper, a top-to-button significance coding methodology is proposed to reduce the repeated node visiting. On the other hand, the produced coefficients are reduced at the same time. According to the experiment results, the visited node count and transmitted codeword of proposed work is smaller than original embedded zero block coding and the significance layer in Wavelet transformed coefficients of JPEG 2000. Besides, the reduction of node visiting count increases the significant bit updating efficiency. The results prove the efficiency and the effectiveness of codeword reduction of proposed work.
{"title":"A Fast and Effective Algorithm for Significance Coding Using Zero Block Coding Technology","authors":"Chen-Shuo Fan, Zong-Hong Li, Hsueh-Yi Lin, T. Tsai","doi":"10.1109/IBICA.2011.13","DOIUrl":"https://doi.org/10.1109/IBICA.2011.13","url":null,"abstract":"Among bit plane coding field, coding of significance layer is an important topic. According to the advantage of quad-tree representation on codeword reduction for large zero blocks, zero block coding is a potential method in significance coding. However, traditional embedded zero block coding method exhibits repeated node visits in recursive procedure calling. In this paper, a top-to-button significance coding methodology is proposed to reduce the repeated node visiting. On the other hand, the produced coefficients are reduced at the same time. According to the experiment results, the visited node count and transmitted codeword of proposed work is smaller than original embedded zero block coding and the significance layer in Wavelet transformed coefficients of JPEG 2000. Besides, the reduction of node visiting count increases the significant bit updating efficiency. The results prove the efficiency and the effectiveness of codeword reduction of proposed work.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114952335","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
扫码关注我们
求助内容：
应助结果提醒方式：