{"title":"An Application of Adaptive Control in the Behavioural Framework","authors":"R. Pfaff, T. Larkowski, K. Burnham","doi":"10.1109/ICSEng.2011.17","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.17","url":null,"abstract":"The behavioral framework for modelling and control is a framework that does not distinguish textit{a priori} between input and output of a system. Control in the behavioral framework does not make use of the intelligent control scheme consisting of observation of system output and feedback. Instead it relies on the interconnection of the to-be-controlled system to an appropriate controller, yielding the desired overall behaviour. In this paper, such a scheme is presented and compared to a feedback control scheme based on a numerical study. A focussed introduction into the behavioral framework with the concepts important for this paper is presented.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115460319","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":"An Agent Simulation Heuristics for Snowplowing Problems","authors":"Satoshi Takahashi, T. Matsuo","doi":"10.1109/ICSEng.2011.36","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.36","url":null,"abstract":"This paper proposes a heuristics method for huge task allocation problem over snowblower tasks. It is difficult to solve the huge task allocation problem. A snowblower problem includes a task allocation problem and agents scheduling problem. Given a directed graph as city map, we should consider some arc-disjoint partitions of the graph as allocation. A graph partition problem is a fundamental problem of combinatorics, there are some effective algorithms for the problem. However, in the case that we consider the task allocation and scheduling, the graph partition problem is too difficult. Because of this fact, we employ an agent simulation for solving the snowblower problem.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114978825","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":"Component Monitoring with Integrated Sensors","authors":"B.J.A. van Thiel, P. Nyhuis","doi":"10.1109/ICSEng.2011.72","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.72","url":null,"abstract":"As part of the collaborative research centre 653 (CRC 653) at the Leibniz University of Hannover, sensors and sensitive materials are being developed which can be integrated into components and register the component condition directly. The part-project \"Component status driven maintenance\" presented here, develops the methodical procedure for being able to use these sensors in preventive maintenance. Preventive maintenance however is not possible solely on the basis of the current status information of the components. A much more decisive factor is a database by means of which the further development of this status can be estimated. This enables the determination of possible causes of faults before they occur, and the assessment of the failure risk of components.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128438134","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 Code Width Built-In-Self Test Circuit for 8-bit Pipelined ADC","authors":"A. Barua, Mohammad Tausiff","doi":"10.1109/ICSEng.2011.58","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.58","url":null,"abstract":"This paper presents a novel built-in-self-test (BIST) scheme based on code-width and sample difference. The proposed BIST scheme is applied on 8-bit pipelined ADC (Analog to Digital Converter). An 8-bit pipelined ADC is designed. This pipelined ADC uses analog preprocessing to divide the input signal range into sub-intervals and amplification of a residue signal for further processing in the subsequent stages. The realization of the preprocessing stages has been implemented using switched-capacitor circuits. The proposed BIST scheme is verified by simulation of 8 bit pipelined ADC with arbitrary faults. The proposed method is alternative to histogram based analysis techniques to provide test time improvements. In addition to the measurement of DNL (Differential Non Linearity) and INL (Integral Non Linearity), non monotonic behavior and missing code fault have been detected.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128464390","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}
M. Mousavi, R. P. Zangabad, S. Chamanian, M. Bahrami
{"title":"Simulation of Novel Linear Inductive Displacement Sensor","authors":"M. Mousavi, R. P. Zangabad, S. Chamanian, M. Bahrami","doi":"10.1109/ICSEng.2011.76","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.76","url":null,"abstract":"One of the displacement measurement methods is using inductive sensors, usable for both small and large displacement. In this paper a 3-D linear inductive displacement sensor has been introduced. The proposed sensor consists of 2 elements that can measure 5cm with accuracy of 100ìm in large scale measurement. The first part is a coil and the second is a movable core that moves within the coil and it operate like differential pair. For transforming the value of varying in inductance that is in the result of approaching the target to the sensor, inductance varying is transformed to the voltage varying in vet son bridge circuit and finally, the value of displacement can be obtain.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128496307","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":"Locating Malicious Links in Fully-Connected Networks Using a Formal Framework","authors":"Adel Khosravi, K. Mohammadi, M. Shiroie","doi":"10.1109/ICSEng.2011.51","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.51","url":null,"abstract":"Byzantine agreement problem has been mostly studied for networks with fallible processors. However, link failure is a common problem in distributed system when the messages are relayed through individual processors and delivered to the receiver. There are few works on locating malicious faulty links using byzantine framework. The proposed protocol can detect/locate maximum number of malicious faulty links and tolerate maximum number of allowable faulty links to make each fault-free processor reaching a common agreement.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128881529","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":"The Algorithm of Fault Tolerant Locomotion of Pentapod Robot","authors":"S. Moradian, K. Mohammadi","doi":"10.1109/ICSEng.2011.39","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.39","url":null,"abstract":"In this article we present the gait analysis of pentagonal model for pentapod robot. By using the mathematical relations, the stability margin, turning ability and elongation of stride of robot will be studied. A criterion is considered as stance which in a perfect period of locomotion refers to the minimum number of robot's leg which is in contact with terrain. It shows that the turning ability of robot is not depend on the amount of ratio of width to the length of reachable area and the amounts of stability margin and elongation of stride by increasing the process of walking of robot shows with two-dimensional models. The previous amounts in presented criterions of hexapod robot compare with current model.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122173312","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}
Grzegorz Labiak, M. Adamski, J. Tkacz, M. Doligalski, A. Bukowiec
{"title":"Role of UML Modelling in Discrete Controller Design","authors":"Grzegorz Labiak, M. Adamski, J. Tkacz, M. Doligalski, A. Bukowiec","doi":"10.1109/ICSEng.2011.97","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.97","url":null,"abstract":"The paper presents an application of UML technology in a discrete system development process. In the process at the analysis stage UML diagrams are fundamental tool. The outcome of this stage is a basis for formal models exploited at the design stage, where the design is symbolically verified and treated as a rule-based system. Two formal models of good graphical appeal are proposed: Petri nets and statechart diagrams. Both are heavily using Boolean expressions what makes that design can easily be implemented in modern programmable structures.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122744448","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":"Exceptions Handling in Hierarchical Petri Net Based Specification for Logic Controllers","authors":"M. Doligalski, M. Adamski","doi":"10.1109/ICSEng.2011.91","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.91","url":null,"abstract":"Hierarchical Petri nets beside UML state machine diagrams, sequentional function charts (SFC) and hierarchical concurrent state machines are common solution for specification of logic controllers. These specification formats provide both concurrency and modeling on multi levels of abstraction (hierarchic approach). But only state machine diagrams supports exceptions handling in direct way. Program model presented in form of state machine diagram may be later transformed into a program in the SFC language or transformed in the Petri Net and implemented in the FPGA structure. Similarity between SFC language and Petri Nets give us lot of tools for analysis such control system[3]. Article presents new approach for exceptions handling in hierarchical Petri nets as formal specification for logic controllers. Proposed method of specification can be used independently or as a part of dual specification (correlated state machine diagram and hierarchical Petri Net).","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126592940","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":"Complex Services Availability in Service Oriented Systems","authors":"A. Grzech, P. Swiatek","doi":"10.1109/ICSEng.2011.48","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.48","url":null,"abstract":"The aim of the paper is to discuss some issues related to services composition in service oriented systems based on Service Oriented Architecture (SOA) paradigm. The main feature of service oriented architecture is that the required services may be efficiently and flexibly composed of available well-defined components providing certain functionalities. It is rather obvious that the flexibility and availability of complex services, composed of commonly-shared components, may be limited in environment where concurrent requests should be satisfied. In gain to discuss complex services availability as dependent on components availabilities and complex service structure a model of complex service is introduced. The latter is used to discuss various aspects of service availability in context of service structure and components availabilities changes.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131398660","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}