Pub Date : 2002-04-08DOI: 10.1109/ITCC.2002.1000434
A. Kokkinaki, R. Dekker, R. Koster, W. Verbeke, C. Pappis
Reverse logistics, i.e. all operations related to the extension of a useful lifecycle for used products, commercial returns, excess inventory and packaging materials, is gaining increasing attention globally for its promising financial potential, its sustainable growth alternatives and the environmentally positive impact that it could have. In this paper, we include a brief discussion of the major reverse logistics issues and we present the new e-business models in this field. We identify key factors for their competitive advantages, and we discuss conceptual and current opportunities for these e-business models to thrive and advance. Finally, we outline some possible future developments of e-commerce tools for reverse logistics.
{"title":"E-business models for reverse logistics: contributions and challenges","authors":"A. Kokkinaki, R. Dekker, R. Koster, W. Verbeke, C. Pappis","doi":"10.1109/ITCC.2002.1000434","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000434","url":null,"abstract":"Reverse logistics, i.e. all operations related to the extension of a useful lifecycle for used products, commercial returns, excess inventory and packaging materials, is gaining increasing attention globally for its promising financial potential, its sustainable growth alternatives and the environmentally positive impact that it could have. In this paper, we include a brief discussion of the major reverse logistics issues and we present the new e-business models in this field. We identify key factors for their competitive advantages, and we discuss conceptual and current opportunities for these e-business models to thrive and advance. Finally, we outline some possible future developments of e-commerce tools for reverse logistics.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680419","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000424
Yan Mei, W. Lynch, T. Le-Ngoc
In this paper we propose a joint source/channel decoding scheme. This work combines information from classical Forward Error Correction (FEC) with information about the syntax and semantics of the received video along with the resulting video's continuity to give improved performance over classical FEC. One feature of this work is the need to find a slice evaluation measure which balances the likelihood of a slice from the point of view of the channel decoder with the quality of the decompressed slice.
{"title":"Joint forward error correction and error concealment for compressed video","authors":"Yan Mei, W. Lynch, T. Le-Ngoc","doi":"10.1109/ITCC.2002.1000424","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000424","url":null,"abstract":"In this paper we propose a joint source/channel decoding scheme. This work combines information from classical Forward Error Correction (FEC) with information about the syntax and semantics of the received video along with the resulting video's continuity to give improved performance over classical FEC. One feature of this work is the need to find a slice evaluation measure which balances the likelihood of a slice from the point of view of the channel decoder with the quality of the decompressed slice.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116642350","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000408
F. Giannotti, C. Gozzi, G. Manco
We present a partitioning method able to manage Web log sessions. Sessions are assimilable to transactions, i.e., tuples of variable size of categorical data. We adapt the standard definition of mathematical distance used in the K-Means algorithm to represent transactions dissimilarity, and redefine the notion of cluster centroid. The cluster centroid is used as the representative of the common properties of cluster elements. We show that using our concept of cluster centroid together with Jaccard distance we obtain results that are comparable with standard approaches, but substantially improve their efficiency.
{"title":"Characterizing Web user accesses: a transactional approach to Web log clustering","authors":"F. Giannotti, C. Gozzi, G. Manco","doi":"10.1109/ITCC.2002.1000408","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000408","url":null,"abstract":"We present a partitioning method able to manage Web log sessions. Sessions are assimilable to transactions, i.e., tuples of variable size of categorical data. We adapt the standard definition of mathematical distance used in the K-Means algorithm to represent transactions dissimilarity, and redefine the notion of cluster centroid. The cluster centroid is used as the representative of the common properties of cluster elements. We show that using our concept of cluster centroid together with Jaccard distance we obtain results that are comparable with standard approaches, but substantially improve their efficiency.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116798354","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000374
S. Al-Khayatt, S. Shaikh, Babak Akhgar, J. Siddiqi
The concept of virtual private networks offers a simple and cheap alternative to dedicated secure networks in corporate networks and Internet environments. The choice, however, of authentication and encryption techniques and protocols affect issues such as data throughput and performance throughout the network. This paper looks into the effects of video and audio streaming on performance, while deploying secure communications. Two operating system platforms are implemented in this investigation: Novell Netware and Windows 2000. Performance of the two arrangements is, subsequently, analyzed and evaluated.
{"title":"Performance of multimedia applications with IPSec tunneling","authors":"S. Al-Khayatt, S. Shaikh, Babak Akhgar, J. Siddiqi","doi":"10.1109/ITCC.2002.1000374","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000374","url":null,"abstract":"The concept of virtual private networks offers a simple and cheap alternative to dedicated secure networks in corporate networks and Internet environments. The choice, however, of authentication and encryption techniques and protocols affect issues such as data throughput and performance throughout the network. This paper looks into the effects of video and audio streaming on performance, while deploying secure communications. Two operating system platforms are implemented in this investigation: Novell Netware and Windows 2000. Performance of the two arrangements is, subsequently, analyzed and evaluated.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125308009","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000390
Yves Lépouchard, J. Pfaltz, R. Orlandic
While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on these data appeal to a small number of relevant dimensions. Unfortunately, the multidimensional access methods designed for high-dimensional data perform rather poorly for these partially specified queries. A potentially very appealing idea, frequently suggested in the literature, is to adopt a node-splitting policy that takes into account the "importance" of individual dimensions, which could be determined either a priori or through a statistical sampling of actual queries. This paper presents the results of some carefully controlled experiments conducted to observe the effects of query-based splitting on the performance of KDB-trees. The strategy is compared to a splitting policy that selects the split dimensions in a "cyclic" fashion, which has been shown to be very effective, especially in high-dimensional situations. Based on the results, the query-based splitting does not appear to be a very appealing splitting strategy for KDB-trees.
{"title":"Performance of KDB-trees with query-based splitting","authors":"Yves Lépouchard, J. Pfaltz, R. Orlandic","doi":"10.1109/ITCC.2002.1000390","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000390","url":null,"abstract":"While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on these data appeal to a small number of relevant dimensions. Unfortunately, the multidimensional access methods designed for high-dimensional data perform rather poorly for these partially specified queries. A potentially very appealing idea, frequently suggested in the literature, is to adopt a node-splitting policy that takes into account the \"importance\" of individual dimensions, which could be determined either a priori or through a statistical sampling of actual queries. This paper presents the results of some carefully controlled experiments conducted to observe the effects of query-based splitting on the performance of KDB-trees. The strategy is compared to a splitting policy that selects the split dimensions in a \"cyclic\" fashion, which has been shown to be very effective, especially in high-dimensional situations. Based on the results, the query-based splitting does not appear to be a very appealing splitting strategy for KDB-trees.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124632734","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000395
D. Lo, J. M. Chang, O. Frieder, D. Grossman
Due to its portability and popularity for Internet applications, Java has become one of the major programming languages. The similar syntax inherited from the C language and the pure object oriented features, compared to the non-pure object-oriented C++ language, have caused Java to be a good candidate as a tool in designing object oriented systems, especially in database servers. However the performance of the Java Virtual Machine (JVM) is the reason that several database designers, such as Oracle, IBM, Sybase and Informix, have not fully transferred their database management system (DBMS) into Java. One of the performance indices is the responsiveness for online transaction processing (OLTP) which may be dominated by the garbage collection system inside the JVM. In this paper eight Java programs, jess, javac, mtrt, compress, db, db4o, smallDB and ozone, are used to study the dynamic memory behavior. The latter four programs are Java object-oriented database management systems and their object behaviors are compared to those of the four regular Java programs. Simulation results such as object size distribution, average object size, object live distribution and total garbage collection cycle are reported.
{"title":"The object behavior of Java object-oriented database management systems","authors":"D. Lo, J. M. Chang, O. Frieder, D. Grossman","doi":"10.1109/ITCC.2002.1000395","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000395","url":null,"abstract":"Due to its portability and popularity for Internet applications, Java has become one of the major programming languages. The similar syntax inherited from the C language and the pure object oriented features, compared to the non-pure object-oriented C++ language, have caused Java to be a good candidate as a tool in designing object oriented systems, especially in database servers. However the performance of the Java Virtual Machine (JVM) is the reason that several database designers, such as Oracle, IBM, Sybase and Informix, have not fully transferred their database management system (DBMS) into Java. One of the performance indices is the responsiveness for online transaction processing (OLTP) which may be dominated by the garbage collection system inside the JVM. In this paper eight Java programs, jess, javac, mtrt, compress, db, db4o, smallDB and ozone, are used to study the dynamic memory behavior. The latter four programs are Java object-oriented database management systems and their object behaviors are compared to those of the four regular Java programs. Simulation results such as object size distribution, average object size, object live distribution and total garbage collection cycle are reported.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078388","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000387
S. Sirkemaa
Information system development is often connected to functional requirements and business processes in an organization. The development of the basic information technology infrastructure (IT infrastructure) is therefore easily forgotten. However, a reliable infrastructure is the key to successful operations. As business requirements, the flexibility of the IT infrastructure becomes important. We argue that standards play a key role in development of an IT infrastructure that is flexible and adapts to future business needs.
{"title":"IT infrastructure management and standards","authors":"S. Sirkemaa","doi":"10.1109/ITCC.2002.1000387","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000387","url":null,"abstract":"Information system development is often connected to functional requirements and business processes in an organization. The development of the basic information technology infrastructure (IT infrastructure) is therefore easily forgotten. However, a reliable infrastructure is the key to successful operations. As business requirements, the flexibility of the IT infrastructure becomes important. We argue that standards play a key role in development of an IT infrastructure that is flexible and adapts to future business needs.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124074827","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000396
Su-Bong Hong, Hyo-Jik Lee, Geun-Young Chun, Hyunki Baik, Myong-Soon Park
Describes a fast block-matching algorithm (BMA) for motion estimation exploiting the center-biased motion vector distribution characteristic more efficiently than the center-biased hybrid search (CBHS) algorithm does. This proposed algorithm, which is called the "fast center-biased hybrid search" (FCBHS), employs a hybrid method of a compact plus-shaped search, an X-shaped search and a diamond search to reduce the search point for motion vectors which are distributed within a 2-pixel radius of the center of the search window. Experimental results show that the FCBHS algorithm is about 44 times faster than a full search and 7-10% faster than the CBHS algorithm. Such a fast sub-optimal motion estimation algorithm is essential for situations which have limited processing power and constraints on the amount of power consumption, like real-time mobile video coding applications. This paper compares the popular sub-optimal block-matching technique with FCBHS, for which both the processing speed and the accuracy of motion compensation are tested over widely-used H.263 test video sequences.
{"title":"FCBHS: a fast center-biased hybrid search algorithm for fast block motion estimation","authors":"Su-Bong Hong, Hyo-Jik Lee, Geun-Young Chun, Hyunki Baik, Myong-Soon Park","doi":"10.1109/ITCC.2002.1000396","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000396","url":null,"abstract":"Describes a fast block-matching algorithm (BMA) for motion estimation exploiting the center-biased motion vector distribution characteristic more efficiently than the center-biased hybrid search (CBHS) algorithm does. This proposed algorithm, which is called the \"fast center-biased hybrid search\" (FCBHS), employs a hybrid method of a compact plus-shaped search, an X-shaped search and a diamond search to reduce the search point for motion vectors which are distributed within a 2-pixel radius of the center of the search window. Experimental results show that the FCBHS algorithm is about 44 times faster than a full search and 7-10% faster than the CBHS algorithm. Such a fast sub-optimal motion estimation algorithm is essential for situations which have limited processing power and constraints on the amount of power consumption, like real-time mobile video coding applications. This paper compares the popular sub-optimal block-matching technique with FCBHS, for which both the processing speed and the accuracy of motion compensation are tested over widely-used H.263 test video sequences.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115850384","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000386
R. Charlot
Software tools used to administer databases are vendor specific, proprietary, and require extensive prior database knowledge on the part of the database professional. We have developed dbAnalyst, a vendor independent database administration and maintenance tool. dbAnalyst is an Open Architecture database administration and maintenance tool that can be used to graphically show a database schema, manage database objects, import and export database content, and generate database alerts. dbAnalyst can also be used to reverse engineer existing databases to uncover database objects and relationships and diagnose impending database issues. These features, and a uniform interface to any database, are supported for Structure Query Language-type databases.
{"title":"Providing an infrastructure for a cross database management tool","authors":"R. Charlot","doi":"10.1109/ITCC.2002.1000386","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000386","url":null,"abstract":"Software tools used to administer databases are vendor specific, proprietary, and require extensive prior database knowledge on the part of the database professional. We have developed dbAnalyst, a vendor independent database administration and maintenance tool. dbAnalyst is an Open Architecture database administration and maintenance tool that can be used to graphically show a database schema, manage database objects, import and export database content, and generate database alerts. dbAnalyst can also be used to reverse engineer existing databases to uncover database objects and relationships and diagnose impending database issues. These features, and a uniform interface to any database, are supported for Structure Query Language-type databases.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134192919","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 : 2002-04-08DOI: 10.1109/ITCC.2002.1000382
A. Duong, Kiem Hoang, Minh Tran, Luong Han Co
Every year, millions of pupils take part in the baccalaureate examination and entrance examinations to universities or colleges in Vietnam. It is vital to keep the questions secret in order to maintain fairness and protect the legal rights of participants. We exploit the new and very secure cryptographic algorithms, especially the Advanced Encryption Standard, to devise a practical and effective method for examination security.
{"title":"The Advanced Encryption Standard and its application in the examination security in Vietnam","authors":"A. Duong, Kiem Hoang, Minh Tran, Luong Han Co","doi":"10.1109/ITCC.2002.1000382","DOIUrl":"https://doi.org/10.1109/ITCC.2002.1000382","url":null,"abstract":"Every year, millions of pupils take part in the baccalaureate examination and entrance examinations to universities or colleges in Vietnam. It is vital to keep the questions secret in order to maintain fairness and protect the legal rights of participants. We exploit the new and very secure cryptographic algorithms, especially the Advanced Encryption Standard, to devise a practical and effective method for examination security.","PeriodicalId":115190,"journal":{"name":"Proceedings. International Conference on Information Technology: Coding and Computing","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129379907","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
扫码关注我们
求助内容：
应助结果提醒方式：