Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287354
J. Lai, B. Soh
The tremendous growth in the amount of information available and the number of visitors to Web sites in the recent years poses some key challenges for information filtering and retrieval. Web visitors not only expect high quality and relevant information, but also wish that the information be presented in an as efficient way as possible. The traditional filtering methods, however, only consider the relevant values of document. These conventional methods fail to consider the efficiency of documents retrieval. In this paper, we propose a new algorithm to calculate an index called document similarity score based on elements of the document. Using the index, document profile will be derived. Any documents with the similarity score above a given threshold are clustered. Using these pre-clustered documents, information filtering and retrieval can be made more efficient.
{"title":"Using element and document profile for information clustering","authors":"J. Lai, B. Soh","doi":"10.1109/EEE.2004.1287354","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287354","url":null,"abstract":"The tremendous growth in the amount of information available and the number of visitors to Web sites in the recent years poses some key challenges for information filtering and retrieval. Web visitors not only expect high quality and relevant information, but also wish that the information be presented in an as efficient way as possible. The traditional filtering methods, however, only consider the relevant values of document. These conventional methods fail to consider the efficiency of documents retrieval. In this paper, we propose a new algorithm to calculate an index called document similarity score based on elements of the document. Using the index, document profile will be derived. Any documents with the similarity score above a given threshold are clustered. Using these pre-clustered documents, information filtering and retrieval can be made more efficient.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114956392","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287348
Eric Jui-Lin Lu, Chin-Wei Chen
The maturity of wireless technology has led to an ever-increasing interest in mobile ad hoc networks (MANETs). Many applications are expected to be developed using MANETs. However, the connectivity among mobile hosts may change due to their mobility which results in frequent disconnections. Thus, data accessibility in MANETs is lower than that in traditional fixed networks. To ensure high data accessibility, most researches utilized replica allocation methods to improve data accessibility in MANETs. We propose a new replica allocation method for allocating replicas with high access frequencies on mobile ad hoc networks.
{"title":"An enhanced EDCG replica allocation method in ad hoc networks","authors":"Eric Jui-Lin Lu, Chin-Wei Chen","doi":"10.1109/EEE.2004.1287348","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287348","url":null,"abstract":"The maturity of wireless technology has led to an ever-increasing interest in mobile ad hoc networks (MANETs). Many applications are expected to be developed using MANETs. However, the connectivity among mobile hosts may change due to their mobility which results in frequent disconnections. Thus, data accessibility in MANETs is lower than that in traditional fixed networks. To ensure high data accessibility, most researches utilized replica allocation methods to improve data accessibility in MANETs. We propose a new replica allocation method for allocating replicas with high access frequencies on mobile ad hoc networks.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114699060","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287317
Shu-Chin Wang, K. Yan, C. Wei
Internet brings us convenient communication and changes many aspects of existing businesses and generated new companies with new business models, business opportunity. In order to achieve a sustainable competitive advantage, enterprises must first understand then please their customers. To satisfy customer needs, enterprises have to reach personalized and interaction channels. We proposed electronic ticket (eTickets), self-organization map (SOM) and decision tree arrive at personalized mobile advertising recommend mechanism. All of these technological processes mainly aim at promoting the products and enhancing customer loyalty as well as providing appropriate personalized mobile advertising for more profit to achieve win-win result.
{"title":"Mobile target advertising by combining self-organization map and decision tree","authors":"Shu-Chin Wang, K. Yan, C. Wei","doi":"10.1109/EEE.2004.1287317","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287317","url":null,"abstract":"Internet brings us convenient communication and changes many aspects of existing businesses and generated new companies with new business models, business opportunity. In order to achieve a sustainable competitive advantage, enterprises must first understand then please their customers. To satisfy customer needs, enterprises have to reach personalized and interaction channels. We proposed electronic ticket (eTickets), self-organization map (SOM) and decision tree arrive at personalized mobile advertising recommend mechanism. All of these technological processes mainly aim at promoting the products and enhancing customer loyalty as well as providing appropriate personalized mobile advertising for more profit to achieve win-win result.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"478 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123056248","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287362
Yuan-Liang Tang, Ching-Ting Chen
In this paper, a novel watermarking technique for image authentication is proposed. This technique operates in the wavelet domain and makes use of semifragile watermarks for achieving better robustness. The image is first transformed into the wavelet domain and the relations between neighboring coefficients are utilized to authenticate the integrity of the image content. By carefully designing the processes of feature extraction and watermark embedding, the proposed method is able to identify malicious changes made on the image, while very insensitive to common image processing. In addition, the system is secure because not only the watermark is protected by a private key but also building relations between coefficients significantly discourages an adversary from performing the collage attack.
{"title":"Image authentication using relation measures of wavelet coefficients","authors":"Yuan-Liang Tang, Ching-Ting Chen","doi":"10.1109/EEE.2004.1287362","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287362","url":null,"abstract":"In this paper, a novel watermarking technique for image authentication is proposed. This technique operates in the wavelet domain and makes use of semifragile watermarks for achieving better robustness. The image is first transformed into the wavelet domain and the relations between neighboring coefficients are utilized to authenticate the integrity of the image content. By carefully designing the processes of feature extraction and watermark embedding, the proposed method is able to identify malicious changes made on the image, while very insensitive to common image processing. In addition, the system is secure because not only the watermark is protected by a private key but also building relations between coefficients significantly discourages an adversary from performing the collage attack.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228125","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287344
Shun-Tzu Tsai, Chao-Tung Yang
Decision tree is one of the frequently used methods in data mining for searching prediction information. Due to its characteristics which are suitable for parallelism, it has been widely adopted in high performance field and developed into various parallel decision tree algorithms to deal with huge data and complex computation. Following the development of other technology fields, grid computing is regarded as the extension of PC cluster and therefore it future research development is highly valued. This new wave of Internet application is the 3rd generation of Internet applications following the traditional Internet and Web application. We have presented a grid-based decision tree architecture, and hope it can be applied on both parallel and sequential algorithms for the decision tree applications. Also, based on the scope and model of data mining applied in grid environment as well as user equivalent perspective, grid roles can be categorized into three types. We are hoping that through these definitions, software developers can define clear system processes and differentiate the application scope for software applications. To fulfil our architecture, we first apply an existing parallel decision tree algorithm-SPRINT algorithm in the grid environment. The performance and differences in many other areas are compared using different sizes of dataset. The experimental results are used for future reference and further development.
{"title":"Decision tree construction for data mining on grid computing","authors":"Shun-Tzu Tsai, Chao-Tung Yang","doi":"10.1109/EEE.2004.1287344","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287344","url":null,"abstract":"Decision tree is one of the frequently used methods in data mining for searching prediction information. Due to its characteristics which are suitable for parallelism, it has been widely adopted in high performance field and developed into various parallel decision tree algorithms to deal with huge data and complex computation. Following the development of other technology fields, grid computing is regarded as the extension of PC cluster and therefore it future research development is highly valued. This new wave of Internet application is the 3rd generation of Internet applications following the traditional Internet and Web application. We have presented a grid-based decision tree architecture, and hope it can be applied on both parallel and sequential algorithms for the decision tree applications. Also, based on the scope and model of data mining applied in grid environment as well as user equivalent perspective, grid roles can be categorized into three types. We are hoping that through these definitions, software developers can define clear system processes and differentiate the application scope for software applications. To fulfil our architecture, we first apply an existing parallel decision tree algorithm-SPRINT algorithm in the grid environment. The performance and differences in many other areas are compared using different sizes of dataset. The experimental results are used for future reference and further development.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125281819","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287325
Tzong-Song Wang, L. Bright
The number of people who yet have either inferior service or no access needs to be a major concern to research and development leaders in engineering and e-commerce. The challenge for cyberspace leaders is to recognize and resolve the problem of the disenfranchised groups in the world who have not yet been touched by the concept of pervasive computing. The continued dominance of urban markets controls the direction of the free enterprise development of computing. Less populated and smaller markets in rural parts of the world go unserved or have to endure much slower, inferior, and non-competitive access. Professional engineering and education societies need systematic plans to increase potential for inclusiveness in the practical implementation of the pervasive computing vision. Innovation unheeded by major parts of society defeats the efforts of exceptional researchers. To further develop a pervasive cyberworld, technologists need to include groups that have been disenfranchised or disinterested.
{"title":"The challenge of exclusions in pervasive cyberspace","authors":"Tzong-Song Wang, L. Bright","doi":"10.1109/EEE.2004.1287325","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287325","url":null,"abstract":"The number of people who yet have either inferior service or no access needs to be a major concern to research and development leaders in engineering and e-commerce. The challenge for cyberspace leaders is to recognize and resolve the problem of the disenfranchised groups in the world who have not yet been touched by the concept of pervasive computing. The continued dominance of urban markets controls the direction of the free enterprise development of computing. Less populated and smaller markets in rural parts of the world go unserved or have to endure much slower, inferior, and non-competitive access. Professional engineering and education societies need systematic plans to increase potential for inclusiveness in the practical implementation of the pervasive computing vision. Innovation unheeded by major parts of society defeats the efforts of exceptional researchers. To further develop a pervasive cyberworld, technologists need to include groups that have been disenfranchised or disinterested.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126456138","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287291
Sakuna Vanichvisuttikul, C. Jungthirapanich
We discuss the potential of e-commerce development of the Thai rural people who are the products owners in the government project entitled OTOP (One Tambon or District, One Product) Project in Thailand. It is done by reviewing the awareness and readiness of the products owners who are the regional products champions from all over Thailand. This study also identifies the enabling factors, the limitations, and forecasts the future growth of e-commerce for OTOP Project. Additionally, it is beneficial to both parties; the government and the people in the rural areas, in solving the problem at the grass root level in Thailand. Five hundred products owners were selected from different products categories, 253 out of 500 responded with usable answers. The response rate was 50.6% which is higher than the expected rate for such surveys. The major problems of the existing OTOP production process and business operation are price, lack of funds for stock inventory and piracy of local wisdom. Awareness of e-commerce among these rural people is high but the level of acceptance for the knowledge and technology transferred are rather low, due to the digital divide in Thailand. Most of them are facing the same situations which are about seeking more distribution channels and enhancing more markets.
{"title":"The assessment of e-commerce awareness on highly valuable traditional products in Thailand","authors":"Sakuna Vanichvisuttikul, C. Jungthirapanich","doi":"10.1109/EEE.2004.1287291","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287291","url":null,"abstract":"We discuss the potential of e-commerce development of the Thai rural people who are the products owners in the government project entitled OTOP (One Tambon or District, One Product) Project in Thailand. It is done by reviewing the awareness and readiness of the products owners who are the regional products champions from all over Thailand. This study also identifies the enabling factors, the limitations, and forecasts the future growth of e-commerce for OTOP Project. Additionally, it is beneficial to both parties; the government and the people in the rural areas, in solving the problem at the grass root level in Thailand. Five hundred products owners were selected from different products categories, 253 out of 500 responded with usable answers. The response rate was 50.6% which is higher than the expected rate for such surveys. The major problems of the existing OTOP production process and business operation are price, lack of funds for stock inventory and piracy of local wisdom. Awareness of e-commerce among these rural people is high but the level of acceptance for the knowledge and technology transferred are rather low, due to the digital divide in Thailand. Most of them are facing the same situations which are about seeking more distribution channels and enhancing more markets.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126900304","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287345
Chao-Tung Yang, Yu-Lun Kuo, Chuan-Lin Lai
The popular technologies, Internet computing and grid technologies promise to change the way we tackle complex problems. They enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively transforms scientific disciplines ranging from high-energy physics to the life sciences. The computational analysis of biological sequences is a kind of computation driven science. Cause the biology data growing quickly and these databases are heterogeneous. We can use the grid system sharing and integrating the heterogeneous biology database. As we know, bioinformatics tools can speed up analysis the large-scale sequence data, especially about sequence alignment and analysis. The FASTA is a tool for aligning multiple protein or nucleotide sequences. These two bioinformatics software, which we used is a distributed and parallel version. The software uses a message-passing library called MPI (message passing interface) and runs on distributed workstation clusters as well as on traditional parallel computers. A grid computing environment is proposed and constructed on multiple Linux PC clusters by using globus toolkit (GT) and SUN grid engine (SGE). The experimental results and performances of the bioinformatics tool using on grid system are also presented.
{"title":"Design and implementation of a computational grid for bioinformatics","authors":"Chao-Tung Yang, Yu-Lun Kuo, Chuan-Lin Lai","doi":"10.1109/EEE.2004.1287345","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287345","url":null,"abstract":"The popular technologies, Internet computing and grid technologies promise to change the way we tackle complex problems. They enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively transforms scientific disciplines ranging from high-energy physics to the life sciences. The computational analysis of biological sequences is a kind of computation driven science. Cause the biology data growing quickly and these databases are heterogeneous. We can use the grid system sharing and integrating the heterogeneous biology database. As we know, bioinformatics tools can speed up analysis the large-scale sequence data, especially about sequence alignment and analysis. The FASTA is a tool for aligning multiple protein or nucleotide sequences. These two bioinformatics software, which we used is a distributed and parallel version. The software uses a message-passing library called MPI (message passing interface) and runs on distributed workstation clusters as well as on traditional parallel computers. A grid computing environment is proposed and constructed on multiple Linux PC clusters by using globus toolkit (GT) and SUN grid engine (SGE). The experimental results and performances of the bioinformatics tool using on grid system are also presented.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125464695","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287334
A. Wombacher, Péter Fankhauser, Bendick Mahleko, E. Neuhold
Web services have a potential to enhance B2B e-commerce over the Internet by allowing companies and organizations to publish their business processes on service directories where potential trading partners can find them. This can give rise to new business paradigms based on ad-hoc trading relations as companies, particularly small to medium scale, can cheaply and flexibly enter into fruitful contracts, e.g., through subcontracting from big companies by simply publishing their business processes and the services they offer. More business process support by the Web service infrastructure is however needed before such a paradigm change can materialize. A service for searching and matchmaking of business processes does not yet exist in the current infrastructure. We believe that such a service is needed and will enable companies and organizations to be able to establish ad-hoc business relations without relying on manually negotiated interorganizational workflows. We give a formal semantics to business process matchmaking based on finite state automata extended by logical expressions associated to states.
{"title":"Matchmaking for business processes based on choreographies","authors":"A. Wombacher, Péter Fankhauser, Bendick Mahleko, E. Neuhold","doi":"10.1109/EEE.2004.1287334","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287334","url":null,"abstract":"Web services have a potential to enhance B2B e-commerce over the Internet by allowing companies and organizations to publish their business processes on service directories where potential trading partners can find them. This can give rise to new business paradigms based on ad-hoc trading relations as companies, particularly small to medium scale, can cheaply and flexibly enter into fruitful contracts, e.g., through subcontracting from big companies by simply publishing their business processes and the services they offer. More business process support by the Web service infrastructure is however needed before such a paradigm change can materialize. A service for searching and matchmaking of business processes does not yet exist in the current infrastructure. We believe that such a service is needed and will enable companies and organizations to be able to establish ad-hoc business relations without relying on manually negotiated interorganizational workflows. We give a formal semantics to business process matchmaking based on finite state automata extended by logical expressions associated to states.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130608114","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}
Pub Date : 2004-03-28DOI: 10.1109/EEE.2004.1287283
Tao Yu, Kwei-Jay Lin
QoS (quality of service) support in Web services is an important issue. We present a QoS-capable Web service architecture, QCWS, by introducing a QoS broker module between service clients and providers (servers). The functions of the QoS broker module include collecting QoS information about servers, making selection decisions for clients, and negotiating with servers to get QoS commitments. We propose two resource allocation algorithms (HQ and RQ) used by QoS broker when broker acts as the front-end of a server. The goals of algorithms are to maximize the server resource usage while minimizing the QoS instability for each client. The QoS performance and instability tradeoffs of both algorithms are studied by simulation.
{"title":"The design of QoS broker algorithms for QoS-capable Web services","authors":"Tao Yu, Kwei-Jay Lin","doi":"10.1109/EEE.2004.1287283","DOIUrl":"https://doi.org/10.1109/EEE.2004.1287283","url":null,"abstract":"QoS (quality of service) support in Web services is an important issue. We present a QoS-capable Web service architecture, QCWS, by introducing a QoS broker module between service clients and providers (servers). The functions of the QoS broker module include collecting QoS information about servers, making selection decisions for clients, and negotiating with servers to get QoS commitments. We propose two resource allocation algorithms (HQ and RQ) used by QoS broker when broker acts as the front-end of a server. The goals of algorithms are to maximize the server resource usage while minimizing the QoS instability for each client. The QoS performance and instability tradeoffs of both algorithms are studied by simulation.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128923140","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：