I. Zajic, T. Larkowski, M. Sumislawska, K. Burnham, D. Hill
{"title":"Modelling of an Air Handling Unit: A Hammerstein-bilinear Model Identification Approach","authors":"I. Zajic, T. Larkowski, M. Sumislawska, K. Burnham, D. Hill","doi":"10.1109/ICSEng.2011.19","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.19","url":null,"abstract":"The paper focuses on modelling and system identification of an air handling unit (AHU), which is part of larger heating ventilation and air conditioning (HVAC) system dedicated for clean room manufacturing. The aim is to use the model for subsequent control optimisation and further for control system design. The underlying physical relations of an AHU are investigated through a white-box model. Based on the white-box model considerations a discrete-time bilinear black-box model is proposed. The AHU cooling/heating capacity is altered by means of water valves. The valve introduces a Hammerstein nonlinearity on the system input, which needs to be additionally identified together with the dynamic bilinear model representing the heating/cooling coil of the AHU. The discrete-time model coefficients are then estimated based on real measurements.","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":"121041720","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":"Hierarchical Storage Systems and File Formats for Web Archiving","authors":"H. Kawano","doi":"10.1109/ICSEng.2011.46","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.46","url":null,"abstract":"Many national libraries are making efforts to crawl and store various born-digital information, there are many difficult problems of the social, legal and technical aspects. In this paper, from the view points of long-term preservation of digital contents, we focus on the the urgent task of storage system, since the size of the web archive is increasing exponentially. In order to archive monotonously increasing contents, we discuss management of storage devices and file formats in web archive systems. Firstly, we propose an architecture of hierarchical storage system based on characteristics of storage devices and file compression formats. Next, we modify the file moving algorithm by using file access frequency. We also evaluate the performance of our proposed algorithm with predicted data based on actual statistics of a web archive system.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"283 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":"116089370","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":"Optimization of a Potential of Logistics System","authors":"M. Wasiak","doi":"10.1109/ICSEng.2011.88","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.88","url":null,"abstract":"This paper defines a potential of logistics system with regard to appropriate criteria and provides original model of logistics system allowing optimization of its potential. Model maps logistics task, system resources, system structure and characteristics of all elements. The results of static optimization of potential of logistics system performed with given approach are presented.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"27 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":"116695082","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 Hybrid Intelligent SVD-Based Digital Image Watermarking","authors":"F. Golshan, K. Mohammadi","doi":"10.1109/ICSEng.2011.32","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.32","url":null,"abstract":"This paper proposes an intelligent hybrid watermarking algorithm for digital images. In digital image watermarking, robustness and imperceptibility compete with each other. In this paper we applied a hybrid intelligent algorithm based on genetic programming and particle swarm optimization to make a trade off between robustness and imperceptibility. In this way the intelligent method has been applied in DCT_DWT_SVD domain. First of all the original image is transformed into DCT domain and then a part of DCT matrix is decomposed into four subbands using discrete wavelet transform and finally the singular values of each subband are shaped perceptually by singular values of watermark image to embed the watermark. The optimization problem which is related to a conflict between robustness and imperceptibility is solved by means of genetic programming and particle swarm optimization, simultaneously, to achieve the best performance in robustness without losing the quality of host image. Experimental results show improvement in imperceptibility and robustness under several attacks and different images.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"57 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":"123553952","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 Reliability Analysis Method for Sequential Logic Circuits","authors":"K. Mohammadi, H. Jahanirad, Pejman Attarsharghi","doi":"10.1109/ICSEng.2011.70","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.70","url":null,"abstract":"Reliability analysis of combinational logic circuits using error probabilities methods, such as PTM, has been widely developed and used in literature. However, using these methods for reliability analysis of sequential logic circuits will lead to inaccurate results, because of existence of loops in their architecture. In this paper a new method is proposed based on converting the sequential circuit to a secondary combinational circuit and applying an iterative reliability analysis to the resulting configuration. Experimental results demonstrate good accuracy levels for this method.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"74 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":"122527431","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 Novel Approach to Low Volume Generic Steganalysis","authors":"S. Arivazhagan, W. Jebarani, M. Shanmugaraj","doi":"10.1109/ICSEng.2011.35","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.35","url":null,"abstract":"Generic Steganalysis aims to detect the presence of covert communication by identifying the given test data as stego / cover media. Thresholded adjacent pixel differences using different scan paths have been used to highlight feeble embedding artifacts created out of a low rate embedding process. The scan paths normally made use of in the embedding process have been utilized for a steganalytic scheme. A co occurrence matrix derived from thresholded adjacent pixel differences serves as the feature vector aiding detection of stego images carrying very minimal payloads.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"65 2 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":"129815975","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":"Management of Virtual Network Resources and Services","authors":"A. Grzech, M. Pleszkun","doi":"10.1109/ICSEng.2011.49","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.49","url":null,"abstract":"The aim of the paper is to discuss various resources and services management strategies as dependent on equilibrium between required and available amount of resources in virtual networks environment. It is assumed that substrate virtual network resources are divided and assigned to diversified virtual networks. The latter may be organized to support application services delivery according to various business models. Some issues related to resources provisioning in virtual networks are discussed taking into account various approached to estimate required amount of resources for virtual networks and various techniques to control virtual network resources utilization. Some attention is devoted to expropriation of services with lower priorities as an approach allowing to collect required amount of resources necessary to deliver high-priority services at required quality of service level.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"27 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":"128489471","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":"Self-Reference as a Principle Indicator of Complexity","authors":"Stefan Hempel, Ricardo Pineda, Eric Smith","doi":"10.1109/ICSEng.2011.77","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.77","url":null,"abstract":"Self-reference, the ability of a system to refer to itself, is a necessary condition for complexity, and can indeed form the basis for a definition of complexity. When a part of the system can refer to the whole of the system, there indeed have to be deeper complex structures and processes than those that only superficially appear. Examples of the centrality and essentialness of self-reference to complexity can be found in many fields of study, including mathematics, intelligent networks, and systems engineering processes.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"50 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":"127207383","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":"Control Optimisation of a Domestic Heating System","authors":"P. Kret, K. Burnham, T. Larkowski, L. Koszalka","doi":"10.1109/ICSEng.2011.18","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.18","url":null,"abstract":"The paper presents various control techniques for optimization and energy efficiency for domestic heating systems. A description of the heating system model, its behaviour and underpinning processes are presented. The model of the heating system, which is inherently nonlinear, is formulated either as a linear time varying (LTV) system or a bilinear time varying (BTV) system or bilinear time invariant (BTI) system. For each model representation various formulations of generalised predictive control (GPC) are investigated. The original GPC, in its non-incremental and modified forms are implemented and tested for these systems. Depending on the model structure, i.e whether the model is LTV, BTV or BTI, the GPC is formulated as a linear self tuning control (LSTC) GPC, bilinear self tuning control (BSTC) GPC and fixed bilinear (FB) GPC, respectively. It is shown that depending on the adopted model representation various degrees of improvement are possible when using different formulations for GPC.","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":"125828633","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":"Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems","authors":"Piotr Rygielski, Adam Gonczarek","doi":"10.1109/ICSEng.2011.45","DOIUrl":"https://doi.org/10.1109/ICSEng.2011.45","url":null,"abstract":"In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"16 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":"122218594","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}