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

筛选
英文 中文
An intelligent landing controller for a simulated running jointed leg 一种模拟跑步关节腿的智能着地控制器
P. Doerschuk, Qing Lin
{"title":"An intelligent landing controller for a simulated running jointed leg","authors":"P. Doerschuk, Qing Lin","doi":"10.1109/IJSIS.1998.685449","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685449","url":null,"abstract":"Controlling the running movement of a machine with jointed legs is a difficult problem in robotics. The control of a single running stride can be broken down into three phases: takeoff, ballistic, and landing. The paper describes the development of an intelligent controller for the landing phase of a simulated jointed leg's running stride. The landing controller takes control when the foot touches the ground after the airborne ballistic phase of the stride. It learns from experience to control the leg so as to recover from the impact with the ground and to reposition the leg for the takeoff of the next running stride, Very accurate control is achieved even during the first attempt at the running stride.","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":"123529986","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
Neural techniques for image segmentation 图像分割的神经技术
M. Marsella, S. Miranda
{"title":"Neural techniques for image segmentation","authors":"M. Marsella, S. Miranda","doi":"10.1109/IJSIS.1998.685477","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685477","url":null,"abstract":"We present new neural techniques including unsupervised technology and fuzzy logic foundations. We realized a hybrid neural network and applied three different unsupervised learning algorithms that we developed specially for it: fuzzy MLSOM, fuzzy hierarchical \"neural gas\" and fuzzy hierarchical \"maximum entropy\". The experiments presented deal with image segmentation. The results obtained show that neural networks are a valid instrument for image processing and shape recognition.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"102 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":"117274803","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}
引用次数: 5
Directing the structure of matter through DNA nanotechnology 通过DNA纳米技术来指导物质结构
N. Seeman
{"title":"Directing the structure of matter through DNA nanotechnology","authors":"N. Seeman","doi":"10.1109/IJSIS.1998.685432","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685432","url":null,"abstract":"The sticky-ended association of DNA molecules occurs with high specificity, and it results in the formation of B-DNA, whose structure is well known. The use of stable branched DNA molecules permits one to make stick-figures. We have used this strategy to construct a covalently closed DNA molecule whose helix axes have the connectivity of a cube, and a second molecule, whose helix axes have the connectivity of a truncated octahedron. In addition to branching topology, DNA also affords control of linking topology, because double helical half-turns of B-DNA or Z-DNA can be equated, respectively, with negative or positive crossings in topological objects. Consequently, we have been able to use DNA to make trefoil knots of both signs and figure-8 knobs. DNA-based topological control has also led to the construction of Borromean rings. The key feature previously lacking in DNA construction has been a rigid molecule. We have discovered that antiparallel DNA double crossover molecules can provide this capability.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"31 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":"115168163","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
Clustering of chromosome fluorescence profiles by self-organising map using chromosome physical models 利用染色体物理模型的自组织图谱对染色体荧光谱进行聚类
S. Hara, H. Douzono, S. Eishima, H. Tokushima, Y. Noguchi
{"title":"Clustering of chromosome fluorescence profiles by self-organising map using chromosome physical models","authors":"S. Hara, H. Douzono, S. Eishima, H. Tokushima, Y. Noguchi","doi":"10.1109/IJSIS.1998.685425","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685425","url":null,"abstract":"The clustering by the self-organizing map algorithm of chromosome profiles measured by slit-scan flowcytometer is proposed. Moreover, the physical models of chromosomes have been introduced in order to take into account the rotation of chromosomes in the flowcytometer. The self-organizing map algorithm has been improved so that it can modify the characteristic parameters of chromosome physical models. By this modification, the lengths of chromosomes and the intensity distribution of chromosome fluorescence can be estimated from chromosome profile data measured by the flowcytometer. The estimated lengths of chromosomes have been almost equal to known values of the lengths of chromosomes. The clustering results by the above method have been compared with the clustering results of the same data by K-mean method and an agglomerative hierarchical clustering.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"201 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":"134179020","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}
引用次数: 5
An efficient heuristic-based evolutionary algorithm for solving constraint satisfaction problems 一种求解约束满足问题的高效启发式进化算法
V. Tam, Peter James Stuckey
{"title":"An efficient heuristic-based evolutionary algorithm for solving constraint satisfaction problems","authors":"V. Tam, Peter James Stuckey","doi":"10.1109/IJSIS.1998.685421","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685421","url":null,"abstract":"GENET and EGENET are artificial neural networks with remarkable success in solving hard constraint satisfaction problems (CSPs) such as car sequencing problems. (E)GENET uses the min-conflict heuristic in variable updating to find local minima, and then applies heuristic learning rule(s) to escape the local minima not representing solution(s). In this paper we describe a micro-genetic algorithm (MGA) which generalizes the (E)GENET approach for solving CSPs efficiently. Our proposed MGA integrates the min-conflict heuristic into mutation for reassigning allels (values) to genes (variables). In addition, we derive two methods, based on general principles from evolutionary algorithms, for escaping local minima: population based learning, and look forward. Our preliminary experimental results showed that this evolutionary approach improved on EGENET in solving certain hard instances of CSPs.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"67 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":"127626875","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
Missing data estimation by separable deblurring 基于可分离去模糊的缺失数据估计
H. Qi, W. Snyder, G. Bilbro
{"title":"Missing data estimation by separable deblurring","authors":"H. Qi, W. Snyder, G. Bilbro","doi":"10.1109/IJSIS.1998.685473","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685473","url":null,"abstract":"Today's technology allows butting a few sensor arrays to a high precision in order to capture a two-dimensional image of large area. The most serious defect caused by this butting technique is the gap between sub-arrays. This paper proposes an image restoration method to recover the missing data using the information of blur. We claim that by making a reasonable assumption that the blur in real world is usually Gaussian blur, we can take advantage of the separability property of Gaussian kernel to separate the deblurring process, and recover the missing data during the separated deblurring. We also prove that the problem is well-conditioned, and the algorithm we used is backward-stable. Experimental results are provided.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"105 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":"121145533","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}
引用次数: 5
Robust speech recognition using a noise rejection approach 使用噪声抑制方法的鲁棒语音识别
E. Khan, R. Levinson
{"title":"Robust speech recognition using a noise rejection approach","authors":"E. Khan, R. Levinson","doi":"10.1109/IJSIS.1998.685469","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685469","url":null,"abstract":"In this paper, we explore some new approaches to improve speech recognition accuracy in a noisy environment. The key approaches taken are: (a) use no additional data (i.e. use only speakers data, no data for noise) for training and (b) no adaptation phase for noise. Instead of making adaptation in the recognition, preprocessing or both stages, we make a noise tolerant (rejection) speech recognition system where the system tries to reject noise automatically because of its inherent structure. We call our approach a noise rejection-based approach. Noise rejection is achieved by using multiple views and dynamic features of the input sequences. Multiple views exploit more information from the available data that is used for training multiple HMMs (hidden Markov models). This makes the training process simpler, faster and avoids the need to use a noise database, which is often difficult to obtain. The dynamic features (added to the HMM using vector emission probabilities) add more information about the input speech during training. Since the values of dynamic features of noise are usually much smaller than that of the speech signal, it helps reject the noise during recognition. Also, multiple views of the input sequence are applied to multiple HMMs during recognition and the outcome of the multiple HMMs are combined using maximum evidence criterion. Our tests show very encouraging results. We also incorporate higher level decision making to more judiciously combine the outcomes of the multiple HMMs to further improve the accuracy. For this, we use meta reasoning to identify the problem complexity and accordingly allocate resources.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"104 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":"117186581","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}
引用次数: 2
Compositional preferences in quadruplets of nearest neighbor residues in protein structures: statistical geometry analysis 蛋白质结构中最近邻残基四联体的成分偏好:统计几何分析
I. Vaisman, Alexander Tropsha, Weifan Zheng
{"title":"Compositional preferences in quadruplets of nearest neighbor residues in protein structures: statistical geometry analysis","authors":"I. Vaisman, Alexander Tropsha, Weifan Zheng","doi":"10.1109/IJSIS.1998.685437","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685437","url":null,"abstract":"The 3D structure and amino acid sequence of proteins are related by an unknown set of rules that is often referred to as the folding code. This code is believed to be significantly influenced by nonlocal interactions between the residues. A quantitative description of nonlocal contacts requires the identification of neighboring residues. We applied statistical geometry approach to analyze the patterns of spatial proximity of residues in known protein structures. Structures from a dataset of well resolved nonhomologous proteins with a single point representation of residues by C/sub /spl alpha// atoms were tessellated using Delaunay algorithm. Compositional analysis of Delaunay simplices reveals highly nonrandom clustering of amino acid residues in protein structures. Results of the analysis are implemented in algorithms for protein structure classification and prediction.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"5 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":"114954245","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}
引用次数: 30
Synthesis of consecutive free navigation spaces using a 2-D binary image approach 利用二维二值图像方法合成连续自由导航空间
M. Dou, N. Bourbakis
{"title":"Synthesis of consecutive free navigation spaces using a 2-D binary image approach","authors":"M. Dou, N. Bourbakis","doi":"10.1109/IJSIS.1998.685461","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685461","url":null,"abstract":"A methodology is presented for the generation of a 2-D map from an unknown navigation environment. The methodology proposed here is based on the synthesis of the knowledge extracted from consecutive free navigation spaces, during the movement of an autonomous mobile robot. The space map is represented by binary images. Computer simulation results for the generation of a space map with obstacles are presented as well.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"5 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":"114141325","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
Computational modeling and prediction of the human immunodeficiency virus (HIV) strains 人类免疫缺陷病毒(HIV)株的计算建模和预测
G.B. Singh
{"title":"Computational modeling and prediction of the human immunodeficiency virus (HIV) strains","authors":"G.B. Singh","doi":"10.1109/IJSIS.1998.685423","DOIUrl":"https://doi.org/10.1109/IJSIS.1998.685423","url":null,"abstract":"This paper describes a stochastic approach for modeling the changes observed in the DNA sequence of a highly mutating virus, such as the human immunodeficiency virus (HIV). This modeling process is begun by clustering the known DNA sequences from the virus population into groups such that the individual clusters represent biological strains of the modeled virus. Next, a hidden Markov model (HMM) is associated with each cluster, and its parameters computed using Baum-Welch's expectation maximization procedure. In this manner, the sequences within a cluster represent a maximally likely random sample drawn from the learned HMM. After the HMM for each strain cluster has thus been learned, it can further be used to generate additional samples of viral DNA sequences that are expected from the same underlying HMM. These newly predicted sequences would represent a maximally likely set of sequences belonging to a given viral strain modeled by the underlying HMM.","PeriodicalId":289764,"journal":{"name":"Proceedings. IEEE International Joint Symposia on Intelligence and Systems (Cat. No.98EX174)","volume":"39 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":"126448110","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学术官方微信