{"title":"A debugging tool for distributed systems","authors":"H. Scholten, J. Posthuma","doi":"10.1109/TENCON.1993.319956","DOIUrl":"https://doi.org/10.1109/TENCON.1993.319956","url":null,"abstract":"This paper describes parts of the design of a debugger for a distributed real-time multimedia system. Emphasis lies on the distributed aspect of debugging, which means that attention is paid to the external behaviour of the processes. This type of debugging is useful to find communication or synchronization errors. However, experience shows that this is not enough: the debugger must also provide hooks for the user to use traditional sequential debuggers. This type of debugging focuses on the internal behaviour - or internal logic - of processes. For the sequential debugging part a normal debugger like GDB can be taken. Three key elements of the debugger are events, filters and recognizers. By definition events are the lowest level of system activity that may be observed by the event debugger. Filters are applied to remove events from the stream of events produced by the debuggee that are of no interest for the programmer. Recognizers are used to recognize behaviour -right or wrong- of the system. By combining events, different levels of abstraction are introduced, thus alleviating the task of the programmer.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114472344","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}
{"title":"The union optimization method of multilayer perceptron","authors":"Chen Yongsheng, Liang Biqing, Y. Baozong","doi":"10.1109/TENCON.1993.320126","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320126","url":null,"abstract":"The backpropagation algorithm (BP) is one of the most popular algorithms in neural network studies, but it is notorious for its slowness in achieving convergence. Based on the theory of unconstrained optimization, the union optimization method (UOM) is presented. The method consists of two parts: apply Descent Method to optimize objective function E=/spl Sigmasub p/E/sub p/; when E</spl epsi/, apply conjugate gradient method to optimize objective function. Apply the UOM to train speech pattern, the experiment result shows the convergence speed of UOM is fourteen times faster than conventional BP algorithm.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121876597","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}
{"title":"The heuristic approach in IDSS for project planning and scheduling","authors":"D. GuiShi, He Yonghong","doi":"10.1109/TENCON.1993.320435","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320435","url":null,"abstract":"Classical project planning and scheduling techniques have been successful in project management. At the present, intelligent decision support systems (IDSS) have been proposed and applied in real world. We propose a heuristic approach in IDSS for project planning and scheduling and developed a synthesis system of project management and control decision support system (PMCDSS), which is an intelligent interactive computer-based system. In this paper we discuss the heuristic approach based on PMCDSS. The main ideas are: (1) Building an adaptive model (e.g. object-oriented modeling) to represent the multiobjective problem in project management. (2) The core of such model is resources allocation. (3) Domain knowledge representation and inference.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122185536","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}
{"title":"A reasoning system for on-line interpretation of ECG signal","authors":"M. Kundu, M. Nasipuri, D. Basu, A. Bhattacharya","doi":"10.1109/TENCON.1993.320109","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320109","url":null,"abstract":"The reasoning process for interpretation of arrhythmic abnormalities in electrocardiographic (ECG) signal is described through a production system. The control module is designed to take care of the production level parallelism and condition level parallelism in each match-resolve-act cycle and distributed between two agents. It works through a special domain dependent algorithm to speed up the inference procedure for on-line interpretation of the signal.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129609556","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}
{"title":"Sliding mode control of nonlinear uncertain systems using a sliding observer","authors":"H. Choi, H. K. Yi, M. Chung","doi":"10.1109/TENCON.1993.320517","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320517","url":null,"abstract":"In this paper, the problem of designing a tracking controller for uncertain nonlinear second-order SISO (single input single output) systems which can suppress the effects of both the model uncertainty and noisy measurements is considered. Based on the framework of linear systems with nonlinear uncertainties whose norm-bounds are known we construct not only a sliding mode controller but a sliding observer for uncertain nonlinear second-order SISO systems, and we show the robust stability of the closed-loop control system.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"1845 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129751285","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}
{"title":"The recognition of human faces by computer","authors":"Xiao Dunhe, Qian Guohui, Sang Enfang","doi":"10.1109/TENCON.1993.320203","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320203","url":null,"abstract":"Included are two main classes, i.e. frontal face and profile in face recognition. This paper describes the former class and represents a method of feature selection based on psychological test conclusions and K-L transformation to remove the correlativity of the original features, and a new discriminant criteria called Distance Fuzzy Diagnosis Maximum 1-NN, which solves the problem of error decision at the second or third place of order-ranked distance list in Minimum Distance Criteria. Through the identification of individual faces of seventy pictures and ten subject's facial image with different facial orientation, the correct accuracy achieves 97.5% and 90% respectively.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128635117","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}
{"title":"A machine-description table based instruction scheduler for improving pipeline execution parallelism on QHRC RISC system","authors":"L. Sanli, Fu Xinggang","doi":"10.1109/TENCON.1993.319917","DOIUrl":"https://doi.org/10.1109/TENCON.1993.319917","url":null,"abstract":"This paper presents a parameterized instruction scheduling algorithm based on machine description table for QHRC RISC system, having a 3-5 stage pipeline structure. It would provide considerable flexibility for instruction scheduling, improving execution efficiency for rapidly upgrading RISC machines. And, using this instruction scheduler as a tool, the effect of several methods for solving instruction interlock problem has been analysed. Finally, a high performance approach combining the hardware feasibility and software effectiveness for solving instruction interlock problem and enhancing pipeline execution parallelism is given.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129346975","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}
{"title":"Parallel programming at NASA/NAS","authors":"D. Cheng","doi":"10.1109/TENCON.1993.319938","DOIUrl":"https://doi.org/10.1109/TENCON.1993.319938","url":null,"abstract":"This paper describes parallel programming at NASA. After extensive survey and evaluation, we have decided to focus our design and development effort on tools that assist debugging and performance optimization, and tools that help data alignment and distribution. Meanwhile, we are actively participating programming language design and standardization. The Numerical Aerodynamic Simulation (NAS) Program at NASA Ames Research Center is a path-finder for high performance computing and communication at NASA. It has been providing vector-oriented supercomputers such as CRAY X-MP, YMP, and CRAY 2 for many years. In a few years, NAS will provide massively parallel computers in addition to traditional supercomputers for solving computational aeroscience grand challenge problems. NAS currently has an Intel iPSC/860, Paragon, CM5, CRAY C-90, and CRAY Y-MP with more massively parallel machines under consideration for procurement.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124710606","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}
{"title":"Comparison of soliton transmission schemes incorporating lumped fibre amplifiers","authors":"M.P. Chan, M. Demokan","doi":"10.1109/TENCON.1993.328032","DOIUrl":"https://doi.org/10.1109/TENCON.1993.328032","url":null,"abstract":"Soliton transmission through cascaded fibre amplifiers has attracted widespread attention recently. Two transmission schemes, namely, \"average soliton method\" and \"preemphasis method\", were proposed to propagate solitons through such a transmission link. We compare the two methods by studying the soliton propagation behavior along a number of optical amplifier stages. Numerical simulation has shown that the preemphasis method works reasonably well only under certain conditions and require relatively small amplifier spacings. If these conditions are violated, the preemphasis method leads to soliton deterioration. However, the average soliton method maintains quite good soliton transmission stability even when these conditions are somewhat relaxed. The distance between optical amplifiers in the latter method can be made considerably longer.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129132902","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}
{"title":"An ECFSM-based maximal progress protocol verification","authors":"Chung-Ming Huang, Jenq-Muh Hsu","doi":"10.1109/TENCON.1993.320042","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320042","url":null,"abstract":"A number of protocol verification reduction techniques were proposed in the past. Most of these techniques are suitable for verifying communicating protocols specified in the Communicating Finite State Machine (CFSM) model. However, it is impossible to formally specify communicating protocols with predicates and variables using the CFSM model. The Extended Communicating Finite State Machine (ECFSM) model, which incorporates the mechanism for representing variables and predicates, can formally model communicating protocols with variables and predicates. To have more efficient verification for ECFSM-specified protocols, we propose an integrated ECFSM-based global state reduction technique. This new method is based on two techniques: the dead variables analysis which can reduce the number of global states, and the ECFSM-based maximal progress state exploration which can speed up the global state reachability analysis. Using our new ECFSM-based method, the maximal progress protocol verification can be directly applied to the formal description techniques (FDTs) which are based on the extended state transition model, i.e., ISO's Estelle and CCITT's SDL.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129175420","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}