Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416611
P. Maji, S. K. Patra, K. Mahapatra
A Fuzzy Logic Controller (FLC) is designed with heuristic knowledge of the plant. There are several application based Fuzzy Logic Controllers in literature. However, application specific controllers lack reusability and are expensive, if not produced in bulk. This paper presents a general purpose and easily configurable fuzzy logic based controller which can work with 4 inputs and generates a control action based on the knowledge base. Expert operator knowledge can also be directly programmed into the knowledge base (also known as rule base) of the designed controller without ceasing the control operation. The ease of file handling and user interactivity of DSP processors is heavily exploited and TMS320C6713 DSP was chosen as the hardware platform. Further this paper also analyses the system performance with reference to the Fuzzy Logic Toolbox of Matlab.
{"title":"Design of Fuzzy Logic Controller based on TMS320C6713 DSP","authors":"P. Maji, S. K. Patra, K. Mahapatra","doi":"10.1109/ISDA.2012.6416611","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416611","url":null,"abstract":"A Fuzzy Logic Controller (FLC) is designed with heuristic knowledge of the plant. There are several application based Fuzzy Logic Controllers in literature. However, application specific controllers lack reusability and are expensive, if not produced in bulk. This paper presents a general purpose and easily configurable fuzzy logic based controller which can work with 4 inputs and generates a control action based on the knowledge base. Expert operator knowledge can also be directly programmed into the knowledge base (also known as rule base) of the designed controller without ceasing the control operation. The ease of file handling and user interactivity of DSP processors is heavily exploited and TMS320C6713 DSP was chosen as the hardware platform. Further this paper also analyses the system performance with reference to the Fuzzy Logic Toolbox of Matlab.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129916882","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416505
B. Stilman
In 1957 J. von Neumann introduced the Primary Language when he suggested that the languages we use are just external languages while the Primary Language is the only internal language of the human brain. Due to its age this cannot be symbolic. Instead, this must be a system of hybrid and mostly analog algorithms embedded in the human brain. This paper reports results of research on two possible components of the Primary Language, Linguistic Geometry (LG) and the Algorithm of Discovery. LG is a type of game theory for a class of extensive discrete games called Abstract Board Games (ABG), scalable to the level of real life defense systems. LG is an evolutionary product of millions of years of human warfare. It appears that LG is a formal model of human reasoning about armed conflict, a mental reality “hard-wired” in the human brain. Experiences of development of LG were utilized for solving major puzzle, discovering the Algorithm of Discovery, which must be another ancient component of the Primary Language. The major emphasis of his paper is on the results of investigation of the mental processes called visual streams that manifest execution of this algorithm. It reveals the various types of visual streams, the way of focusing those streams and constructing new streams. It particular it reveals the relationship of visual streams and mathematical proofs.
1957年，冯·诺依曼提出，我们使用的语言只是外部语言，而主要语言是人类大脑唯一的内部语言。由于它的年代久远，它不可能是象征性的。相反，这一定是一个嵌入人脑的混合和模拟算法系统。本文报告了语言几何(LG)和发现算法(Algorithm of Discovery)这两个可能构成主要语言的组成部分的研究结果。LG是一类被称为抽象棋盘游戏(ABG)的广泛离散游戏的一种博弈论，可扩展到现实生活防御系统的水平。LG是人类数百万年战争的进化产物。LG似乎是人类对武装冲突进行推理的正式模型，是人类大脑中“根深蒂固”的精神现实。LG的开发经验被用于解决重大难题，发现发现算法，这一定是原始语言的另一个古老组成部分。他的论文的主要重点是对显示该算法执行的称为视觉流的心理过程的调查结果。它揭示了各种类型的视觉流，聚焦这些流和构建新流的方法。特别是它揭示了视觉流和数学证明的关系。
{"title":"Discovering components of the Primary Language","authors":"B. Stilman","doi":"10.1109/ISDA.2012.6416505","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416505","url":null,"abstract":"In 1957 J. von Neumann introduced the Primary Language when he suggested that the languages we use are just external languages while the Primary Language is the only internal language of the human brain. Due to its age this cannot be symbolic. Instead, this must be a system of hybrid and mostly analog algorithms embedded in the human brain. This paper reports results of research on two possible components of the Primary Language, Linguistic Geometry (LG) and the Algorithm of Discovery. LG is a type of game theory for a class of extensive discrete games called Abstract Board Games (ABG), scalable to the level of real life defense systems. LG is an evolutionary product of millions of years of human warfare. It appears that LG is a formal model of human reasoning about armed conflict, a mental reality “hard-wired” in the human brain. Experiences of development of LG were utilized for solving major puzzle, discovering the Algorithm of Discovery, which must be another ancient component of the Primary Language. The major emphasis of his paper is on the results of investigation of the mental processes called visual streams that manifest execution of this algorithm. It reveals the various types of visual streams, the way of focusing those streams and constructing new streams. It particular it reveals the relationship of visual streams and mathematical proofs.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124964583","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416580
G. Padmavathi, P. V. S. Kumar
In this paper mathematical analysis of hysteresis neural network with varying inputs are proposed. Motivated by the application potential of the model we focus on existence, exponential stability and asymptotic equivalence of the networks. We establish sufficient conditions for exponential stability of this class of neural networks and this result can be applied through numerical example. The result improves the earlier publications due to the state convergence of the networks with neutral delays and varying inputs.
{"title":"Exponential stability of hysteresis neural networks with varying inputs","authors":"G. Padmavathi, P. V. S. Kumar","doi":"10.1109/ISDA.2012.6416580","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416580","url":null,"abstract":"In this paper mathematical analysis of hysteresis neural network with varying inputs are proposed. Motivated by the application potential of the model we focus on existence, exponential stability and asymptotic equivalence of the networks. We establish sufficient conditions for exponential stability of this class of neural networks and this result can be applied through numerical example. The result improves the earlier publications due to the state convergence of the networks with neutral delays and varying inputs.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123189407","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416552
Ondrej Malacka, J. Samek, F. Zboril, F. Zboril
Different trust models have arisen in the last few years. Most of them use the highest trust level selection method to choose an entity for an interaction. But the selection based on some probability method could meet some criteria, e.g. giving an opportunity to newcomers to participate even if there are already trustworthy entities in the system etc. This article is focused on experimental comparison of the highest trust level selection and the roulette wheel selection.
{"title":"Case study: Different approaches and their aspects for partner selection based on trust","authors":"Ondrej Malacka, J. Samek, F. Zboril, F. Zboril","doi":"10.1109/ISDA.2012.6416552","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416552","url":null,"abstract":"Different trust models have arisen in the last few years. Most of them use the highest trust level selection method to choose an entity for an interaction. But the selection based on some probability method could meet some criteria, e.g. giving an opportunity to newcomers to participate even if there are already trustworthy entities in the system etc. This article is focused on experimental comparison of the highest trust level selection and the roulette wheel selection.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690330","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416527
V. Sakalauskas, D. Kriksciuniene
The researchers working in the area of financial market investigations have noticed various anomalies which cause deviations from the most widely discussed laws of the financial markets - the efficient market hypothesis. The day-of-the-week effect is one of the types of financial market anomalies, when the particular days of the week have exclusive characteristics of trading activeness or the profitability of the stocks. In this article we explore possibilities to identify the day-of-the-week effect in emerging financial markets by applying Hurst exponent measure which is primarily designed for identification and measurement of long range dependence and information efficiency of time series.
{"title":"Evaluation the day-of-the-week effect using long range dependence measures","authors":"V. Sakalauskas, D. Kriksciuniene","doi":"10.1109/ISDA.2012.6416527","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416527","url":null,"abstract":"The researchers working in the area of financial market investigations have noticed various anomalies which cause deviations from the most widely discussed laws of the financial markets - the efficient market hypothesis. The day-of-the-week effect is one of the types of financial market anomalies, when the particular days of the week have exclusive characteristics of trading activeness or the profitability of the stocks. In this article we explore possibilities to identify the day-of-the-week effect in emerging financial markets by applying Hurst exponent measure which is primarily designed for identification and measurement of long range dependence and information efficiency of time series.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123060016","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416625
Samar M. Alkhuraiji, B. Cheetham, M. A. Razek, Omaima Bamasak
This paper describes our approach to build a dynamic adaptive course in learning management systems based on students' learning styles. Our method aims to adapt the student's learning style by taking the advantage of the previous students taught the same course. To achieve this goal, we present an approach for adaptivity by taking the advantage of information that can be taken from previous students' data record to find similarity between the students. Based on this similarity we can find the next suitable learning style for the current students.
{"title":"A flexible approach for providing adaptivity in learning management system based on learning styles","authors":"Samar M. Alkhuraiji, B. Cheetham, M. A. Razek, Omaima Bamasak","doi":"10.1109/ISDA.2012.6416625","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416625","url":null,"abstract":"This paper describes our approach to build a dynamic adaptive course in learning management systems based on students' learning styles. Our method aims to adapt the student's learning style by taking the advantage of the previous students taught the same course. To achieve this goal, we present an approach for adaptivity by taking the advantage of information that can be taken from previous students' data record to find similarity between the students. Based on this similarity we can find the next suitable learning style for the current students.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130004250","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416550
A. Choudhury, A. Agrawal, Priyanka Sinha, C. Bhaumik, Avik Ghose, S. Bilal
This paper describes a system for predicting water logging prone areas in multiple routes. The approach is based on the theory that water tends to accumulate in low-lying areas and hence a route which contains more and bigger basins is more likely to behave worse on a rainy day. Using this basic principle, algorithms are formulated and applied to identify and quantify water logging zones on a route. To prove the effectiveness of the proposed system, the derived confidence scores for multiple routes given by the system are compared to judgements given by human commuters. A view of all possible routes along with quantified estimates of waterlogging confidence scores are rendered in Google map.
{"title":"A methodology for GPS-based waterlogging prediction and smart route generation","authors":"A. Choudhury, A. Agrawal, Priyanka Sinha, C. Bhaumik, Avik Ghose, S. Bilal","doi":"10.1109/ISDA.2012.6416550","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416550","url":null,"abstract":"This paper describes a system for predicting water logging prone areas in multiple routes. The approach is based on the theory that water tends to accumulate in low-lying areas and hence a route which contains more and bigger basins is more likely to behave worse on a rainy day. Using this basic principle, algorithms are formulated and applied to identify and quantify water logging zones on a route. To prove the effectiveness of the proposed system, the derived confidence scores for multiple routes given by the system are compared to judgements given by human commuters. A view of all possible routes along with quantified estimates of waterlogging confidence scores are rendered in Google map.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128007458","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416509
Rui Maciel Casanova Pinto, João Silva
This study focuses on the negotiation in the financial markets, specifically in programming an algorithm to trade automatically (without human intervention) in the foreign exchange market (Forex). The platform used in this study was the Meta Trader (version 5), which allows for this kind of negotiation. The main objective was to conclude about the effectiveness of a newly developed strategy for automatic negotiation. The developed strategies must have the ability to identify situations with lucrative potential based on several types of trading strategies used around the world. Methods were created based on technical and fundamental analysis as well as correlations. Fundamental analysis, in particular, is a novelty in this type of algorithms since, most part of the times, it is hard to quantify the information necessary to make decisions based on this type of analysis. Moreover, some other functions were developed in order to optimize the overall performance of the implemented strategies.
{"title":"Strategic methods for automated trading in Forex","authors":"Rui Maciel Casanova Pinto, João Silva","doi":"10.1109/ISDA.2012.6416509","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416509","url":null,"abstract":"This study focuses on the negotiation in the financial markets, specifically in programming an algorithm to trade automatically (without human intervention) in the foreign exchange market (Forex). The platform used in this study was the Meta Trader (version 5), which allows for this kind of negotiation. The main objective was to conclude about the effectiveness of a newly developed strategy for automatic negotiation. The developed strategies must have the ability to identify situations with lucrative potential based on several types of trading strategies used around the world. Methods were created based on technical and fundamental analysis as well as correlations. Fundamental analysis, in particular, is a novelty in this type of algorithms since, most part of the times, it is hard to quantify the information necessary to make decisions based on this type of analysis. Moreover, some other functions were developed in order to optimize the overall performance of the implemented strategies.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228560","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416603
S. Pal, S. Chanda, U. Pal, K. Franke, M. Blumenstein
In the field of biometric authentication, automatic signature identification and verification has been a strong research area because of the social and legal acceptance and extensive use of the written signature as an easy method for authentication. Signature verification is a process in which the questioned signature is examined in detail in order to determine whether it belongs to the claimed person or not. Signatures provide a secure means for confirmation and authorization in legal documents. So nowadays, signature identification and verification becomes an essential component in automating the rapid processing of documents containing embedded signatures. Sometimes, part-based signature verification can be useful when a questioned signature has lost its original shape due to inferior scanning quality. In order to address the above-mentioned adverse scenario, we propose a new feature encoding technique. This feature encoding is based on the amalgamation of Gabor filter-based features with SURF features (G-SURF). Features generated from a signature are applied to a Support Vector Machine (SVM) classifier. For experimentation, 1500 (50×30) forgeries and 1200 (50×24) genuine signatures from the GPDS signature database were used. A verification accuracy of 97.05% was obtained from the experiments.
{"title":"Off-line signature verification using G-SURF","authors":"S. Pal, S. Chanda, U. Pal, K. Franke, M. Blumenstein","doi":"10.1109/ISDA.2012.6416603","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416603","url":null,"abstract":"In the field of biometric authentication, automatic signature identification and verification has been a strong research area because of the social and legal acceptance and extensive use of the written signature as an easy method for authentication. Signature verification is a process in which the questioned signature is examined in detail in order to determine whether it belongs to the claimed person or not. Signatures provide a secure means for confirmation and authorization in legal documents. So nowadays, signature identification and verification becomes an essential component in automating the rapid processing of documents containing embedded signatures. Sometimes, part-based signature verification can be useful when a questioned signature has lost its original shape due to inferior scanning quality. In order to address the above-mentioned adverse scenario, we propose a new feature encoding technique. This feature encoding is based on the amalgamation of Gabor filter-based features with SURF features (G-SURF). Features generated from a signature are applied to a Support Vector Machine (SVM) classifier. For experimentation, 1500 (50×30) forgeries and 1200 (50×24) genuine signatures from the GPDS signature database were used. A verification accuracy of 97.05% was obtained from the experiments.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128602722","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416579
M. C. Nicoletti, F. Lisboa, Estevam Hruschka, Osvaldo Luiz De Oliveira
This paper describes a proposal which extends Allen's interval algebra by adapting the formalism for dealing with binary relations involving time periods with uncertain boundaries. The extended formalism has been proposed having in mind the subsequent investigation of the automatic learning of temporal relations using an inductive logic programming system (FOIL). Learning results are presented and discussed.
{"title":"Representation and automatic learning of temporal relations between time periods with uncertain boundaries","authors":"M. C. Nicoletti, F. Lisboa, Estevam Hruschka, Osvaldo Luiz De Oliveira","doi":"10.1109/ISDA.2012.6416579","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416579","url":null,"abstract":"This paper describes a proposal which extends Allen's interval algebra by adapting the formalism for dealing with binary relations involving time periods with uncertain boundaries. The extended formalism has been proposed having in mind the subsequent investigation of the automatic learning of temporal relations using an inductive logic programming system (FOIL). Learning results are presented and discussed.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"52 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128628436","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：