{"title":"Socioeconomic modelling using the DEVS formalism","authors":"Lukas Grulich, F. Zboril","doi":"10.1504/IJAC.2009.024748","DOIUrl":"https://doi.org/10.1504/IJAC.2009.024748","url":null,"abstract":"This paper deals with a new approach to the modelling of socioeconomic systems. In these models, there are many interacting entities (agents, players). The whole market comes up as a result of these interactions. In terms of the economy, this concept is based on the Subject-Need-Good triad. The subject in this model represents an economical subject with needs that can be satisfied by the consumption of a good. In terms of computational modelling, this concept is based on the Discrete Event System Specification (DEVS) formalism, where each subject is represented by one coupled DEVS. This coupled DEVS contains several atomic DEVS. There are only three types of atomic DEVS – generator/store, transformer and optimiser. The basic process of the concept is the transformation that changes one type of a good to another or uses a good to satisfy a need. This experimental frame will be used for the design and development of a new dynamic approach based on dynamic Petri nets.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127096504","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}
J. Kunovsky, M. Kraus, Milan Pindryc, Václav Šátek
{"title":"Comparison of TKSL to world standards","authors":"J. Kunovsky, M. Kraus, Milan Pindryc, Václav Šátek","doi":"10.1504/IJAC.2009.024749","DOIUrl":"https://doi.org/10.1504/IJAC.2009.024749","url":null,"abstract":"An original mathematical method which uses the Taylor series method for solving differential equations in a nontraditional way has been developed and implemented in the Taylor Kunovsky Simulation Language (TKSL). Even though this method is not much preferred in the literature, experimental calculations have shown and theoretical analyses have verified that the accuracy and stability of the Taylor series method exceed that of the currently used algorithms for numerically solving differential equations. It is the aim of the paper to compare TKSL to world standards (i.e., MATLAB, Maple and Mathematica software).","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123649301","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":"Towards autonomic service-oriented applications","authors":"D. Tosi, G. Denaro, M. Pezzè","doi":"10.1504/IJAC.2009.024500","DOIUrl":"https://doi.org/10.1504/IJAC.2009.024500","url":null,"abstract":"The integration of third-party web services can solve complex business problems and can reduce risks, costs and time-to-market. However, the task of the integrators is challenged by services that are maintained by different organisations, and that may evolve dynamically and autonomously. The impossibility of statically determining which service implementation will be bound at runtime may lead to unexpected failures. This paper presents a novel approach for designing self-adaptive service-oriented applications, which autonomously react to changes in the implementation of the services, automatically detect possible integration mismatches and dynamically execute suitable adaptation strategies. The solution proposed in this paper is based on a taxonomy of integration faults that helps developers anticipate potential mismatches between discovered web services and applications, and design test cases and adaptors for each mismatch. A simple tool facilitates the deployment of a runtime infrastructure that embeds the test cases and the adaptors, automatically runs the test cases against newly discovered web services, uses the test results to diagnose service mismatches and executes the adaptors to overcome the revealed problems without user intervention.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115853205","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":"Policy-based autonomic computing with integral support for self-stabilisation","authors":"R. Anthony","doi":"10.1504/IJAC.2009.024497","DOIUrl":"https://doi.org/10.1504/IJAC.2009.024497","url":null,"abstract":"This paper describes the AGILE technology for building self-managing systems. AGILE serves as both a policy expression language and a framework that facilitates the integration and dynamic composition of several autonomic computing techniques within a single deployment technology and supports run-time self-reconfiguration. The paper also discusses the need for self-stabilisation mechanisms for autonomic systems in order to reduce the reliance of autonomic components on external supervision and extend their behavioural scope and trustability. The self-stabilisation approach taken and the initial support mechanisms in this regard that have been integrated into AGILE are examined. A demonstration application illustrates the powerful dynamic adaptation capabilities of the technology. The self-stabilisation theme is prominent, but other aspects are also demonstrated, including dynamic reconfiguration at the policy level, automated built-in signal processing and trend analysis, the integration of policies and utility functions and the ease with which such advanced self-managing behaviour can be configured using AGILE.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121392287","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":"Improving the performances of JMS-based applications","authors":"C. Taton, N. D. Palma, S. Bouchenak, D. Hagimont","doi":"10.1504/IJAC.2009.024501","DOIUrl":"https://doi.org/10.1504/IJAC.2009.024501","url":null,"abstract":"In the Java world, a standardised interface exists for Message-Oriented Middleware (MOM): Java Messaging Service or JMS. Like other middleware, some JMS implementations use clustering techniques to provide some level of performance and fault tolerance. In this paper, we analyse the efficiency of various clustering policies in a real-life cluster and the key parameters impacting the performances of MOMs. We show that the resource efficiency of the clustering methods can be very poor due to local instabilities and/or global load variations. To solve these issues, we describe the rules that control these parameters for optimal performances and propose a solution based on autonomic computing to (1) dynamically adapt the load distribution among the servers (load-balancing aspect) and (2) dynamically adapt the replication level (provisioning aspect). We present an evaluation that shows the impact of these rules on the performances and behaviour of the dynamic provisioning of replicated queues.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115619339","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 autonomic problem determination system using adaptive multi-levels dictionaries and singular value decomposition techniques","authors":"T. Kwok, H. Chan","doi":"10.1504/IJAC.2009.024499","DOIUrl":"https://doi.org/10.1504/IJAC.2009.024499","url":null,"abstract":"An autonomic Problem Determination (PD) system can adapt to changing environments, react to existing or new error conditions and predict possible problems from a collection of seemingly unrelated events and take actions proactively. In this paper, we propose such a system with the use of the Singular Value Decomposition (SVD) technique and dynamic and adaptive multi-levels dictionaries. Our proposed PD system applies an iterative method that enables a dynamic interaction between a set of sparsely related events and the current dictionaries, with its entries being continuously updated to reflect the relative importance of each event. Updating the dictionaries triggers an update of the SVD matrix, thereby accelerating the convergence of the SVD matrix. Our PD system can capture knowledge in a hierarchical form for complex knowledge representation. It does not require a formal knowledge model or intensive training by examples. It is an efficient system with sufficient accuracy for autonomic and adaptive problem determination.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762006","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":"Particle swarm optimisation algorithm-based intrusion detection system for mobile ad hoc network","authors":"Shruti Dixit, R. Singhai","doi":"10.1504/IJAC.2018.097618","DOIUrl":"https://doi.org/10.1504/IJAC.2018.097618","url":null,"abstract":"Ad hoc network is the category of cooperative wireless mobile nodes with the absence of centralised authority or infrastructure. It is vulnerable to different types of attacks such as passive and active because of open environment, speedily varying topology and decentralised nodes. An attack by a malicious node known as 'black hole attack' can considerably diminishes ad hoc network performance and results in disintegration of network, inaccessible nodes and severely degrades network performance. Evaluation of the additional effect due to existence of malicious nodes and determination of the suitable measures to detect these nodes in the network is the prime objective of the research work. In order to overcome this misbehaviour activity in the network, a particle swarm optimisation algorithm-based intrusion detection system (PSO-IDS) for ad hoc networks is proposed. Swarm agents are effectively used to detect the malicious node by evaluating their packet behaviour based on packet delivery fraction (PDF), average delay, number of packets dropped and packet capture. A defence technique called IDS is deployed for prevention against black hole attack due to malicious nodes. The simulation study establishes that the proposed PSO-IDS algorithm improves the performance metrics like throughput and packet delivery ratio.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127172082","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 trust-based approach for security policies enhancement in dynamic social networks","authors":"Zeineb Dhouioui, J. Akaichi","doi":"10.1504/IJAC.2016.10002939","DOIUrl":"https://doi.org/10.1504/IJAC.2016.10002939","url":null,"abstract":"The sensitive information revealed in social networks is a real threat menacing users' privacy. Hence, trust is required to enhance the security policies in these networks. Motivated by the privacy problems in particular the danger of sexual predators and the disregard of the dynamic aspect of social networks, users popularity and activity which may affect the precision of the expected results of influential users detection, we aim to present a generic model to improve security policies. To do so, we use text mining techniques to distinguish suspicious conversations using lexical and behavioural features classification and to determine influential users having the maximum trust score value. This trust score is calculated using an algorithm called DynamicInflu inspired by the honey bee's foraging behaviour based on popularity and activity parameters. The experiments are performed on real data and the comparison of the DynamicInflu algorithm with commonly used approaches showed a good performance.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122300094","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":"Novel concept for reducing the power consumption of look ahead carry adder circuit by using stackiabatic technique","authors":"Kapil Mangla, Anil Kumar","doi":"10.1504/IJAC.2017.10010792","DOIUrl":"https://doi.org/10.1504/IJAC.2017.10010792","url":null,"abstract":"For many years, designing of the high speed low power circuits with CMOS technology was a difficult challenge for the research community. There are various levels at which design problem related to low power and increased demand can be addressed; these levels are – software level, architecture level, algorithm level, circuit level and process technology level. In this paper, we have designed a four-bit look ahead carry adder using CMOS technology. The objective of this paper is to search for different approaches that will reduce the consumption of power of look ahead carry adder. We have designed look ahead carry adder using stackiabatic technique and compared with conventional, adiabatic and stacking techniques.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127130078","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":"Evaluating QoS parameters for video streaming transmission in mobile ad hoc networks","authors":"M. Sedrati, H. Taleb","doi":"10.1504/IJAC.2016.10002941","DOIUrl":"https://doi.org/10.1504/IJAC.2016.10002941","url":null,"abstract":"Recently, multimedia streaming applications are deployed anywhere (homes, campuses, etc.). Delivering these applications over mobile ad hoc networks is a challenging task: first, mobile ad hoc networks are infrastructure less, with dynamic topology, and limited resources. Secondly these applications have strict quality of service (QoS) requirements given with delay, jitter, bandwidth, loss rate, etc. Several architectures have been developed. However, an important part like QoS in routing level is still omitted. In this paper, many different coding techniques for video streaming are reviewed and two routing protocols (reactive and proactive) are used to evaluate which of them can improve QoS for multimedia streaming applications. Results show that reactive protocol performs better than proactive protocol in terms of throughput and network load in high mobility, but roles are reversed in terms of loss rate and network load for large-scale networks. PNSR and Jitter are influenced by nodes numbers independently of used protocol.","PeriodicalId":374882,"journal":{"name":"Int. J. Auton. Comput.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126705028","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}