发布求助
文献互助 智能选刊 最新文献

Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)最新文献

筛选
英文 中文
A novel substrate-bias generator for low-power and high-speed DRAMs 一种用于低功耗高速dram的新型衬底偏置发生器
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818555
S. Kwack, Seunghoon Lee, J. Joo, B. Ko, Byungjoon Song, Jae-geun Park, K. Kwack
{"title":"A novel substrate-bias generator for low-power and high-speed DRAMs","authors":"S. Kwack, Seunghoon Lee, J. Joo, B. Ko, Byungjoon Song, Jae-geun Park, K. Kwack","doi":"10.1109/TENCON.1999.818555","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818555","url":null,"abstract":"This paper describes an efficient substrate-bias generator (SBG) for low-power and high-speed DRAMs. In this SBG, the charge pumping circuit and driving and supply voltage circuit are newly proposed. The proposed circuit has advantages as follows. First, the charge pumping circuit doesn't suffer from V/sub T/ loss and is applicable to low-voltage DRAMs. Second, the driving and supply voltage switching circuit can supply stable substrate voltage by switching the supply voltage of the driving stage. So, it can reduce the power consumption by making a stable substrate back bias voltage (V/spl dot//sub BB/) because of its high pumping efficiency.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129429467","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
An improved zero-voltage transition inverter for induction motor drive application 一种用于感应电机驱动的改进型零电压转换逆变器
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818586
S.R. Lee, S. Ko, S. Kwon, S.H. Kim, I. Song
{"title":"An improved zero-voltage transition inverter for induction motor drive application","authors":"S.R. Lee, S. Ko, S. Kwon, S.H. Kim, I. Song","doi":"10.1109/TENCON.1999.818586","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818586","url":null,"abstract":"In this paper the diode bridge-type ZVT (zero-voltage transition) inverter is proposed. It consists of one auxiliary switch, three resonant inductors and six blocking diodes. So, the advantage of the proposed topology is the reduction of the auxiliary switch. The topology of the proposed ZVT inverter is analyzed with a description of the control conditions based on the load current. Therefore, in this paper two control algorithms are discussed. A variable resonant pattern control algorithm using load current feedback, and a resonant period control algorithm using resonant inductor current feedback, is proposed in order to achieve the ZVT switching condition in full control range and the reducing current spike main switches caused by a reverse recovery problem.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129791624","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
Biometrics electronic purse 生物识别电子钱包
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818579
A. Wahab, E.C. Tan, S. M. Heng
{"title":"Biometrics electronic purse","authors":"A. Wahab, E.C. Tan, S. M. Heng","doi":"10.1109/TENCON.1999.818579","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818579","url":null,"abstract":"This paper proposes an efficient and universal smart card system to be implemented for banking applications over the Internet to support the fast growing electronic commerce industry. Encryption technology such as digital certificates and signatures were exploited and integrated with other authentication specifications (e.g. SET) to provide secure transactions over a distributed network. A simple PIN code verification is no longer sufficient and would require a more complex and fool proof authentication method. A 56-bit DES encryption algorithm can easily be broken in just 2 to 3 days using the EFF DES CRACKER, an unclassified ASIC machine. This paper looks into using biometrics as a means of authentication, thus requiring a new generation of smart card technology to be implemented in banking and a multiple applications environment. A prototype of the proposed biometrics electronic purse (BEP) was built using the Schlumberger Cyberflex Multi8K Java Card with simple file management utilities software to upload/download biometrics template to/from the Java card.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129796376","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
Facial feature tracking for eye-head controlled human computer interface 眼-头人机界面人脸特征跟踪
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818352
Jong-gook Ko, Kyungnam Kim, R. S. Ramakrishna
{"title":"Facial feature tracking for eye-head controlled human computer interface","authors":"Jong-gook Ko, Kyungnam Kim, R. S. Ramakrishna","doi":"10.1109/TENCON.1999.818352","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818352","url":null,"abstract":"In this paper, we propose a robust fast and cheap scheme for locating the eyes, lip-corners, and nostrils for eye-head controlled human computer interface on a facial image with non-constrained background. Many researchers have presented eye tracking methods. But the methods are not both robust and fast, and they also have many limitations. The method we propose uses complete graph matching from thresholded images. That is, after labeling the binarized image that is separated by a proper threshold value, the algorithm computes the similarity of between all pairs of objects. After that, the two objects that have the greatest similarity are selected as eyes. The average computing time of the image (360*240) is within 0.2 (sec) and if the search window is reduced by estimation, the average computing time is within 0.1 (sec). It has been tested on several sequential facial images with different illuminating conditions and varied head poses. It returned quite a satisfactory performance in both speed and accuracy. The algorithm is highly cost effective.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129850068","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}
引用次数: 25
A multimedia synchronization model for efficient service of quality 一种高效优质服务的多媒体同步模型
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818416
K.W. Lee, D. Oh, K.H. Lee, G. Lee, T. Kim, H. Oh
{"title":"A multimedia synchronization model for efficient service of quality","authors":"K.W. Lee, D. Oh, K.H. Lee, G. Lee, T. Kim, H. Oh","doi":"10.1109/TENCON.1999.818416","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818416","url":null,"abstract":"In this paper we propose dynamic timed synchronization model which describes the dynamic key and relative time medium and QoS requirements flexibly and scalably. It is required that the synchronization model describes various multimedia objects flexibly from the view point of time relationships and also respond to quality of service requirements about jitter which is the time difference between intra-media and skew. The proposed model can be easily applied for high quality of service and it is recommended for efficient synchronization of dynamic key and time medium. The proposed model applies maximum jitter and skew values which can be allowed, and then it presents high quality of service and real time characteristics. In this paper we use Petri nets and propose a new synchronization specification model and apply two analysis methods of Petri nets to prove the suggested model.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128322575","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
A study on a method to transmit compressed image files using paging network 一种利用分页网络传输压缩图像文件的方法研究
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818397
Yeyun Go, Byungdoo Lee, Kyuseob Cho
{"title":"A study on a method to transmit compressed image files using paging network","authors":"Yeyun Go, Byungdoo Lee, Kyuseob Cho","doi":"10.1109/TENCON.1999.818397","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818397","url":null,"abstract":"We propose a method to transmit compresses image files for wireless multimedia services based on FLEX. In a conventional paging system, traffic congestion and delay are serious problems in transmitting large binary files. To overcome these problems, we propose to use a JPEG optimizer to reduce the file size within 4 kbytes and divide a file into a number of small size files. In addition, we assign 4 reserved bits in the header of the message codeword as the divided file number which are used for reassembling divided files into the original binary file. We verify the quality of the transmitted image files by simulation. The results tell us that the proposed method can be operated well under the required BER=10/sup -3/ which is the typical value for wireless communication services.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128196624","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
A secretary agent system based on HTTP client-server protocol 基于HTTP客户端-服务器协议的秘书代理系统
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818612
Chang H. Park, Jae-Young Kwak
{"title":"A secretary agent system based on HTTP client-server protocol","authors":"Chang H. Park, Jae-Young Kwak","doi":"10.1109/TENCON.1999.818612","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818612","url":null,"abstract":"Recently, according to the rapid development of the Internet and communication technologies, a lot of work based on network techniques has been undertaken. In relation to this trend, the agent systems that had been studied in early AI research have been studied greatly in association with these network techniques. This paper describes the design and implementation of a secretary agent system in which each secretary agent can manage the schedules of his/her superior. In the presented agent system, a database system and a knowledge-based system are linked and operated together in order to provide a secretary agent with the ability to make decisions on lots of schedule data.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129806258","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
On a minimax realization problem on flow networks 流网络的极大极小实现问题
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818539
H. Tamura, M. Sengoku, S. Shinoda, T. Abe
{"title":"On a minimax realization problem on flow networks","authors":"H. Tamura, M. Sengoku, S. Shinoda, T. Abe","doi":"10.1109/TENCON.1999.818539","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818539","url":null,"abstract":"We consider a realization problem of an undirected flow network N from a matrix M. We assume that M is not always a terminal capacity matrix. In our previous study, we considered a problem to minimize the differences between capacities between vertex pairs in N, and elements of M. We called this problem \"minimax realization problem.\" In this paper, we propose another minimax realization problem and propose an algorithm to minimize the differences.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127526687","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
Optimal fractal image coding 最优分形图像编码
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818498
Deng Cai, M. Hirobe
{"title":"Optimal fractal image coding","authors":"Deng Cai, M. Hirobe","doi":"10.1109/TENCON.1999.818498","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818498","url":null,"abstract":"Image compression techniques based on fractals or the iterated function systems (IFS) theory have been developed in the last few years, and may promise better compression performance. Fractal image compression techniques are being developed due to the recognition that fractals can describe natural scenes better than shapes of traditional geometry. These facts are reasoned that because images of the real world tend to consist of many complex patterns that recur at various sizes, i.e. fractals. There should be a way to translate pictures into fractal equations. Images so coded would require less data and thus less disk space to store and less time to transmit. In addition, the images are resolution-independent. In the present report, we discuss an optimal fractal image coding minimizing the Lagrangian cost function J(partition)=Distortion(partition)+/spl lambda/Rate(partition).","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130041068","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
Performance of regular and irregular dynamic MINs 规则和不规则动态MINs的性能
Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030) Pub Date : 1999-09-15 DOI: 10.1109/TENCON.1999.818442
J. Sengupta, P. Bansal
{"title":"Performance of regular and irregular dynamic MINs","authors":"J. Sengupta, P. Bansal","doi":"10.1109/TENCON.1999.818442","DOIUrl":"https://doi.org/10.1109/TENCON.1999.818442","url":null,"abstract":"The fault-tolerant behavior of an irregular network, quad tree, has been analyzed and compared with a regular network, the augmented baseline network, under fault-free conditions and in the presence of faults. Identity permutation allows most memory references to be made without conflict where the topology of the network plays a decisive role. Both the MINs pass all the permutations, but under fault-free conditions, in irregular networks, 50% of the requests passed have minimum path length of just 2 irrespective of the size of the network, which is not the case of regular networks. Under similar conditions, the path length available is more than 2. This paper also analyses and compares the reliability of these MINs which again shows that the reliability of irregular MINs is better than that of regular MINs.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130086272","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}
引用次数: 18
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信