Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)最新文献

筛选
英文 中文
Learning feature weights for similarity using genetic algorithms 使用遗传算法学习相似度的特征权重
N. Ishii, Yong Wang
{"title":"Learning feature weights for similarity using genetic algorithms","authors":"N. Ishii, Yong Wang","doi":"10.1109/IJSIS.1998.685412","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685412","url":null,"abstract":"This paper presents a GA-based method for learning feature weights in a similarity function from similarity information. The similarity information can be divided into two kinds: one is called qualitative similarity information which represents the similarities between cases; and the other is called relative similarity information which represents the relation between similarities of two case pairs both including a same case. We apply genetic algorithms to learn feature weights from these similarity information. The proposed genetic algorithms are applicable to both linear and nonlinear similarity functions. Our experiments show the learning results are better even if the given similarity information includes errors.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134291815","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}
引用次数: 7
Biologically-based learning in the ARBIB autonomous robot 基于生物学的ARBIB自主机器人学习
R. Damper, T. W. Scutt
{"title":"Biologically-based learning in the ARBIB autonomous robot","authors":"R. Damper, T. W. Scutt","doi":"10.1109/IJSIS.1998.685416","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685416","url":null,"abstract":"We describe the autonomous robot ARBIB, which uses biologically-motivated forms of learning to adapt to its environment. The \"nervous system\" of ARBIB has a nonhomogeneous population of spiking neurons, and uses both nonassociative (habituation, sensitization) and associative (classical conditioning) forms of learning to modify pre-existing (\"hard-wired\") reflexes. As a result of interaction with its environment, interesting and \"intelligent\" light-seeking and collision-avoidance behaviors emerge which were not pre-programmed into the robot-or \"animat\". These behaviors are similar to those described by other workers who have generally used behaviorally-motivated reinforcement learning rather than biologically-based associative learning. The complexity of observed behavior is remarkable given the extreme simplicity of ARBIB's \"nervous system\", having just 33 neurons. It does not even have a brain! We take this to indicate that great potential exists to explore further \"the animat path to AI\".","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125686824","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}
引用次数: 4
Algorithms for splicing junction donor recognition in genomic DNA sequences 基因组DNA序列剪接结供体识别算法
M. Yin, J.T.L. Wang
{"title":"Algorithms for splicing junction donor recognition in genomic DNA sequences","authors":"M. Yin, J.T.L. Wang","doi":"10.1109/IJSIS.1998.685439","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685439","url":null,"abstract":"The consensus sequences at splicing junctions in genomic DNA are required for pre-mRNA breaking and rejoining which must be carried out precisely. Programs currently available for identification or prediction of transcribed sequences from within genomic DNA are far from being powerful enough to elucidate genomic structure completely. In this paper, we develop pattern matching algorithms for 5' splicing site (donor site) recognition. Using the Motif models we develop, we can extract the degenerate pattern information from the consensus splicing junction sequences. The experimental results show that, our algorithm could correctly recognize 93% of the total donor sites at the right positions in the test DNA group. Furthermore, more than 91% of the donor sites were correctly predicted by our algorithm. These precision rates are higher than the best existing donor classification algorithm.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132306215","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}
引用次数: 10
Towards a DNA solution to the shortest common superstring problem 用DNA来解决最短的常见超弦问题
G. Gloor, L. Kari, M. Gaasenbeek, Sheng Yu
{"title":"Towards a DNA solution to the shortest common superstring problem","authors":"G. Gloor, L. Kari, M. Gaasenbeek, Sheng Yu","doi":"10.1109/IJSIS.1998.685431","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685431","url":null,"abstract":"This paper proposes a DNA algorithm for solving an NP-complete problem (the shortest common superstring problem) by manipulation of biomolecules, and presents partial results of the experiment that implements our algorithm. We also discuss practical constraints that have to be taken into account when implementing the algorithm, propose a coding system as a solution to these practical restrictions, and discuss the control experiments performed for establishing the parameters controlling the specificity of the assay.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114705529","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}
引用次数: 20
Natural language sensing for autonomous agents 自主智能体的自然语言感知
Zhaohua Zhang, S. Franklin, B. Olde, A. Graesser, Yun Wan
{"title":"Natural language sensing for autonomous agents","authors":"Zhaohua Zhang, S. Franklin, B. Olde, A. Graesser, Yun Wan","doi":"10.1109/IJSIS.1998.685479","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685479","url":null,"abstract":"In sufficiently narrow domains, natural language understanding may be achieved via an analysis of surface features without the use of a traditional symbolic parser. We illustrate this notion by describing the natural language sensing in Virtual Mattie (VMattie), an autonomous clerical agent. VMattie \"lives\" in an UNIX system, communicates with humans via e-mail in natural language with no agreed upon protocol, and autonomously carries out her tasks without human intervention. VMattie's limited domain allows for surface level natural language processing. VMattie's language understanding module has been implemented as a copycat-like architecture though her understanding takes place differently. The mechanism includes a slipnet storing domain knowledge and a pool of codelets templates for building and verifying understanding. We describe the design and implementation of natural language sensing for autonomous agents such as VMattie.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129761931","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}
引用次数: 39
Texel: a methodology and an integrated environment for developing automated systems for texture classification Texel:一种用于开发自动纹理分类系统的方法和集成环境
R. M. Sanchez, F.C. Espinosa
{"title":"Texel: a methodology and an integrated environment for developing automated systems for texture classification","authors":"R. M. Sanchez, F.C. Espinosa","doi":"10.1109/IJSIS.1998.685480","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685480","url":null,"abstract":"The techniques used when building a texture classification system are determined, in most cases, ad hoc. For developing such a system, the most commonly used sequence of steps is: acquisition, preprocessing, feature extraction and classification. For each of them, there exist many options, and the choice of one or more of them influences the rest. The expert has to choose among several kinds of preprocessing tasks, a number of texture analysis methods, and several classifiers. The process of getting a system that provides a good performance is a costly procedure due to the great variety of combinations of processing tasks. In this paper we introduce a methodology for the construction of texture classification systems, primarily focused in natural, random or pseudorandom textures, and a visual tool with a powerful interface that allows us to put it into practice.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127298821","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}
引用次数: 3
Genetic algorithms in a multi-agent system 多智能体系统中的遗传算法
J.-P. Vacher, T. Galinho, F. Lesage, A. Cardon
{"title":"Genetic algorithms in a multi-agent system","authors":"J.-P. Vacher, T. Galinho, F. Lesage, A. Cardon","doi":"10.1109/IJSIS.1998.685410","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685410","url":null,"abstract":"Determining an optimal solution is almost impossible but trying to improve an existing solution is a way to lead to a better scheduling. We use a multi-agent system guided by a multiobjective genetic algorithm to find a balance point with respect to a solution of the Pareto front. This solution is not the best one but it allows a multicriteria optimization. By crossover and mutation of agents, according to their fitness function, we improve an existing solution. Therefore, the construction of some system simulating living organisms or social systems, cannot be modelled using a strictly mechanical approach. They are typically adaptive and their behaviour is not regular. The multi-agent system must express radical characters, such as reification of emergence, the property of controlled self-reproduction of groups of agents and not linear behaviour.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129988221","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}
引用次数: 29
Coordinated planning and control of multiple robots and machines for surface-mount manufacturing 表面贴装制造中多个机器人和机器的协调规划和控制
J. S. Gyorfi, Chi-haur Wu
{"title":"Coordinated planning and control of multiple robots and machines for surface-mount manufacturing","authors":"J. S. Gyorfi, Chi-haur Wu","doi":"10.1109/IJSIS.1998.685459","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685459","url":null,"abstract":"A general two-phase coordinated planning and control algorithm is developed to determine optimal motions among obstacles and dynamic objects in a shared environment. The algorithm consists of a two-phase approach: planning a global path for each object subject to the constraints of the workspace and then locally optimizing along each global path to minimize some process dependent cost function. The order in which objects are planned will also affect the overall performance of the system. The algorithm is applied to a simulated surface-mount assembly system. The results show an improvement over other planning and control methods.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130025445","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}
引用次数: 0
Robust total least squares by the nonlinear MCA EXIN neuron 非线性MCA EXIN神经元鲁棒总最小二乘
G. Cirrincione, M. Cirrincione
{"title":"Robust total least squares by the nonlinear MCA EXIN neuron","authors":"G. Cirrincione, M. Cirrincione","doi":"10.1109/IJSIS.1998.685463","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685463","url":null,"abstract":"The robust version of the MCA EXIN linear neuron is introduced in order to solve typical minor component problems as the total least squares fitting in presence of impulsive and colored noise environments or in presence of outliers, i.e. in nonoptimal conditions for the traditional approaches. Furthermore, an analysis of the divergence of the robust neurons is made. The simulations show the better features of the NMCA EXIN neuron w.r.t. the existing nonneural and neural approaches, even in the case of high Gaussian noise together with strong outliers. This allows the use of this neuron for some very difficult problems, like in computer vision, just giving the possibility of massively high parallel architectures.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131948402","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}
引用次数: 6
Connecting perception and action by associating symmetries in vision and language 通过联想视觉和语言的对称性来连接感知和行动
D. P. Benjamin
{"title":"Connecting perception and action by associating symmetries in vision and language","authors":"D. P. Benjamin","doi":"10.1109/IJSIS.1998.685466","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685466","url":null,"abstract":"Symmetries are of fundamental importance in information processing. It is well understood how important visual symmetries are in the understanding of scenes. This paper explores the symmetries of languages of actions, and relates them to visual symmetries. Linguistic symmetry is explored in the context of problem solving. Algebraic techniques permit the representation and manipulation of linguistic symmetry, and the exploration of its connection to perceptual symmetry. It is shown that the invariants of the decomposition of a language of actions form a complete and independent set of perceptual features that naturally describe the search space.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130465975","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信