{"title":"A simulation case study: Reducing outpatient waiting time of otolaryngology care services using VBA","authors":"M. Haji, H. Darabi","doi":"10.1109/CASE.2011.6042448","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042448","url":null,"abstract":"Patients' waiting times in healthcare services are often long and unacceptable, and place great stress on clinic staff. This paper describes the development and use of a detailed simulation model of an Ear, Nose, and Throat (ENT) outpatient clinic at the University of Illinois Medical Center. Arena simulation software combined with Arena Visual Basic for Applications (VBA) are used to model the ENT clinic and their appointment system. VBA allows various appointment schedules to be examined and the interaction between the appointment system and patient waiting times to be evaluated. It has been shown that an alternative appointment schedule significantly reduces patient waiting times without a need for extra resources.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133738623","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}
Paolo Ballarini, Hilal Djafri, M. Duflot, S. Haddad, N. Pekergin
{"title":"Petri nets compositional modeling and verification of Flexible Manufacturing Systems","authors":"Paolo Ballarini, Hilal Djafri, M. Duflot, S. Haddad, N. Pekergin","doi":"10.1109/CASE.2011.6042488","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042488","url":null,"abstract":"Flexible Manufacturing Systems (FMS) are amongst the most studied types of systems, however due to their increasing complexity, there is still room for improvement in their modeling and analysis. In this paper we consider the design and the analysis of stochastic models of FMS in two complementary respects. First we describe a (stochastic) Petri Nets based compositional framework which enables to model an FMS by combination of an arbitrary number of basic components. Second we demonstrate how classical transient-analysis of manufacturing systems, including reliability and performability analysis, can be enriched by application of a novel, sophisticated stochastic logic, namely the Hybrid Automata Stochastic Logic (HASL). We demonstrate the proposed methodology on an FMS example.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129752291","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}
{"title":"Diagnosis of critical embedded systems: application to the control card of a railway vehicle braking systems","authors":"R. Saddem, A. Toguyéni, M. Tagina","doi":"10.1109/CASE.2011.6042512","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042512","url":null,"abstract":"Embedded systems are more and more used to control critical systems. In this paper, we propose a diagnostic approach to increase the security of control of critical embedded system based on digital components. This is a part of a study to design of an electronic card to control a railway vehicle braking system. Because of the critical aspect, it is necessary to diagnose the failures of the control card to process them online for safety purposes. In this paper, we propose to use diagnoser technique based on timed automata. But since this technique suffers of combinatorial explosion and because digital devices are characterized by a lot of input/output, our approach proposes to make an abstraction of the system behavior to reduce the size of the models and to implement a kind of distributed diagnosers.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"1947 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129271995","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}
{"title":"A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems","authors":"Tao Wu, Leyuan Shi","doi":"10.1109/CASE.2011.6042405","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042405","url":null,"abstract":"This paper considers the capacitated multi-level production planning problem with the consideration of backorders. Demand for each item is deterministic in each level and in each period with a given horizon of T periods. The objective is to minimize the total cost that includes setup, inventory holding, backlogging, and overtime cost. For each period, the demand must be satisfied without exceeding capacities. To achieve high quality solutions for this class of production planning problems, we develop a lower and upper bound guided nested partitions method. The optimization method effectively utilizes domain knowledge guided by both lower and upper bound solutions, and then provides an efficient partitioning and sampling strategy. Consequently, in the approach most of the search is kept around the most promising regions capable of leading to good solutions. Extensive computational tests show that our proposed heuristic approach provides good solution results based on benchmark problems.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122451391","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}
{"title":"Multi-robot persistent surveillance planning as a Vehicle Routing Problem","authors":"Ethan Stump, Nathan Michael","doi":"10.1109/CASE.2011.6042503","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042503","url":null,"abstract":"We consider a persistent surveillance problem as one of finding sequences of visits to discrete sites in a periodic fashion, cast it as a Vehicle Routing Problem with Time Windows, and solve it using exact methods developed in the operations research community. The work is a successful application of recent advances in combinatorial optimization for logistics problems but in the context of a robotics application taking place in continuous time. We apply these methods to the task of surveying a building using multiple UAVs and perform a long-term simulation developed to mimic a hardware testbed currently under development.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122460924","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}
Domenico Leonardo, Stefan Kleinmann, Agathe Koller-Hodac, A. Dabrowska, R. Stetter
{"title":"Simulation of a hydraulic pump application for monitoring and diagnosis methods","authors":"Domenico Leonardo, Stefan Kleinmann, Agathe Koller-Hodac, A. Dabrowska, R. Stetter","doi":"10.1109/CASE.2011.6042456","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042456","url":null,"abstract":"This paper is based on a current research project and describes the implementation of a simulation model, a monitoring and diagnosis system for a pump application in the burner industry. The objective is to improve the reliability and the efficiency of the pump system especially using the pump itself as a sensor. An important part of the project is a simulation environment which provides a basis for the monitoring and diagnosis system.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117158554","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}
{"title":"A unified approach for the scheduling problem with rejection","authors":"Shunji Tanaka","doi":"10.1109/CASE.2011.6042459","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042459","url":null,"abstract":"This paper is devoted to the scheduling problem with rejection. This problem is to determine which jobs should be accepted or rejected, and then to schedule the accepted jobs on machines so that total rejection cost plus schedule cost is minimized, or total revenue minus schedule cost is maximized. The latter equivalent maximization problem is called the order acceptance and scheduling problem. The main result of this paper is very simple. The scheduling problem with rejection in which the schedule cost is the sum of job completion costs can be converted into the ordinary scheduling problem with slightly modified job completion costs. This enables us to apply algorithms developed for ordinary scheduling problems to the corresponding scheduling problems with rejection. The effectiveness of the proposed conversion method will be demonstrated by numerical experiment: Several types of single-machine scheduling problems with rejection are solved by our exact algorithms for ordinary single-machine scheduling problems. As a result, the proposed method is shown to outperform the best branch-and-bound algorithm so far.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"58 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113933465","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}
{"title":"Fast and accurate object detection by means of recursive monomial feature elimination and cascade of SVM","authors":"L. Col, F. A. Pellegrino","doi":"10.1109/CASE.2011.6042464","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042464","url":null,"abstract":"Support Vector Machines (SVMs) are an established tool for pattern recognition. However, their application to real-time object detection (such as detection of objects in each frame of a video stream) is limited due to the relatively high computational cost. Speed is indeed crucial in such applications. Motivated by a practical problem (hand detection), we show how second-degree polynomial SVMs in their primal formulation, along with a recursive elimination of monomial features and a cascade architecture can lead to a fast and accurate classifier. For the considered hand detection problem we obtain a speed-up factor of 1600 with comparable classification performance with respect to a single, unreduced SVM.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115717245","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}
N. Koyama, K. Ohara, Akiyuki Hasegawa, T. Takubo, Y. Mae, T. Arai
{"title":"Multiple cell suction and supply system for automated cell manipulation on microfluidic channel","authors":"N. Koyama, K. Ohara, Akiyuki Hasegawa, T. Takubo, Y. Mae, T. Arai","doi":"10.1109/CASE.2011.6042486","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042486","url":null,"abstract":"Advances in biology have clarified the details of many phenomena and their results have been applied to many fields. However, in these fields, applications require dexterous and skillful manipulation. Hence, realizing high productivity is still difficult. To solve this problem, assisted cell manipulation and automated systems have been researched and microfluidic channel technology has been used in these fields. Most research focuses on only one part of the cell manipulation process, such as the cutting or sorting of cells. In the meantime, less attention has been paid to methods of supplying the target cells to a microfluidic channel. We have developed a multiple cell supply system for the microfluidic channel to realize automated cell cloning. This system sucks bovine egg cells with a size of 100[µm] and sends them to the microfluidic channel, then finally sends them to the cell manipulation part. It consists of a microfluidic channel, a pump, solenoid valves, camera systems, and an automatic stage. The cell supply action can be realized by controlling these parts through a computer program.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116939000","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}
{"title":"A symbolic schedulability technique of real-time systems modeled by P-Time Petri nets","authors":"P. Bonhomme","doi":"10.1109/CASE.2011.6042481","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042481","url":null,"abstract":"This paper addresses the schedulability analysis of real-time systems modeled by P-Time Petri nets. The proposed approach is based on the consideration of the reachability graph of the (untimed) underlying Petri net of the studied model. The schedulability analysis is then conducted in two steps. Once a feasible firing sequence (called occurrence sequence) is highlighted, thanks to a firing instant based approach the timing constraints are added, yielding an inequality system representing its timing behavior. Thus, deciding whether a firing sequence is schedulable or not takes the form of the solution of a linear programming problem. Furthermore, the modification of a timing constraint does not alter the form of the obtained system, helping adjusting accurately timing properties in a specifications refinement purpose.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"130 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123445555","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}