2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)最新文献_第6页

Neuro-fuzzy control of a semi-active car suspension system 半主动汽车悬架系统的神经模糊控制

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953725

S. Foda

引用次数: 12

Quality of assured service through multiple DiffServ domains 通过多个diffserver域保证服务质量

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953528

K. Kumazoe, Y. Hori, T. Ikenaga, Y. Oie

{"title":"Quality of assured service through multiple DiffServ domains","authors":"K. Kumazoe, Y. Hori, T. Ikenaga, Y. Oie","doi":"10.1109/PACRIM.2001.953528","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953528","url":null,"abstract":"Differentiated service (DiffServ) is a technology which is proposed to provide quality of service (QoS) in the Internet, and it is superior to integrated service (IntServ) technology in respect to the simplicity of its architectures and the scalability of networks. Although various simulation studies and estimations over testbeds have investigated the QoS which is offered via the DiffServ framework, almost all of them were focused on the characteristics in a single DiffServ domain. However, the Internet is actually composed of a large number of AS (assured service) domains, and thus packets are very likely to arrive at their destinations through many different domains. From this viewpoint, we focus on the QoS performance in the model consisting of multiple DiffServ domains, especially we investigate quality of assured service to achieve statistical bandwidth allocation with AF-PHB (assured forwarding per hop behavior). Our simulation results show some throughput characteristics of flows over multiple DiffServ domains, and we also make it clear whether the network configurations and traffic properties have impacts on QoS over multiple DiffServ domains or not.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128601992","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

Iterative threshold decoding of punctured convolutional self doubly orthogonal codes and its application to M-ary modulation 穿孔卷积自双正交码的迭代阈值译码及其在M-ary调制中的应用

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953538

F. Dru, D. Haccoun

引用次数: 3

A concealment scheme for H.263 coded video transported over the Internet using the RTPUDPIP protocol 基于rtpudip协议的H.263编码视频隐藏方案

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953670

T.R. Huitika, H. Jeon, Nyeongkyu Kwon, P. Driessen

{"title":"A concealment scheme for H.263 coded video transported over the Internet using the RTPUDPIP protocol","authors":"T.R. Huitika, H. Jeon, Nyeongkyu Kwon, P. Driessen","doi":"10.1109/PACRIM.2001.953670","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953670","url":null,"abstract":"Packet video with real-time constraints, limited bandwidth, multicast distribution, and using the RTPUDPIP protocol must take into account packet losses (with a large payload size) due to network congestion. An effective solution for packet loss is to perform concealment at the receiver. In this paper, we propose a concealment scheme for the 'I' frame missing odd or even slices that address the above problems. The proposed concealment scheme uses the previous frame macroblock (MB) or the MB motion vector (MV) with a fast motion estimation algorithm, located at the same spatial location as the missing MB. The decision between the MB or MB MV with a fast motion estimation algorithm is determined by the amount of motion between the decoded upper and lower 1 pixel wide boundary (if available) of the missing MB and the MB located in same spatial location in the previous frame. The proposed scheme produced similar peak signal to noise ratio (PSNR) results while the Central Processing Unit (CPU) time is reduced by a factor of 30 when compared to the full search concealment technique.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129239573","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

Mining association algorithm with improved threshold based on ROC analysis 基于ROC分析的改进阈值挖掘关联算法

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953729

M. Kawahara, H. Kawano

引用次数: 4

High-level data path synthesis for built-in self-test designs 内置自测设计的高级数据路径综合

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953577

L. Yang, Jon C. Muzio

引用次数: 0

On-line data migration approaches and their performance comparisons 在线数据迁移方法及其性能比较

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953731

Jiahong Wang, N. Segawa, M. Miyazaki

引用次数: 2

A temporal object oriented conceptual schema model 一个面向时间对象的概念图式模型

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953734

B. Pasaya, S. Chittayasothorn

{"title":"A temporal object oriented conceptual schema model","authors":"B. Pasaya, S. Chittayasothorn","doi":"10.1109/PACRIM.2001.953734","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953734","url":null,"abstract":"NIAM is a fact-based conceptual schema model. It was primarily designed as a data model with a formal natural language. However, it is now a popular relational database design tool. NIAM shows clear distinction between the concept of objects and labels. Each entity type must have a unique identifier. So, it is suitable to be mapped to relational database schemas since it is based on the external identifier concept such as the primary keys. Nowadays, object-oriented databases popularity has increased. It is suitable for the representation of complex objects without external identifiers. This ability also makes it suitable for the representation of temporal data. Valid time and transaction time can be attached to attributes without any changes to the identifiers and time normalization which is required if the relational database model is used. This paper presents OONIAM, an extension to NIAM that supports the concepts of complex objects and temporal databases. The concepts of methods, main schemas and sub schemas are also introduced. A set of transformation steps from an OONIAM schema to object database schema is provided.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125281243","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

Automatic production of personalized contents with dynamic scenario 具有动态场景的个性化内容自动生成

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953530

M. Okamoto, J. Kamahara, S. Shimojo, H. Miyahara

{"title":"Automatic production of personalized contents with dynamic scenario","authors":"M. Okamoto, J. Kamahara, S. Shimojo, H. Miyahara","doi":"10.1109/PACRIM.2001.953530","DOIUrl":"https://doi.org/10.1109/PACRIM.2001.953530","url":null,"abstract":"Recently, the amount of information in the Internet has increased rapidly. Therefore, people on the Internet have come to desire recommendation systems, which can provide only the necessary information for them. In this article, we propose the method to offer the contents, in which the user is interested. Moreover, filtering the contents based on the contents providers' restrictions, the system can distribute the contents, with which both the user and the contents providers are satisfied. When distributing multiple contents at once, we should consider the relations between the contents. In this proposed method, we introduce the idea of the scenario selecting the contents. Processing the scenario template dynamically generates the scenario, which expresses the relations between the contents. Our system provides the contents distribution service, which realizes the personalization and the coordination in the presentations. We carried out the demonstrative experiments on the Internet using our system, which we implemented. In the experiments, it turns out that many users are satisfied with the coordination and the personalization in the presentations. We prove that our proposed method is effective.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126659597","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

TRES: traffic and reliability engineering server for MPLS TRES: MPLS流量和可靠性工程服务器

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI: 10.1109/PACRIM.2001.953700

K. Matsui, M. Kaneda, H. Takenaka, H. Ishii, M. Imase

引用次数: 1