Pub Date : 1994-09-01DOI: 10.1016/1069-0115(94)90012-4
Abdollah Homaifar, Bijan Sayyarrodsari, John E. Hogans IV
Reports on successful applications of fuzzy logic controllers (FLCs) are no longer rare. Regardless of the application domain, the main idea is to convert a linguistic control scenario into an automatic control strategy. The expert's knowledge is the backbone of this linguistic control strategy. FLCs have their most successful implementations where the process under control is too complex for analysis by conventional quantitative methods and, therefore, conventional controllers face serious shortcomings. This paper proposes a “hybrid” implementation of FLCs and conventional PID controllers that can be helpful in some applications. The proposed method is applied to a 2 degree of freedom robot arm with promising results.
{"title":"Fuzzy controller for robot arm trajectory","authors":"Abdollah Homaifar, Bijan Sayyarrodsari, John E. Hogans IV","doi":"10.1016/1069-0115(94)90012-4","DOIUrl":"10.1016/1069-0115(94)90012-4","url":null,"abstract":"<div><p>Reports on successful applications of fuzzy logic controllers (FLCs) are no longer rare. Regardless of the application domain, the main idea is to convert a linguistic control scenario into an automatic control strategy. The expert's knowledge is the backbone of this linguistic control strategy. FLCs have their most successful implementations where the process under control is too complex for analysis by conventional quantitative methods and, therefore, conventional controllers face serious shortcomings. This paper proposes a “hybrid” implementation of FLCs and conventional PID controllers that can be helpful in some applications. The proposed method is applied to a 2 degree of freedom robot arm with promising results.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 2","pages":"Pages 69-83"},"PeriodicalIF":0.0,"publicationDate":"1994-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90012-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83051200","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}
Pub Date : 1994-09-01DOI: 10.1016/1069-0115(94)90013-2
Daniel T. Joyce
This paper looks at the possibility of using fuzzy terms in a software requirements specification. Potential benefits are reviewed. Methods for testing whether a fuzzy specification is met are investigated. Ways of modeling criticality and rigidity of specifications using fuzzy approaches are also identified. An example based on query response times is used throughout the paper. The results of a pilot study to see whether computer response time requirements can be fuzzified are described.
{"title":"Examining the potential of fuzzy software requirements specifications","authors":"Daniel T. Joyce","doi":"10.1016/1069-0115(94)90013-2","DOIUrl":"10.1016/1069-0115(94)90013-2","url":null,"abstract":"<div><p>This paper looks at the possibility of using fuzzy terms in a software requirements specification. Potential benefits are reviewed. Methods for testing whether a fuzzy specification is met are investigated. Ways of modeling criticality and rigidity of specifications using fuzzy approaches are also identified. An example based on query response times is used throughout the paper. The results of a pilot study to see whether computer response time requirements can be fuzzified are described.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 2","pages":"Pages 85-102"},"PeriodicalIF":0.0,"publicationDate":"1994-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90013-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84422152","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}
Pub Date : 1994-09-01DOI: 10.1016/1069-0115(94)90011-6
Shahram Latifi
This paper addresses the simulation of four networks whose underlying topology is a Cayley graph. The SIMD model of parallelism is used in this study. The networks considered are: star graph, bubble-soart graph, and pancake graph. The simulation is performed by mimicking the interconnection functions of the guest (network to be simulated) using a set of interconnection functions offered by the host. The interconnection function of the network to be simulated that requires the most time to simulate determines the simulation time of that network. The simulation times for all cases are derived and shown to be optimal. Results indicate the superiority of pancake networks over star networks in simulating the networks under study.
{"title":"On simulation of some Cayley-based networks","authors":"Shahram Latifi","doi":"10.1016/1069-0115(94)90011-6","DOIUrl":"10.1016/1069-0115(94)90011-6","url":null,"abstract":"<div><p>This paper addresses the simulation of four networks whose underlying topology is a Cayley graph. The SIMD model of parallelism is used in this study. The networks considered are: star graph, bubble-soart graph, and pancake graph. The simulation is performed by mimicking the interconnection functions of the guest (network to be simulated) using a set of interconnection functions offered by the host. The interconnection function of the network to be simulated that requires the most time to simulate determines the simulation time of that network. The simulation times for all cases are derived and shown to be optimal. Results indicate the superiority of pancake networks over star networks in simulating the networks under study.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 2","pages":"Pages 61-68"},"PeriodicalIF":0.0,"publicationDate":"1994-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90011-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88191459","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}
Pub Date : 1994-09-01DOI: 10.1016/1069-0115(94)90014-0
Akira Hirose
Applications of complex-valued neural networks to optical signal processing using phase-sensitive detection schemes are proposed and discussed. In optical information processing systems, the advantages of complex-valued neural networks are realized directly utilizing the physical phenomena of lightwave and phase-sensitive optical detection. In the proposed system, the summation and nonlinear transform of the complex signals are processed quickly in parallel by using an optical circuit. The phase-sensitive detection scheme is used for extracting the complex-valued signals. The complex-valued neural networks implemented as optical neural systems provide a starting point for coherent optical neural networks.
{"title":"Applications of complex-valued neural networks to coherent optical computing using phase-sensitive detection scheme","authors":"Akira Hirose","doi":"10.1016/1069-0115(94)90014-0","DOIUrl":"10.1016/1069-0115(94)90014-0","url":null,"abstract":"<div><p>Applications of complex-valued neural networks to optical signal processing using phase-sensitive detection schemes are proposed and discussed. In optical information processing systems, the advantages of complex-valued neural networks are realized directly utilizing the physical phenomena of lightwave and phase-sensitive optical detection. In the proposed system, the summation and nonlinear transform of the complex signals are processed quickly in parallel by using an optical circuit. The phase-sensitive detection scheme is used for extracting the complex-valued signals. The complex-valued neural networks implemented as optical neural systems provide a starting point for coherent optical neural networks.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 2","pages":"Pages 103-117"},"PeriodicalIF":0.0,"publicationDate":"1994-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90014-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84609440","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}
Pub Date : 1994-07-01DOI: 10.1016/1069-0115(94)90003-5
Qing Hu, David B. Hertz
The slow and uncertain convergence of multilayer feedforward neural networks using the backpropagation training algorithm is caused mainly by the iterative nature of the dynamic process of finding the weight matrices with static control parameters. This study investigates the use of fuzzy logic in controlling the learning processes of such neural networks. Each learning neuron in the neural networks suggested here has its own learning rate dynamically adjusted by a fuzzy logic controller during the course of training according to the output error of the neuron and a set of heuristic rules. Comparative tests showed that such fuzzy backpropagation algorithms stabilized the training processes of these neural networks and, therefore, produced 2 to 3 times more converged tests than the conventional backpropagation algorithms. The sensitivities of the training processes to the variations of fuzzy sets and membership functions are examined and discussed.
{"title":"Fuzzy logic controlled neural network learning","authors":"Qing Hu, David B. Hertz","doi":"10.1016/1069-0115(94)90003-5","DOIUrl":"10.1016/1069-0115(94)90003-5","url":null,"abstract":"<div><p>The slow and uncertain convergence of multilayer feedforward neural networks using the backpropagation training algorithm is caused mainly by the iterative nature of the dynamic process of finding the weight matrices with static control parameters. This study investigates the use of fuzzy logic in controlling the learning processes of such neural networks. Each learning neuron in the neural networks suggested here has its own learning rate dynamically adjusted by a fuzzy logic controller during the course of training according to the output error of the neuron and a set of heuristic rules. Comparative tests showed that such fuzzy backpropagation algorithms stabilized the training processes of these neural networks and, therefore, produced 2 to 3 times more converged tests than the conventional backpropagation algorithms. The sensitivities of the training processes to the variations of fuzzy sets and membership functions are examined and discussed.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 1","pages":"Pages 15-33"},"PeriodicalIF":0.0,"publicationDate":"1994-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90003-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84570289","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}
Pub Date : 1994-07-01DOI: 10.1016/1069-0115(94)90002-7
John M. Warmerdam, Timothy L. Jacobs
This paper presents a mathematical model for optimally siting and routing hazardous waste operations conditioned on public perception toward acceptable costs and risks. The routing and siting of hazardous waste operations is governed as much by the public's perception of acceptable cost and risk as by any other factor. These perceptions are integrated into the model through the use of fuzzy sets that represent the public's degree of acceptance toward unique policy options. Perceived risk is used to help determine a policy's acceptability. Model solutions define a trade-off relationship between cost, risk, and the perception that the policy is acceptable. Initially, linear fuzzy membership functions for acceptable cost and risk are used to demonstrate the efficacy of this approach. Following the linear formulation, more realistic and computationally complex nonlinear membership functions are incorporated into the model. To illustrate the models, a case study that considers the current effort by North Carolina to site a hazardous waste incinerator is presented.
{"title":"Fuzzy set approach to routing and siting hazardous waste operations","authors":"John M. Warmerdam, Timothy L. Jacobs","doi":"10.1016/1069-0115(94)90002-7","DOIUrl":"https://doi.org/10.1016/1069-0115(94)90002-7","url":null,"abstract":"<div><p>This paper presents a mathematical model for optimally siting and routing hazardous waste operations conditioned on public perception toward acceptable costs and risks. The routing and siting of hazardous waste operations is governed as much by the public's perception of acceptable cost and risk as by any other factor. These perceptions are integrated into the model through the use of fuzzy sets that represent the public's degree of acceptance toward unique policy options. Perceived risk is used to help determine a policy's acceptability. Model solutions define a trade-off relationship between cost, risk, and the perception that the policy is acceptable. Initially, linear fuzzy membership functions for acceptable cost and risk are used to demonstrate the efficacy of this approach. Following the linear formulation, more realistic and computationally complex nonlinear membership functions are incorporated into the model. To illustrate the models, a case study that considers the current effort by North Carolina to site a hazardous waste incinerator is presented.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 1","pages":"Pages 1-14"},"PeriodicalIF":0.0,"publicationDate":"1994-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90002-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136853339","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}
Pub Date : 1994-07-01DOI: 10.1016/1069-0115(94)90004-3
H.D. Cheng, X. Cheng
Shape recognition is an important research area in pattern recognition. It also has wide practical applications in many fields. An attribute grammar approach to shape recognition combines both advantages of syntactic and statistical methods and makes shape recognition more accurate and efficient. However, the time complexity of a sequential shape recognition algorithm using attribute grammar is O(n3) where n is the length of an input string. When the problem size is very large, it needs much more computing time; therefore, a high-speed parallel shape recognition algorithm is necessary to meet the demands of some real-time applications. This paper presents a parallel shape recognition algorithm, and also discusses the algorithm partition problem as well as its implementation on a fixed-size VLSI architecture. The proposed algorithm has time complexity O(n3/k2) if using k × k processing elements. When k = n, its time complexity is O(n). The experiment has been conducted to verify the performance of the proposed algorithm. The correctnes of the algorithm partition and the behavior of proposed VLSI architecture have also been proved through the experiment. The results indicate that the proposed algorithm and the VLSI architecture could be very useful to imaging processing, pattern recognition, and related areas, especially for real-time applications.
{"title":"Parallel shape recognition and its implementation on a fixed-size VLSI architecture","authors":"H.D. Cheng, X. Cheng","doi":"10.1016/1069-0115(94)90004-3","DOIUrl":"https://doi.org/10.1016/1069-0115(94)90004-3","url":null,"abstract":"<div><p>Shape recognition is an important research area in pattern recognition. It also has wide practical applications in many fields. An attribute grammar approach to shape recognition combines both advantages of syntactic and statistical methods and makes shape recognition more accurate and efficient. However, the time complexity of a sequential shape recognition algorithm using attribute grammar is <em>O</em>(<em>n</em><sup>3</sup>) where <em>n</em> is the length of an input string. When the problem size is very large, it needs much more computing time; therefore, a high-speed parallel shape recognition algorithm is necessary to meet the demands of some real-time applications. This paper presents a parallel shape recognition algorithm, and also discusses the algorithm partition problem as well as its implementation on a fixed-size VLSI architecture. The proposed algorithm has time complexity <em>O</em>(<em>n</em><sup>3</sup>/<em>k</em><sup>2</sup>) if using <em>k</em> × <em>k</em> processing elements. When <em>k</em> = <em>n</em>, its time complexity is <em>O</em>(<em>n</em>). The experiment has been conducted to verify the performance of the proposed algorithm. The correctnes of the algorithm partition and the behavior of proposed VLSI architecture have also been proved through the experiment. The results indicate that the proposed algorithm and the VLSI architecture could be very useful to imaging processing, pattern recognition, and related areas, especially for real-time applications.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 1","pages":"Pages 35-59"},"PeriodicalIF":0.0,"publicationDate":"1994-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90004-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136853338","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}