Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation最新文献

筛选
英文 中文
Distributed scheduling of tasks exempt of any timing failure 分布式调度的任务免除任何时间失败
Wang Guangzhao, Yu Zhishuo, Li Yan
{"title":"Distributed scheduling of tasks exempt of any timing failure","authors":"Wang Guangzhao, Yu Zhishuo, Li Yan","doi":"10.1109/TENCON.1993.320091","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320091","url":null,"abstract":"In the design of distributed computer systems, especially real time distributed systems the scheduling problem is considered to be an important one. First, the problem of testing feasibility for a set of time critical tasks that run on each node-processor machine locally has been studied. The acceptance tests and the scheduling algorithms are described as follows: scheduling sporadic tasks within idle times; scheduling periodic tasks as late as possible; scheduling periodic and sporadic tasks together. Second, the problem of tasks which haven't been executed locally in the node is studied. There are three algorithms for cooperation to be evaluated in the distributed system: the focused addressing algorithm; the bidding algorithm; the flexible algorithm. The results show that distributed scheduling is effective in a hard real time environment.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"287 1-2 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":"116856384","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
Real-time simulation algorithms of "generator-infinite busbar system" and transputer implementation “发电机-无限母线系统”实时仿真算法及计算机实现
P. Wang, B. Hogg, Z.Y. Chen
{"title":"Real-time simulation algorithms of \"generator-infinite busbar system\" and transputer implementation","authors":"P. Wang, B. Hogg, Z.Y. Chen","doi":"10.1109/TENCON.1993.320621","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320621","url":null,"abstract":"A real-time simulation model of a single generator-infinite busbar power system and its transputer implementation are described. Based on this model, real-time algorithms for solving differential equations are approached and a comparison is made among Tustin conversion, the ordinary trapezoidal method, the damping trapezoidal method and the underrelax iterative method. The last method is shown to be highly stable in solution for large simulation steps.<<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":"117092547","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
Image sub-band coding with inter-band predictions 带间预测的图像子带编码
J. Lin, S. Tai
{"title":"Image sub-band coding with inter-band predictions","authors":"J. Lin, S. Tai","doi":"10.1109/TENCON.1993.328010","DOIUrl":"https://doi.org/10.1109/TENCON.1993.328010","url":null,"abstract":"Subband coding (SBC) method has become an attractive strategy on image coding because it allows more flexibility in the design of coding schemes. A method which considers the intra-band correlation properties in the design of an optimal quadrature mirror filters (QMFs) bank tree is presented. It uses the entropy value of each band to determine if this band is to be further decomposed. The correlation properties between two neighbor high band signals are studied and discussed. It is found that the inter-band correlations are very high between two neighbor high band signals. In particular, more than 61% of samples in the higher band signals need not be encoded and transmitted. A new subband coder for image data is presented. Experimental results are presented in terms of bit rates and the quality of the reconstructed images. The signal-to-noise-ratio (SNR) performance of our subband coder is compared to those of other subband coding techniques. Under the same data rate, our subband coder achieves the best SNR performance.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"5 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":"117124504","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
Multicasting in a shared buffer memory switch 在共享缓冲存储器开关中进行多播
Tsern-Huei Lee, Shun-Jee Liu
{"title":"Multicasting in a shared buffer memory switch","authors":"Tsern-Huei Lee, Shun-Jee Liu","doi":"10.1109/TENCON.1993.319965","DOIUrl":"https://doi.org/10.1109/TENCON.1993.319965","url":null,"abstract":"A shared buffer memory switch with multicast capability has been proposed (H. Kuwahara et al., 1989). This switch has high hardware utilization but is unfair to unicast cells. Its performance may not be acceptable for some traffic patterns. We propose a new architecture to implement the multicast function in a shared buffer memory switch. Our design preserves the advantages of the original design, is fair to unicast and multicast cells, and maintains a good performance under any traffic pattern.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"21 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":"123953317","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
A new contour coherence based thinning algorithm 一种新的基于轮廓相干的稀疏算法
Liu Xiao-lin, Xie Dong
{"title":"A new contour coherence based thinning algorithm","authors":"Liu Xiao-lin, Xie Dong","doi":"10.1109/TENCON.1993.320108","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320108","url":null,"abstract":"A new contour-coherence based thinning algorithm is proposed in this paper. In the algorithm, the connectivity template is improved to avoid abnormal broken points. This algorithm only requires one time pre-scanning and all the pixels to be processed are determined by the contour-coherence criterion. The searching time and judgement time, therefore, is shortened by the algorithm so that the processing speed increases considerably. The topological property preservation of this algorithm is better than that of the classical thinning algorithm. This algorithm can guarantee that all the extracted skeletons are single-pixel wide which is very important for the automatic recognition of paper-map.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"40 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":"124093757","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
Survey of formal description techniques (FDTs) for protocol converter design 协议转换器设计的形式描述技术综述
E. Gunawan, T. Tong, S. Nansi
{"title":"Survey of formal description techniques (FDTs) for protocol converter design","authors":"E. Gunawan, T. Tong, S. Nansi","doi":"10.1109/TENCON.1993.320017","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320017","url":null,"abstract":"Protocol conversion is one of the very important research areas in protocol engineering. It is an effective approach to provide interconnectivity and interoperability between two different protocols. A protocol converter is a very complex piece of software, and its design must be precise and complete to provide the expected conversions. Formal description techniques (FDTs), which have formal syntax and semantics, are useful tools for its design. In this paper, we present a survey of existing and widely adopted FDTs, which has been made in view of the requirements of protocol converter design.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"68 5 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":"124101790","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
Short-term thermal unit commitment including reliability and dynamic economic dispatch 短期机组承诺包括可靠性和动态经济调度
Han Xueshan, L. Zuo
{"title":"Short-term thermal unit commitment including reliability and dynamic economic dispatch","authors":"Han Xueshan, L. Zuo","doi":"10.1109/TENCON.1993.320586","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320586","url":null,"abstract":"This paper presents a probabilistic technique which can be used to develop unit commitment schedules for continually changing loads in a power system for a specified period. The technique is developed on the basis of a system fulfilling reliability and dynamic economic dispatch. Typical unit commitment cases are illustrated with numerical examples.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"81 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":"125753151","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
Power system static voltage stability limit and the identification of weak bus 电力系统静态电压稳定限值及弱母线识别
Z. Yao, S. Wen-nan
{"title":"Power system static voltage stability limit and the identification of weak bus","authors":"Z. Yao, S. Wen-nan","doi":"10.1109/TENCON.1993.320608","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320608","url":null,"abstract":"This paper develops a new approach to find the power system static voltage stability limit using the conventional load flow solution method. The developed approach proposes a load admittance model to replace the load injection only on the heaviest load bus. Tested results in several systems show that the approach has advantages in terms of simplicity, flexibility, rapidity and accuracy. Based on the investigation of the voltage stability limits for the load buses, it is easy to identify the weak bus of the power system.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"456 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":"125850004","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
Frequency synthesis using non-integral subharmonic injection locking 使用非积分次谐波注入锁的频率合成
K.W. Wong, A. Lai
{"title":"Frequency synthesis using non-integral subharmonic injection locking","authors":"K.W. Wong, A. Lai","doi":"10.1109/TENCON.1993.327910","DOIUrl":"https://doi.org/10.1109/TENCON.1993.327910","url":null,"abstract":"Non-integral subharmonic injection locking behavior is presented in this paper. It was found that BJT oscillators can lock to its non-integral subharmonic such as 2/3, 3/4, 2/5 etc. In addition to the even and odd integral subharmonics. A feedback model is used to explain the effect. Applications of non-integral subharmonic injection locking can be found on the stabilization of a high frequency oscillator by a low frequency source, and on high frequency synthesis from a low frequency source in which the frequencies are non-integrally related. This will greatly increase the flexibility of injection-locked oscillator design and reduce the circuit complexity for mobile communication.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"30 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":"126181824","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
Petri net tools for analysis and verification of task scheduling algorithm in real time distributed process control system Petri网工具分析并验证了实时分布式过程控制系统中的任务调度算法
Qinghua Chen, Yongsen Wu, Zhu Hong
{"title":"Petri net tools for analysis and verification of task scheduling algorithm in real time distributed process control system","authors":"Qinghua Chen, Yongsen Wu, Zhu Hong","doi":"10.1109/TENCON.1993.320433","DOIUrl":"https://doi.org/10.1109/TENCON.1993.320433","url":null,"abstract":"This paper first show by formalism that a task scheduling algorithm can be equivalently specified by a set of rules, that is, a set of specification rules can constitute a task scheduling algorithm; and then show that these rules can be translated into a marked Petri net model involving the Petri net place,transitions and arcs that correspond to the states and state transition of the running procedure of the task scheduling algorithm so that reachability graph can be generated in terms of the model. From the reachability graph, we can see if there are livelock, deadlock and other faults of the task scheduling algorithm. In the last part, we illustrate an example to explain the detail process of rules' equivalent specification, rules' translation, and reachability graph generation in terms of a task scheduling algorithm, to analyse and verify its correctness and completeness.<<ETX>>","PeriodicalId":110496,"journal":{"name":"Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation","volume":"112 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":"125072564","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
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学术官方微信