{"title":"Emergence of communication in multi-agent systems using reinforcement learning","authors":"M. Mazurowski, J. Zurada","doi":"10.1109/ICCCYB.2006.305696","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305696","url":null,"abstract":"In this paper, the new approach to the emergence of communication between autonomous agents is introduced. The learning scheme is presented, which allows for emergence of efficient communication between agents in cooperative systems. Classical reinforcement learning framework extended to multi-agent systems is used. Language capabilities are modeled by modifying agents' policy. In order to do this, so called linguistic state and action variables are added to extend agents' state and action spaces. Linguistic state variables represent the signal received by an agent and linguistic action variables represent a signal sent by an agent. Set of agents is divided into receivers and senders on the basis of their ability to send and receive communication signals. The experiment with two-agent system is presented. It is shown how a simple communication evolves simultaneously with a non-linguistic behavior as a tool to coordinate agents actions in order to implement a task. At the end, conclusion is made that presented approach can be applied to ensure an efficient communication within real-world heterogenous, task-oriented multi-agent systems.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116617692","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":"Mathematical Model of Natural Languages","authors":"J. Henno","doi":"10.1109/ICCCYB.2006.305733","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305733","url":null,"abstract":"To make computers to understand natural language we have to understand the nature and structure of natural language. This enables computers self to create a common language, whose features are similar to natural languages. Here is presented a mathematical structure, describing the emergence of compositional natural-like language with names and described results of computational experiments, showing that in this structure a society of agents in the process of communication acts creates a common language, similar to natural language and the process has features, similar to the language-learning process of children.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122788651","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":"Generalized Incremental Small Gain","authors":"V. Zada","doi":"10.1109/ICCCYB.2006.305695","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305695","url":null,"abstract":"This paper is directed on a using of Banach fixed-point theorem in the problem of stabilization of nonlinear systems. The theory is developed in Banach spaces with using general operator theory and may be applied both for continuous and for discrete systems. All theorems are proved and may be separated into two classes, global and local contraction operator theorems. It is studied possibility of parameters changes and continuity changes. Moreover there are derived a precision of convergence and a rate of convergence. It is interesting, that although it is almost nothing presupposed about the structure of controlled system and controller, the fact, that the operator of closed loop is k-contractive, allows to prove relatively strong assertions.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134630345","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}
I. Ainbinder, G. Pinto, G. Rabinowitz, Y. T. Ben-Dov
{"title":"A Customized Branch and Bound Algorithm to Solve the Resource-Sharing and Scheduling Problem (RSSP)","authors":"I. Ainbinder, G. Pinto, G. Rabinowitz, Y. T. Ben-Dov","doi":"10.1109/ICCCYB.2006.305719","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305719","url":null,"abstract":"We propose a customized branch and bound (B&B) algorithm (which we refer to as B&B#2) to solve the resource-sharing and scheduling problem (RSSP). The RSSP has previously been formulated as a continuous-time mixed-integer linear programming model and was optimally solved using a branch-and-bound (B&B) algorithm (which we refer to as B&B#1). The RSSP considers the use of a set of resources for the production of several products. Producing each product requires a set of operations with precedence relationships among them. Each operation can be performed using alternative modes which define the subset of resources needed. An operation may share different resources simultaneously. The problem is to select a single mode for each operation (i.e., the allocation decision) and accordingly to schedule the resources (i.e., the sequencing decision) while minimizing the makespan time. The B&B algorithm we propose is based on a minimal branching process at the allocation decision level. We compare the runtime of B&B#2 algorithm versus B&B#1 algorithm on a set of problem instances. The results showed that the average runtime of the B&B#2 algorithm was the smallest.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130318616","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":"Windowed Fourier Transform of Experimental Robotic Signals with Fractional Behavior","authors":"M. Lima, J. Machado, M. Crisostomo","doi":"10.1109/ICCCYB.2006.305734","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305734","url":null,"abstract":"This paper analyzes the signals captured during impacts and vibrations of a mechanical manipulator. The signals are treated through signal processing tools such as the fast Fourier transform and the windowed Fourier transform. The Fourier spectrum of several signals presents a noninteger behavior. The experimental study provides useful information that can assist in the design of a control system to deal with the unwanted effects of vibrations.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122123429","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":"Defining Requirements for ad hoc Coalition Systems during Disasters","authors":"S. Fortier, J. Volk","doi":"10.1109/ICCCYB.2006.305702","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305702","url":null,"abstract":"The advent of terrorist threats has heightened local, regional, and national governments' interest in emergency response and disaster preparedness. The threat of natural disasters also challenges emergency responders to act swiftly and in a coordinated fashion. When a disaster occurs, an ad hoc coalition of pre-planned groups usually forms to respond to the incident. History has shown that these \"system of systems\" do not interoperate very well. Communications between fire, police and rescue components either do not work or are inefficient. Recent disasters, such as Hurricane Katrina and the tsunami in Indonesia, have illuminated the weaknesses in emergency response. This paper discusses the need for defining requirements for components of ad hoc coalitions which are formed to respond to disasters.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121998013","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 Note on Particle Swarm Optimization: An integrated and theoretical approach","authors":"Chao-Wei Chou, Hsin-Hui Lin, Jiann-Horng Lin","doi":"10.1109/ICCCYB.2006.305693","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305693","url":null,"abstract":"In this paper, a general and integrated form is proposed for the different kinds of particle swarm optimization. Also, some related theoretical results are given, including a convergence theorem for the random selection case and a lemma on probability percentile. To compare different PSO algorithms in effectiveness and efficiency, we propose three comparison indexes of universal standard.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704681","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":"From Systems to Plectics: the Challenge of Systemic Inquiry in Measurement, Modelling and Pedagogy","authors":"B. Pátkai, I. Rudas, J. Tar","doi":"10.1109/ICCCYB.2006.305742","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305742","url":null,"abstract":"This paper briefly reviews some of the most prominent systems theories from the 20th century and supports the arguments of Murray Gell-Mann who proposed the use of \"plectics\" instead of the overused and ambiguous \"systems science\" and \"systems theories\" terms. It is claimed that measurement of complex systems is essentially a modeling task as the boundaries between the specific steps of the scientific method are necessarily blurred. A critical and extended interpretation of the scientific method, systems modeling and addressing the difficulty of teaching systems science-related disciplines completes the arguments for an integrated, truly systemic view of this field.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131856781","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":"Intelligent Diagnosis System","authors":"M. Stachowicz, A. Karaguishiyev","doi":"10.1109/ICCCYB.2006.305704","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305704","url":null,"abstract":"Auscultation of heart murmurs can detect various types of heart problems; however, this process is prone to human error because it involves a clinician evaluating and categorizing the heart sound via stethoscope. By implementing Soft Computing techniques to analyze the sound received from the stethoscope and classify the heart pathology, this research project introduces the intelligent diagnosis system that is not based on subjective evaluations. The sound signal from the stethoscope is transformed into a spectrogram (an image that shows the time-based analysis of the frequency components) formed by taking the Fourier transform over a small sliding window in time. The magnitudes of the resulting Fourier transforms are mapped to a color function in a density plot. Color Reduction and Color Feature extraction methods are applied to convert the density plot to a manageable image characteristic and reduce the colors of the density plot from sixteen million to eight: red, green, blue, cyan, magenta, yellow, white, and black. The density plot represented by the eight- color vector is then matched with a database to identify a possible pathology.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121485760","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":"On New General Class of 3π- Uninorms","authors":"K. Saastamoinen","doi":"10.1109/ICCCYB.2006.305701","DOIUrl":"https://doi.org/10.1109/ICCCYB.2006.305701","url":null,"abstract":"In this article we are presenting new class of uninorms starting from the 3π-uninorm. We give proof that this new class of the parameterized 3π-uninorm still holds all the properties of uninorms. We also add this new measure generalized mean and weights. We add this comparison measure into the typical instance based classification procedure and show that this new comparison measure gives more flexibility for results achieved than simple 3pi-uninorm gives. Comparison with some known classification results with different classifiers is also added in practical part of this article.","PeriodicalId":160588,"journal":{"name":"2006 IEEE International Conference on Computational Cybernetics","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134089992","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}