Pub Date : 2006-06-07DOI: 10.1109/ICCIS.2006.252316
S. Chandrasekaran, S. Ponnambalam, R. Suresh, N. Vijayakumar
This paper presents a method of applying particle swarm optimization (PSO) algorithm to a flow shop scheduling problem. Permutation encoding of job indices is used to represent particles. One particle of the initial swarm is generated using NEH heuristic (M. Nawaz, Jr., 1995) and the remaining particles are generated randomly. A continuous swap mechanism is used to improve the performance of the discrete particle swarm optimization (DPSO) algorithm. Performance of the proposed algorithm is evaluated using the benchmark flow shop scheduling problems given by Taillard (1993). The computational results show that the hybrid approach is more effective
{"title":"A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems","authors":"S. Chandrasekaran, S. Ponnambalam, R. Suresh, N. Vijayakumar","doi":"10.1109/ICCIS.2006.252316","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252316","url":null,"abstract":"This paper presents a method of applying particle swarm optimization (PSO) algorithm to a flow shop scheduling problem. Permutation encoding of job indices is used to represent particles. One particle of the initial swarm is generated using NEH heuristic (M. Nawaz, Jr., 1995) and the remaining particles are generated randomly. A continuous swap mechanism is used to improve the performance of the discrete particle swarm optimization (DPSO) algorithm. Performance of the proposed algorithm is evaluated using the benchmark flow shop scheduling problems given by Taillard (1993). The computational results show that the hybrid approach is more effective","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133875924","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252333
P. Gil, J. Henriques, A. Dourado, H. Duarte-Ramos
The problem of order estimation and global stability in affine three-layered state-space neural networks is here addressed. An upper bound for the number of neurons to be inserted in the hidden layer is computed using a subspace technique. Some sufficient conditions for the global asymptotic stability are presented using the Lyapunov stability theory and the contraction mapping theorem
{"title":"On State-Space Neural Networks for Systems Identification: Stability and Complexity","authors":"P. Gil, J. Henriques, A. Dourado, H. Duarte-Ramos","doi":"10.1109/ICCIS.2006.252333","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252333","url":null,"abstract":"The problem of order estimation and global stability in affine three-layered state-space neural networks is here addressed. An upper bound for the number of neurons to be inserted in the hidden layer is computed using a subspace technique. Some sufficient conditions for the global asymptotic stability are presented using the Lyapunov stability theory and the contraction mapping theorem","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134266393","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252270
B. Phruksaphanrat, A. Ohsato, P. Yenradee
Conventionally, a revenue function, a cost function and a profit function are selected to be the objective function for aggregate production planning (APP) problems. The theory of constraints (TOC) alternative consideration argues that instead of measuring by cost, factory should evaluate their performance by throughput. Even though, there are a lot of research works on formulations of APP problems, there has been no investigation, which formulation is the most appropriate for APP problems. In this research, the investigation of the formulation of existing APP problems is done. In order to clarify the difference of each objective function, a simple case study has been used to compare the performances of the APP problem with revenue, cost, and profit objective functions when resource constraints (limited processing time) are not included and included in the model. For the profit objective function, two formulations are also compared: profit objective function by TOC and profit objective function by linear programming. From the results, it can be shown that setting the objective function of an APP problem is very important because it may lead to a wrong decision in production planning
{"title":"A Comment on the Formulation of an Aggregate Production Planning Problem","authors":"B. Phruksaphanrat, A. Ohsato, P. Yenradee","doi":"10.1109/ICCIS.2006.252270","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252270","url":null,"abstract":"Conventionally, a revenue function, a cost function and a profit function are selected to be the objective function for aggregate production planning (APP) problems. The theory of constraints (TOC) alternative consideration argues that instead of measuring by cost, factory should evaluate their performance by throughput. Even though, there are a lot of research works on formulations of APP problems, there has been no investigation, which formulation is the most appropriate for APP problems. In this research, the investigation of the formulation of existing APP problems is done. In order to clarify the difference of each objective function, a simple case study has been used to compare the performances of the APP problem with revenue, cost, and profit objective functions when resource constraints (limited processing time) are not included and included in the model. For the profit objective function, two formulations are also compared: profit objective function by TOC and profit objective function by linear programming. From the results, it can be shown that setting the objective function of an APP problem is very important because it may lead to a wrong decision in production planning","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132662914","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252261
F. Chan, S. Chung, L. Chan
In this paper, we study the influence of machine maintenance to distributed scheduling problems. Distributed scheduling is aiming to maximize the system efficiency by simultaneously solving two problems: (i) allocation of jobs to suitable factories, and (ii) determination of the corresponding production scheduling in each factory. Scheduling of machine maintenance problems aim to reduce the effect of breakdown and maximize the facility availability at minimum cost. However, in many distributed scheduling problems, machine scheduling assumes that machines are available all the time. In fact, every machine requires maintenance, and the maintenance policy directly affects the machine's availability. Consequently, it interrupts the production scheduling determined. This paper designed a hypothetical distributed scheduling model with three different problem sizes to demonstrate the significance of simultaneously solving machine maintenance problem with distributed scheduling problem. We applied genetic algorithm with dominant genes methodology to solve the model. Several optimization approaches, including separating and integrating the two problems, are tested and compared. The results show the merit of integration
{"title":"A Study of Distributed Scheduling Problem with Machine Maintenance","authors":"F. Chan, S. Chung, L. Chan","doi":"10.1109/ICCIS.2006.252261","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252261","url":null,"abstract":"In this paper, we study the influence of machine maintenance to distributed scheduling problems. Distributed scheduling is aiming to maximize the system efficiency by simultaneously solving two problems: (i) allocation of jobs to suitable factories, and (ii) determination of the corresponding production scheduling in each factory. Scheduling of machine maintenance problems aim to reduce the effect of breakdown and maximize the facility availability at minimum cost. However, in many distributed scheduling problems, machine scheduling assumes that machines are available all the time. In fact, every machine requires maintenance, and the maintenance policy directly affects the machine's availability. Consequently, it interrupts the production scheduling determined. This paper designed a hypothetical distributed scheduling model with three different problem sizes to demonstrate the significance of simultaneously solving machine maintenance problem with distributed scheduling problem. We applied genetic algorithm with dominant genes methodology to solve the model. Several optimization approaches, including separating and integrating the two problems, are tested and compared. The results show the merit of integration","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114069423","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252241
Wang Guixiang, Li Youming
In this paper, we discuss the properties of the fuzzy number function which is the Zadeh extension of usual real-valued exponential function on fuzzy number space. The continuity, monotonicity, convexity (or concavity), G-differentiability and the integral over directed line segment of the fuzzy number function are characterized with the corresponding analytical properties of the usual real-valued exponential function
{"title":"The Properties of the Zadeh Extension of Real Valued Exponential Function","authors":"Wang Guixiang, Li Youming","doi":"10.1109/ICCIS.2006.252241","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252241","url":null,"abstract":"In this paper, we discuss the properties of the fuzzy number function which is the Zadeh extension of usual real-valued exponential function on fuzzy number space. The continuity, monotonicity, convexity (or concavity), G-differentiability and the integral over directed line segment of the fuzzy number function are characterized with the corresponding analytical properties of the usual real-valued exponential function","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114552328","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252228
O-C. Granmo, B. Oommen, S. A. Myrer, M. G. Olsen
Previous approaches to resource allocation in Web monitoring target optimal performance under restricted capacity constraints (Pandey et al., 2003; Wolf et al., 2002). The resource allocation problem is generally modelled as a knapsack problem with known deterministic properties. However, for practical purposes the Web must often be treated as stochastic and unknown. Unfortunately, estimating unknown knapsack properties (e.g., based on an estimation phase (Pandey et al., 2003; Wolf et al., 2002)) delays finding an optimal or near-optimal solution. Dynamic environments aggravate this problem further when the optimal solution changes with time. In this paper, we present a novel solution for the nonlinear fractional knapsack problem with a separable and concave criterion function (Bretthauer and Shetty, 2002). To render the problem realistic, we consider the criterion function to be stochastic with an unknown distribution. At every time instant, our scheme utilizes a series of informed guesses to move, in an online manner, from a "current" solution, towards the optimal solution. At the heart of our scheme, a game of deterministic learning automata performs a controlled random walk on a discretized solution space. Comprehensive experimental results demonstrate that the discretization resolution determines the precision of our scheme. In order to yield a required precision, the current resource allocation solution is consistently improved, until a near-optimal solution is found. Furthermore, our proposed scheme quickly adapts to periodically switching environments. Thus, we believe that our scheme is qualitatively superior to the class of estimation-based schemes
以前的Web监控资源分配方法的目标是在有限的容量约束下实现最佳性能(Pandey et al.， 2003;Wolf et al.， 2002)。资源分配问题通常被建模为具有已知确定性性质的背包问题。然而，出于实际目的，Web必须经常被视为随机和未知的。不幸的是，估计未知的背包属性(例如，基于估计阶段(Pandey et al.， 2003;Wolf et al.， 2002))延迟寻找最优或接近最优解。当最优解随时间变化时，动态环境进一步加剧了这一问题。在本文中，我们提出了一个新的解非线性分数阶背包问题具有可分离和凹准则函数(Bretthauer和Shetty, 2002)。为了使问题更现实，我们认为准则函数是随机的，具有未知的分布。在每一个瞬间，我们的方案利用一系列知情的猜测，以在线的方式，从“当前”的解决方案移动到最优的解决方案。在我们方案的核心，一个确定性学习自动机的游戏在一个离散的解空间上执行一个受控的随机漫步。综合实验结果表明，离散化分辨率决定了方案的精度。为了获得所需的精度，不断改进当前的资源分配解决方案，直到找到接近最优的解决方案。此外，我们提出的方案能够快速适应周期性切换的环境。因此，我们认为我们的方案在质量上优于基于估计的方案
{"title":"Determining Optimal Polling Frequency Using a Learning Automata-based Solution to the Fractional Knapsack Problem","authors":"O-C. Granmo, B. Oommen, S. A. Myrer, M. G. Olsen","doi":"10.1109/ICCIS.2006.252228","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252228","url":null,"abstract":"Previous approaches to resource allocation in Web monitoring target optimal performance under restricted capacity constraints (Pandey et al., 2003; Wolf et al., 2002). The resource allocation problem is generally modelled as a knapsack problem with known deterministic properties. However, for practical purposes the Web must often be treated as stochastic and unknown. Unfortunately, estimating unknown knapsack properties (e.g., based on an estimation phase (Pandey et al., 2003; Wolf et al., 2002)) delays finding an optimal or near-optimal solution. Dynamic environments aggravate this problem further when the optimal solution changes with time. In this paper, we present a novel solution for the nonlinear fractional knapsack problem with a separable and concave criterion function (Bretthauer and Shetty, 2002). To render the problem realistic, we consider the criterion function to be stochastic with an unknown distribution. At every time instant, our scheme utilizes a series of informed guesses to move, in an online manner, from a \"current\" solution, towards the optimal solution. At the heart of our scheme, a game of deterministic learning automata performs a controlled random walk on a discretized solution space. Comprehensive experimental results demonstrate that the discretization resolution determines the precision of our scheme. In order to yield a required precision, the current resource allocation solution is consistently improved, until a near-optimal solution is found. Furthermore, our proposed scheme quickly adapts to periodically switching environments. Thus, we believe that our scheme is qualitatively superior to the class of estimation-based schemes","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133038265","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252354
S. Vanichayobon, J. Manfuekphan, L. Gruenwald
In a data warehouse environment, indexing techniques based on bitmap representations are useful for answering complex and ad hoc queries efficiently without adding additional hardware. They significantly improve query processing time by utilizing low-cost Boolean operations and multiple indices scans, executing queries by performing simple predicate conditions on the index level before going to the primary data source. In this paper, we propose a new bitmap called scatter bitmap index that uses less space than existing bitmap indices while maintaining query processing time. Our scatter bitmap index achieves this by representing each attribute value using only two bitmap vectors, but each bitmap vector represents many attribute values. Our experimental results confirm that the performance of our scatter bitmap index is better than those found by existing techniques for equality and membership queries from the point of view of space-time tradeoff
{"title":"Scatter Bitmap: Space-Time Efficient Bitmap Indexing for Equality and Membership Queries","authors":"S. Vanichayobon, J. Manfuekphan, L. Gruenwald","doi":"10.1109/ICCIS.2006.252354","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252354","url":null,"abstract":"In a data warehouse environment, indexing techniques based on bitmap representations are useful for answering complex and ad hoc queries efficiently without adding additional hardware. They significantly improve query processing time by utilizing low-cost Boolean operations and multiple indices scans, executing queries by performing simple predicate conditions on the index level before going to the primary data source. In this paper, we propose a new bitmap called scatter bitmap index that uses less space than existing bitmap indices while maintaining query processing time. Our scatter bitmap index achieves this by representing each attribute value using only two bitmap vectors, but each bitmap vector represents many attribute values. Our experimental results confirm that the performance of our scatter bitmap index is better than those found by existing techniques for equality and membership queries from the point of view of space-time tradeoff","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125642401","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252288
K. Boonlong, K. Maneeratana, N. Chaiyaratana
The effects of incorporating co-operative co-evolutionary strategy into a genetic algorithm (GA) for the identification of erroneous velocity vectors in particle image velocimetry (PIV) are studied. The search objective is to eliminate vectors that are dissimilar to their adjacent neighbors. A simulated cavity flow, which is modified to contain 20% erroneous vectors, is used as the case study. The co-operative co-evolutionary strategy is found to decisively improve the search effectiveness. When the effect of species size and arrangement are considered, the search rate improves with smaller species, reflecting the weak linkage between species due to the locality nature of the objective function. Best results are obtained with the 25-bit species under square arrangement. It is also observed that the current vector similarity calculation as the objective function needs further assessments for the erroneous vector detection of complex velocity flows with high error rates
{"title":"Determination of Erroneous Velocity Vectors by Co-operative Co-evolutionary Genetic Algorithms","authors":"K. Boonlong, K. Maneeratana, N. Chaiyaratana","doi":"10.1109/ICCIS.2006.252288","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252288","url":null,"abstract":"The effects of incorporating co-operative co-evolutionary strategy into a genetic algorithm (GA) for the identification of erroneous velocity vectors in particle image velocimetry (PIV) are studied. The search objective is to eliminate vectors that are dissimilar to their adjacent neighbors. A simulated cavity flow, which is modified to contain 20% erroneous vectors, is used as the case study. The co-operative co-evolutionary strategy is found to decisively improve the search effectiveness. When the effect of species size and arrangement are considered, the search rate improves with smaller species, reflecting the weak linkage between species due to the locality nature of the objective function. Best results are obtained with the 25-bit species under square arrangement. It is also observed that the current vector similarity calculation as the objective function needs further assessments for the erroneous vector detection of complex velocity flows with high error rates","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128762384","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252240
Lee Beng Kwang, L. Phee Soo Jay
The paper is written mainly based on developing a robust and reliable robotic arm and to develop a program to help the robot to improve system performance where a high degree of environment uncertainty exists such as avoiding obstacles along its moving path during milling of bone. An intelligent logic iteration model (fuzzy logic) is deployed onto a standard industrial robot with six-degree-of-freedom serial kinematics for milling of the bone in orthopaedic surgery. The objective is to enhance the surgeon's precision movements and dexterity. The system was tested in a series of experiments that measured its ability to track the desired path on an in vitro setup. The reliability and robustness of the method were also evidently shown from the experimental results. This development of this milling robotic system shows that the proposed algorithm (fuzzy) could be implemented for bone milling purposes to improve its accuracy
{"title":"Feasibility Study of a Force Feedback Controlled Robotic System for Bone Milling","authors":"Lee Beng Kwang, L. Phee Soo Jay","doi":"10.1109/ICCIS.2006.252240","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252240","url":null,"abstract":"The paper is written mainly based on developing a robust and reliable robotic arm and to develop a program to help the robot to improve system performance where a high degree of environment uncertainty exists such as avoiding obstacles along its moving path during milling of bone. An intelligent logic iteration model (fuzzy logic) is deployed onto a standard industrial robot with six-degree-of-freedom serial kinematics for milling of the bone in orthopaedic surgery. The objective is to enhance the surgeon's precision movements and dexterity. The system was tested in a series of experiments that measured its ability to track the desired path on an in vitro setup. The reliability and robustness of the method were also evidently shown from the experimental results. This development of this milling robotic system shows that the proposed algorithm (fuzzy) could be implemented for bone milling purposes to improve its accuracy","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127816394","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 : 2006-06-07DOI: 10.1109/ICCIS.2006.252258
Y. Qiu, Y. Chui, M. Helander
The usability of the software system for capturing picture is important factor for the mobile phone's interface design, which will partly determine customers' appreciation of the value of the service. Review from a human factors perspective, there are various methods for evaluating usability. However, there are no definite criteria for testing the usability of mobile phone camera software systems. This study presents a new framework for usability testing based on a typical human information processing. Usability is classified into four dimensions for testing: perception, learning/memorization, control/action and evaluative feeling. Furthermore, the criteria for testing the four dimensions of usability are defined for mobile phone camera software systems. Three different camera mobile phones are studied and compared based on task analysis and evaluation of the criteria proposed for usability testing in this study. The usability problems of three mobile phone camera software systems are identified. Suggestions for usability improvement are presented
{"title":"Usability Analysis of Mobile Phone Camera Software Systems","authors":"Y. Qiu, Y. Chui, M. Helander","doi":"10.1109/ICCIS.2006.252258","DOIUrl":"https://doi.org/10.1109/ICCIS.2006.252258","url":null,"abstract":"The usability of the software system for capturing picture is important factor for the mobile phone's interface design, which will partly determine customers' appreciation of the value of the service. Review from a human factors perspective, there are various methods for evaluating usability. However, there are no definite criteria for testing the usability of mobile phone camera software systems. This study presents a new framework for usability testing based on a typical human information processing. Usability is classified into four dimensions for testing: perception, learning/memorization, control/action and evaluative feeling. Furthermore, the criteria for testing the four dimensions of usability are defined for mobile phone camera software systems. Three different camera mobile phones are studied and compared based on task analysis and evaluation of the criteria proposed for usability testing in this study. The usability problems of three mobile phone camera software systems are identified. Suggestions for usability improvement are presented","PeriodicalId":296028,"journal":{"name":"2006 IEEE Conference on Cybernetics and Intelligent Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130039120","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
扫码关注我们
求助内容：
应助结果提醒方式：