During the past several years, there has been a significant amount of research conducted simultaneous multiple resources scheduling problem (SMRSP) Intelligence manufacturing based on meta-heuristics, such as genetic algorithms (GAs), simulated annealing (SA) particle swarm optimization(PSO), has become a common tool to find satisfactory solutions within reasonable computational times in real settings. However, there are few researches considering interdependent relation during the decision activities, moreover for complex and large problems, local constraints and objectives from each managerial entity cannot be effectively represented in a single model for complex and large problems. In this paper, we propose a novel cooperative Bayesian optimization algorithm (COBOA) undertaking divide-and-conquer strategy and co-evolutionary framework. Considerable experiments are conducted and the results confirmed that COBOA outperforms recent researches for the scheduling problem in FMS.
{"title":"Cooperative Bayesian Optimization Algorithm: A Novel Approach to Simultaneous Multiple Resources Scheduling Problem","authors":"X. Hao, Xili Chen, H. Lin, T. Murata","doi":"10.1109/IBICA.2011.57","DOIUrl":"https://doi.org/10.1109/IBICA.2011.57","url":null,"abstract":"During the past several years, there has been a significant amount of research conducted simultaneous multiple resources scheduling problem (SMRSP) Intelligence manufacturing based on meta-heuristics, such as genetic algorithms (GAs), simulated annealing (SA) particle swarm optimization(PSO), has become a common tool to find satisfactory solutions within reasonable computational times in real settings. However, there are few researches considering interdependent relation during the decision activities, moreover for complex and large problems, local constraints and objectives from each managerial entity cannot be effectively represented in a single model for complex and large problems. In this paper, we propose a novel cooperative Bayesian optimization algorithm (COBOA) undertaking divide-and-conquer strategy and co-evolutionary framework. Considerable experiments are conducted and the results confirmed that COBOA outperforms recent researches for the scheduling problem in FMS.","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":"124208991","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}
Most existing subspace analysis methods for image recognition estimate the sample scatter matrices directly based on the training images. However, such methods do not consider the different contributions of different image components to image representation and recognition. Considering that the dominant component will contribute much more than the residual component to image pattern classification, we present a novel discriminate criterion which maximizes the total scatter of dominant components and minimizes simultaneously the total scatter of residual components. This criterion gives rise to a new subspace analysis method, namely the subspace analysis via low rank decomposition (SAL). Further, a supervised version of SAL (SSAL) is presented. The experimental results on benchmark image databases validated that SAL and SSAL outperform those representative subspace analysis methods such as PCA, LDA, LLP and SPP.
{"title":"A Linear Subspace Learning Approach via Low Rank Decomposition","authors":"Fanlong Zhang, Jian Yang","doi":"10.1109/IBICA.2011.25","DOIUrl":"https://doi.org/10.1109/IBICA.2011.25","url":null,"abstract":"Most existing subspace analysis methods for image recognition estimate the sample scatter matrices directly based on the training images. However, such methods do not consider the different contributions of different image components to image representation and recognition. Considering that the dominant component will contribute much more than the residual component to image pattern classification, we present a novel discriminate criterion which maximizes the total scatter of dominant components and minimizes simultaneously the total scatter of residual components. This criterion gives rise to a new subspace analysis method, namely the subspace analysis via low rank decomposition (SAL). Further, a supervised version of SAL (SSAL) is presented. The experimental results on benchmark image databases validated that SAL and SSAL outperform those representative subspace analysis methods such as PCA, LDA, LLP and SPP.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"113 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":"115014509","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}
The main work of Power Group Enterprises' IT services and operation includes services application, troubleshooting and work order processing. This paper proposes a set of workflows and portal architecture of services application, troubleshooting and fault classification, which has a very large of reference value for the IT services industry.
{"title":"A Portal Architecture Based on IT Services","authors":"Tingting Sun, Futong Huang","doi":"10.1109/IBICA.2011.74","DOIUrl":"https://doi.org/10.1109/IBICA.2011.74","url":null,"abstract":"The main work of Power Group Enterprises' IT services and operation includes services application, troubleshooting and work order processing. This paper proposes a set of workflows and portal architecture of services application, troubleshooting and fault classification, which has a very large of reference value for the IT services industry.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"399 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":"123465775","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}
Yuan-Ching Kuo, M. Sheu, S. Siao, Cheng Huang, Tzu-Hsuing Chen
An efficient design of the reverse converter forthe three-moduli set {2n, 2n+1-1, 2n-1} is presented in thispaper. The reverse converter is structured by an adderbased on New Chinese Remainder Theorem II (NewCRT-II) conversion such that it can improve thehardware cost. The proposed conversion design iscompared with the existing works based on the standardCell TSMC 0.18µm CMOS technology. Under the samedynamic range(DR), the experimental results indicatethat our design has better performance in terms of thearea× delay × power. The proposed converter canachieve about average 46.596 % and 61.890 % reductionfor those design with 4n-bit and 5n-bit dynamic range,respectively.
{"title":"New Reverse Converter Design of Moduli Set {2n, 2n+1-1, 2n-1}","authors":"Yuan-Ching Kuo, M. Sheu, S. Siao, Cheng Huang, Tzu-Hsuing Chen","doi":"10.1109/IBICA.2011.66","DOIUrl":"https://doi.org/10.1109/IBICA.2011.66","url":null,"abstract":"An efficient design of the reverse converter forthe three-moduli set {2n, 2n+1-1, 2n-1} is presented in thispaper. The reverse converter is structured by an adderbased on New Chinese Remainder Theorem II (NewCRT-II) conversion such that it can improve thehardware cost. The proposed conversion design iscompared with the existing works based on the standardCell TSMC 0.18µm CMOS technology. Under the samedynamic range(DR), the experimental results indicatethat our design has better performance in terms of thearea× delay × power. The proposed converter canachieve about average 46.596 % and 61.890 % reductionfor those design with 4n-bit and 5n-bit dynamic range,respectively.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"37 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":"117124650","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}
Due to extensive research of non-linear science theory (the chaos) in the image encryption, we find especially that the properties of chaos make itself particularly suitable for image encryption. On the basis of many excellent features of chaotic sequence, combining application of chaotic theory in cryptography, the paper puts forward image encryption based on chaotic binary sequence. On Logistic digital chaotic system platform, the paper gives the realization mechanism of image encryption based on digital chaotic binary Logistic sequence. Meanwhile, the paper also conducts histogram analysis, key sensitivity analysis and damage resistance analysis for the encrypted image. Simulation results show that this method can better resist damage and is very sensitive for secret key.
{"title":"Realization of Image Encryption Scheme Based on Chaotic Binary Sequence","authors":"Xiaoli Geng, Quan Ding","doi":"10.1109/IBICA.2011.45","DOIUrl":"https://doi.org/10.1109/IBICA.2011.45","url":null,"abstract":"Due to extensive research of non-linear science theory (the chaos) in the image encryption, we find especially that the properties of chaos make itself particularly suitable for image encryption. On the basis of many excellent features of chaotic sequence, combining application of chaotic theory in cryptography, the paper puts forward image encryption based on chaotic binary sequence. On Logistic digital chaotic system platform, the paper gives the realization mechanism of image encryption based on digital chaotic binary Logistic sequence. Meanwhile, the paper also conducts histogram analysis, key sensitivity analysis and damage resistance analysis for the encrypted image. Simulation results show that this method can better resist damage and is very sensitive for secret key.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"68 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":"125531365","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}
Improving visibility on medical images is crucially important for facilitating diagnostic accuracy. We propose a method which aims at improving visibility on medical images by means of detail enhancement. The core techniques we employ to achieve detail enhancement are coefficient estimation and coefficient refinement, and all are manipulated in wavelet domain. Our method enables visually hidden information to be revealed and blurred texture to be restored without significantly altering averaged optical density and dynamic range of medical images. Moreover, the proposed method enables the level for detail enhancement to be scalably selectable, through which an optimally enhanced image can be obtained for viewer¡¦s reference.
{"title":"Visibility Improvement by Detail Eenhancement on Medical Images","authors":"Wen-Li Lee, Mei-Juan Chen","doi":"10.1109/IBICA.2011.10","DOIUrl":"https://doi.org/10.1109/IBICA.2011.10","url":null,"abstract":"Improving visibility on medical images is crucially important for facilitating diagnostic accuracy. We propose a method which aims at improving visibility on medical images by means of detail enhancement. The core techniques we employ to achieve detail enhancement are coefficient estimation and coefficient refinement, and all are manipulated in wavelet domain. Our method enables visually hidden information to be revealed and blurred texture to be restored without significantly altering averaged optical density and dynamic range of medical images. Moreover, the proposed method enables the level for detail enhancement to be scalably selectable, through which an optimally enhanced image can be obtained for viewer¡¦s reference.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"14 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":"125585006","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}
This paper first makes an analysis about the current status of the computing platforms of nuclear fuel and their defects, then we propose to introduce XML database in current platforms in order to overcome those problems in indexing of file system data, cross-platform data communication, and hazard in data saving. Finally, we design a novel database architecture based on existing relational database using XML technology.
{"title":"An Application of the Database Technology Based on XML Used for Nuclear Fuel Calculation Platform","authors":"Ying Peng, Guodong Jiao","doi":"10.1109/IBICA.2011.76","DOIUrl":"https://doi.org/10.1109/IBICA.2011.76","url":null,"abstract":"This paper first makes an analysis about the current status of the computing platforms of nuclear fuel and their defects, then we propose to introduce XML database in current platforms in order to overcome those problems in indexing of file system data, cross-platform data communication, and hazard in data saving. Finally, we design a novel database architecture based on existing relational database using XML technology.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"87 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":"126326169","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}
Image retrieval is a hot and hard technology in the field of computing science. In this paper, a method named r/KPSO (Particle Swarm Optimization with r- and K-selection) is applied in relevance feedback (RF) of image retrieval. The main idea of r/KPSO is inspired by the r- and K-selection of Ecology. r-selection can be characterized as: quantitative, little parent care, large growth rate and rapid development and K-selection as: qualitative, much parent care, small growth rate and slow development. Based on r/KPSO, we define the positive and negative feedback samples as study principle, and optimize weightings according to user's retrieval requirement. Experiments show that both the recall and precision are improved effectively.
图像检索是计算机科学领域的一个热点和难点技术。本文将r/KPSO (Particle Swarm Optimization with r- and K-selection)方法应用于图像检索的相关反馈。r/KPSO的主要思想受到生态学r-和k -选择的启发。r-选择表现为数量多、亲本照顾少、生长率大、发育快;k -选择表现为质量多、亲本照顾多、生长率小、发育慢。在r/KPSO的基础上，定义正负反馈样本作为研究原则，并根据用户的检索需求优化权重。实验表明，该方法有效地提高了查全率和查准率。
{"title":"An Image Retrieval Method Based on r/KPSO","authors":"Xu Zhang, B. Guo, Guiyue Zhang, Yunyi Yan","doi":"10.1109/IBICA.2011.22","DOIUrl":"https://doi.org/10.1109/IBICA.2011.22","url":null,"abstract":"Image retrieval is a hot and hard technology in the field of computing science. In this paper, a method named r/KPSO (Particle Swarm Optimization with r- and K-selection) is applied in relevance feedback (RF) of image retrieval. The main idea of r/KPSO is inspired by the r- and K-selection of Ecology. r-selection can be characterized as: quantitative, little parent care, large growth rate and rapid development and K-selection as: qualitative, much parent care, small growth rate and slow development. Based on r/KPSO, we define the positive and negative feedback samples as study principle, and optimize weightings according to user's retrieval requirement. Experiments show that both the recall and precision are improved effectively.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"39 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":"116866271","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}
Previous literature has suggested that psychological state may be changed via drinking coke, however, studies empirically documenting the link between coke and blood pressure wave (BPW) are scant. Therefore, the current article attempts to explore how coke intervene the mental condition with the assessment of pulse signal recordings. The quantitative analysis of the data was conducted through SAS, EXCEL and MATLAB package software in order to find a specific pattern of pulse spectrum. Results of this study showed the high frequency of heart rate variability increased from 34.83 to 43.83, and that of beat-to-beat pulse variability was enhanced from 7.67 to 35.5. The value of beat-to beat pulse variability in time-domain also went up. The relationship between sd1 and sd2 of RRI and HRV are positively correlated.
{"title":"What's Happening to Our Body after Drinking Coke? The Characteristic of the Blood Pressure Wave in Radial Artery","authors":"Sheng-Chieh Huang, Yung-Pin Lee, Min-Hua Hsieh, Hui-Min Wang, M. C. Hou, Shih-Chun Chao, Cheng-Lung Tseng, Wei-Ta Hsiao, Chung-Hung Hong, Kai-Yu Shao, Shi-Han Luo, Wei-Chun Chiu, Wei-Yu Chen","doi":"10.1109/IBICA.2011.15","DOIUrl":"https://doi.org/10.1109/IBICA.2011.15","url":null,"abstract":"Previous literature has suggested that psychological state may be changed via drinking coke, however, studies empirically documenting the link between coke and blood pressure wave (BPW) are scant. Therefore, the current article attempts to explore how coke intervene the mental condition with the assessment of pulse signal recordings. The quantitative analysis of the data was conducted through SAS, EXCEL and MATLAB package software in order to find a specific pattern of pulse spectrum. Results of this study showed the high frequency of heart rate variability increased from 34.83 to 43.83, and that of beat-to-beat pulse variability was enhanced from 7.67 to 35.5. The value of beat-to beat pulse variability in time-domain also went up. The relationship between sd1 and sd2 of RRI and HRV are positively correlated.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"212 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":"123074092","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}
As a significant biometric technique, 3D palm print authentication is better than 2D palm print authentication in several aspects. Previous work on 3D palm print recognition has concentrated on two aspects: (1) extracting the texture and line features using the binary image of 3D palm print, (2) extracting the orientation features using the Gabor filter and competitive code. In this paper we extract, for the first time, the 3D palm print features using the appearance-based linear discriminant analysis (LDA) method. The appearance-based LDA method can extract the global algebraic features of the biometrics. These features have been proven to have strong discriminability. We also investigated the relationship between the recognition accuracy and the resolution of the 3D palm print image. The experimental results show that the 3D palm print images with resolution and are better for 3D palm print recognition. The experiment results also show the feasibility of our method.
{"title":"Three Dimensional Palmprint Recognition Using Linear Discriminant Analysis Method","authors":"Jinrong Cui, Yong Xu","doi":"10.1109/IBICA.2011.31","DOIUrl":"https://doi.org/10.1109/IBICA.2011.31","url":null,"abstract":"As a significant biometric technique, 3D palm print authentication is better than 2D palm print authentication in several aspects. Previous work on 3D palm print recognition has concentrated on two aspects: (1) extracting the texture and line features using the binary image of 3D palm print, (2) extracting the orientation features using the Gabor filter and competitive code. In this paper we extract, for the first time, the 3D palm print features using the appearance-based linear discriminant analysis (LDA) method. The appearance-based LDA method can extract the global algebraic features of the biometrics. These features have been proven to have strong discriminability. We also investigated the relationship between the recognition accuracy and the resolution of the 3D palm print image. The experimental results show that the 3D palm print images with resolution and are better for 3D palm print recognition. The experiment results also show the feasibility of our method.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"29 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":"124852662","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
扫码关注我们
求助内容：
应助结果提醒方式：