In this paper, a simulation of neural network controller for a three links robot arm is presented. The network is based on modified Kohonen's self-organizing map. In the proposed model, recurrent network and modif...
详细信息
Agents have been touted as a very promising technology that have inspired many researchers around the world to develop prototype systems that seem to change the way software works. With major organizations involved in...
详细信息
Agents have been touted as a very promising technology that have inspired many researchers around the world to develop prototype systems that seem to change the way software works. With major organizations involved in...
详细信息
Agents have been touted as a very promising technology that have inspired many researchers around the world to develop prototype systems that seem to change the way software works. With major organizations involved in projects that utilize agents as solutions, it is believed that agents may have the potential to be part of everyday life in the future. This paper briefly discusses the implementation of multi-agents in university timetabling where agents have to communicate with each other in order to produce a good timetable.
In this paper we address the decomposition problem of electromyographic signals (EMG) and we present a new idea for the decomposition approach introducing the time-scale phase representation. Considering the nature of...
详细信息
In this paper we address the decomposition problem of electromyographic signals (EMG) and we present a new idea for the decomposition approach introducing the time-scale phase representation. Considering the nature of EMG signals, a special set of nonorthogonal conjugated basis functions is used to perform the time-scale analysis. Mapping the modified signal phase into the time-scale phase plane is applied. Its minimization leads towards a very good time localization of individual superimposed signal components.
作者：
MORIMOTO, KIRIGUCHI, HAOE, JMemberFaculty of Engineering
Tokushima University Tokushima Japan 770 Jun-ichi Aoe received his B.E. and M.E. degrees in 1974 and 1976
respectively from Tokushima Univ. where he was a Research Associate in the Dept. Inf. Fac. Eng. received his Ph.D. later. Presently Prof. Intel. Inf. He is engaged in research on compiler generation system and highly efficient pattern matching algorithm. Presently interestedin natural language processing especially understanding system. He is the author of “Computer Algorithms- Key Search Strategies” IEEE CS Press. Best Author Award 1992 Inf. Proc. Soc. Member Inf. Proc. Soc. Jap. Soc. Artif. Intel. Jap. Software Sci. Jap. Jap. Soc. Mach. Transl. IEEE ACM and AAAI.
The trie has the feature that the retrieval can be executed with the character symbols composing the key as the unit, and a high-speed retrieval is realized independently of the total number of keys. Consequently, it ...
详细信息
The trie has the feature that the retrieval can be executed with the character symbols composing the key as the unit, and a high-speed retrieval is realized independently of the total number of keys. Consequently, it used frequently in the search of the natural language dictionary and in other problems. A problem, however, is that the number of trie states increases with the enlargement of the key set, which necessitates a larger memory capacity. To remedy this point, DAWG (Directed Acyclic Word-Graph) is proposed, where the common suffix of the tries is compressed. Then, a new problem arises in that the record information cannot be determined uniquely for the key. For this problem, this paper introduces a new structure, where the number of states is reduced by merging the common suffixes of the tries, while determining uniquely the record information for the key. The algorithm for retrieval, insertion and deletion of the key is proposed for the structure. In the proposed method, the set of keys is represented using two tries. One of the tries memorizes the prefix of the minimum length that can discriminate uniquely between the key from other keys. The other trie stores the suffixes of the remaining keys in order to merge the common suffix. A simulation is executed for various sets of keys such as Chinese character called Kanji, alphabets and Japanese Katakana characters, and it is seen that the number of states is reduced by approximately 30 to 65 percent for the key set of 50,000 words, compared to the ordinary trie.
暂无评论